{"id":"W2006905759","doi":"10.1137/s1052623401398120","title":"A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":56,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Quadratic growth; Mathematics; Quadratically constrained quadratic program; Quadratic programming; Second-order cone programming; Mathematical optimization; Rate of convergence; Quadratic equation; Differentiable function; Convex optimization; Interior point method; Sequential quadratic programming; Quadratic function; Function (biology); Convergence (economics); Regular polygon; Algorithm; Computer science; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009235641,0.0008771059,0.000862314,0.0004543902,0.0004603156,0.0005793858,0.001095336,0.0006857889,0.006374431],"category_scores_gemma":[0.001425082,0.000409328,0.0007863538,0.0007251799,0.000640763,0.0007699497,0.001184165,0.001519266,0.002316313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004022424,"about_ca_system_score_gemma":0.001434763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002326051,"about_ca_topic_score_gemma":0.002995639,"domain_scores_codex":[0.9993938,0.000160034,0.00002207979,0.00007663852,0.0003176739,0.0000297782],"domain_scores_gemma":[0.9996114,0.0001597225,0.00003078997,0.00004358341,0.0001196729,0.00003485323],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001404962,0.0001392813,0.00039979,0.0005016678,0.00009873048,0.0001935056,0.0001239376,0.4868859,0.01840137,0.09194363,0.01449517,0.3866765],"study_design_scores_gemma":[0.00002170866,0.0000671344,0.00005579422,0.00001047814,0.000008680659,0.00006400654,0.000004963731,0.9792595,0.001346911,0.009056599,0.01009485,0.000009370175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005078146,0.00007616133,0.9980085,0.00004838772,0.00003387751,0.00002133614,0.00001637712,0.0001206822,0.001166747],"genre_scores_gemma":[0.04090634,0.0003030977,0.9517169,0.0001101907,0.0001046166,0.0002248919,0.0001599697,0.0002483481,0.006225582],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006374431,"threshold_uncertainty_score":0.02132457,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06237039632763324,"score_gpt":0.3968067002934668,"score_spread":0.3344363039658335,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}