{"id":"W2988554220","doi":"10.1007/s10107-025-02219-y","title":"Polyhedral Newton-min algorithms for complementarity problems","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Polyhedron; Epigraph; Quadratic growth; Descent direction; Convex function; Newton's method; Function (biology); Newton's method in optimization; Nonlinear complementarity problem; Regular polygon; Zero (linguistics); Monotonic function; Sequence (biology); Interior point method; Local convergence; Nonlinear system; Applied mathematics; Complementarity theory; Mathematical optimization; Algorithm; Gradient descent; Iterative method; Mathematical analysis; Computer science; Combinatorics; Geometry","routes":{"ca_aff":true,"ca_fund":true,"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.0009842471,0.0002986485,0.0005192269,0.0002070468,0.0003643263,0.0001927806,0.000442476,0.0001318862,0.0002830922],"category_scores_gemma":[0.001625858,0.0002688559,0.0001968126,0.0005671093,0.0001946417,0.0001889374,0.0002593747,0.0002952904,0.00003396937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00018617,"about_ca_system_score_gemma":0.00009487758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009868727,"about_ca_topic_score_gemma":0.00001379873,"domain_scores_codex":[0.9973354,0.0000745268,0.0007955032,0.000485362,0.0004811811,0.000827998],"domain_scores_gemma":[0.9974867,0.001412337,0.000146595,0.0005081289,0.0002745024,0.0001717312],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000401896,0.001109912,0.00008506705,0.002250091,0.0001736628,0.000004852772,0.000592157,0.00009849335,0.0001208266,0.8389974,0.004021128,0.1525062],"study_design_scores_gemma":[0.001416338,0.0001256805,0.000008434148,0.0002392155,0.00006973285,0.000007049889,0.0004609247,0.1311371,0.0006001068,0.8330734,0.03253883,0.0003231148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004862931,0.00006463925,0.9912712,0.002021967,0.0001146507,0.003085856,0.00002009497,0.0003882407,0.002547035],"genre_scores_gemma":[0.003511075,0.000003450599,0.9886193,0.0001382129,0.00008580786,0.001138458,0.00003504118,0.00006139587,0.006407267],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1521831,"threshold_uncertainty_score":0.9999763,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1313691358382811,"score_gpt":0.4443787113579616,"score_spread":0.3130095755196805,"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."}}