{"id":"W2116208947","doi":"10.1287/ijoc.1030.0065","title":"The Analytic-Center Cutting-Plane Method for Variational Inequalities: A Quadratic-Cut Approach","year":2005,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; Université de Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Quadratic equation; Cutting-plane method; Quadratic programming; Feasible region; Quadratically constrained quadratic program; Quadratic function; Active set method; Isotropic quadratic form; Plane (geometry); Variational inequality; Applied mathematics; Mathematical optimization; Binary quadratic form; Geometry; Nonlinear programming; Nonlinear system; Integer programming","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.002915865,0.001433479,0.001346133,0.001498767,0.0006024678,0.001609262,0.002696801,0.001769125,0.004749958],"category_scores_gemma":[0.005597563,0.000954886,0.001210717,0.00139616,0.001280456,0.001553408,0.00234925,0.003746639,0.001083473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001451029,"about_ca_system_score_gemma":0.001803183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002440297,"about_ca_topic_score_gemma":0.001876614,"domain_scores_codex":[0.9988109,0.000476002,0.00004249267,0.0001291958,0.000443784,0.0000976079],"domain_scores_gemma":[0.9984027,0.0008999928,0.00009811161,0.0001245668,0.000395903,0.00007889265],"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.00009852654,0.0001067925,0.0003921943,0.0002773481,0.0000640023,0.0001083613,0.000147627,0.5254294,0.004381167,0.2980447,0.005182671,0.1657672],"study_design_scores_gemma":[0.0000191335,0.00003769006,0.00004768106,0.00001979157,0.000007417835,0.00002927033,0.00001243959,0.9497329,0.0008376711,0.04484123,0.004403972,0.00001078698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004745371,0.00006516946,0.9986647,0.00004646866,0.00001243685,0.00002078832,0.00001409445,0.00004722939,0.0006545652],"genre_scores_gemma":[0.03756369,0.0002413754,0.9596171,0.000100899,0.00005226998,0.0002367729,0.0001311255,0.0001896725,0.001867055],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004749958,"threshold_uncertainty_score":0.01589018,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07408299595125604,"score_gpt":0.4087650938533386,"score_spread":0.3346820979020826,"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."}}