{"id":"W1996513689","doi":"10.1007/s10107-002-0330-1","title":"An analytic center quadratic cut method for the convex quadratic feasibility problem","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University; Concordia University","funders":"","keywords":"Mathematics; Quadratic equation; Quadratic function; Quadratically constrained quadratic program; Isotropic quadratic form; Quadratic programming; Convex function; Combinatorics; Regular polygon; Quadratic growth; Convex set; Convex optimization; Polynomial; Binary quadratic form; Discrete mathematics; Mathematical optimization; Algorithm; Mathematical analysis; Geometry","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.001433389,0.001001386,0.001339576,0.00128221,0.0006180189,0.001487442,0.00180975,0.001483896,0.008246558],"category_scores_gemma":[0.004184294,0.0006264338,0.0008392524,0.00109618,0.0008710875,0.001530431,0.001932713,0.003195691,0.001457588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008722068,"about_ca_system_score_gemma":0.001531398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001813308,"about_ca_topic_score_gemma":0.001960055,"domain_scores_codex":[0.9993395,0.0001764838,0.00001808421,0.00008559696,0.0003325944,0.00004771145],"domain_scores_gemma":[0.998858,0.0005946925,0.00005965123,0.00006518538,0.0003451445,0.0000772921],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003196049,0.0002688042,0.0003599074,0.0004132124,0.00009787473,0.0001256068,0.0001676209,0.2737426,0.01314137,0.3421292,0.0194257,0.3498085],"study_design_scores_gemma":[0.00003373943,0.00004469582,0.00006553772,0.00002063231,0.00001503036,0.00004777036,0.00001412871,0.9556959,0.001075543,0.03762836,0.005346696,0.00001201973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009915563,0.00007902614,0.9971319,0.00007138232,0.00004707907,0.00002579061,0.00002604092,0.00007704391,0.001550194],"genre_scores_gemma":[0.04929928,0.0002726274,0.9439216,0.0001765278,0.0001354631,0.000276669,0.0002027245,0.0002992341,0.005415754],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008246558,"threshold_uncertainty_score":0.02758753,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1532420161928478,"score_gpt":0.4432078262764525,"score_spread":0.2899658100836047,"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."}}