{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002526864,0.0003975932,0.0006875307,0.0001223599,0.0005236817,0.0003785052,0.0007154777,0.0001605194,0.001111168],"category_scores_gemma":[0.003165442,0.0002644887,0.0002808455,0.0005750633,0.0002782545,0.0003828098,0.0001143117,0.0004375702,0.0001320432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001734085,"about_ca_system_score_gemma":0.00003623487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003746207,"about_ca_topic_score_gemma":0.00001839324,"domain_scores_codex":[0.9961673,0.000405457,0.001038193,0.0006675999,0.0008070448,0.0009143883],"domain_scores_gemma":[0.9939821,0.003795645,0.0002793771,0.001250407,0.0003719959,0.0003204608],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001933829,0.0126387,0.000561673,0.009081792,0.0009612964,0.00004247879,0.01579884,0.002772633,0.0003000839,0.5811244,0.003971861,0.3725528],"study_design_scores_gemma":[0.0007980439,0.0002076008,0.000003449435,0.00007994552,0.0001191004,0.00002984199,0.0008106669,0.7503108,0.00009421675,0.2463113,0.0009557878,0.0002792274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000450163,0.00007734973,0.9921287,0.001346373,0.00005178378,0.004606171,0.00001148073,0.0003409506,0.0009870855],"genre_scores_gemma":[0.04249016,0.000006651494,0.9545605,0.0001338976,0.0001129849,0.001073396,0.00001114418,0.0001105288,0.001500733],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7475382,"threshold_uncertainty_score":0.9999807,"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."}}