{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00140771,0.0003585924,0.0005197202,0.0003975611,0.0006028433,0.0004288937,0.0002302231,0.0002218416,0.0009127372],"category_scores_gemma":[0.005221777,0.0003272874,0.0002069382,0.0005739118,0.0001017493,0.0004902036,0.00002307723,0.0004290356,0.000009784073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002533767,"about_ca_system_score_gemma":0.0003810527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.427288e-7,"about_ca_topic_score_gemma":0.000001519907,"domain_scores_codex":[0.996449,0.0006982617,0.00102506,0.0004339788,0.0007558551,0.0006378402],"domain_scores_gemma":[0.9964651,0.001168602,0.0006197946,0.0003141898,0.001115785,0.0003165027],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000205572,0.0005395979,0.00001323107,0.0001542093,0.0001568802,0.00001206493,0.0003526223,0.805012,0.0002486906,0.1878788,0.0008337981,0.004592501],"study_design_scores_gemma":[0.003225451,0.0005456461,0.000001004851,0.0001231875,0.0001110717,0.0001584041,0.000370603,0.9454376,0.001824562,0.04564778,0.002148906,0.0004058471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009010021,0.00003252706,0.9955232,0.0005175121,0.0003368575,0.001498899,0.00001315121,0.0001357726,0.001852054],"genre_scores_gemma":[0.003791364,0.00004196803,0.9939225,0.0001954715,0.0001684344,0.0001554123,0.00007259583,0.0001133743,0.001538836],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.142231,"threshold_uncertainty_score":0.9999179,"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."}}