{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001395831,0.001447118,0.001725014,0.001114245,0.001006749,0.001587696,0.001749923,0.001553513,0.007643895],"category_scores_gemma":[0.006434358,0.001317096,0.0009802898,0.001875813,0.001552949,0.00204907,0.002256114,0.004689926,0.0021558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001463286,"about_ca_system_score_gemma":0.001897019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005333445,"about_ca_topic_score_gemma":0.008941625,"domain_scores_codex":[0.999037,0.0003988377,0.0000344717,0.0001155559,0.0003341993,0.00008004087],"domain_scores_gemma":[0.998026,0.001328061,0.0001176545,0.0001682551,0.0002772151,0.00008285784],"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.0001465685,0.0001411801,0.0003146147,0.0004429972,0.00008563488,0.00004151515,0.0001683842,0.4491145,0.001749076,0.326423,0.01669543,0.204677],"study_design_scores_gemma":[0.00002537198,0.00002664432,0.00009100132,0.00004321089,0.0000119355,0.0000187235,0.00002148112,0.855278,0.0007310634,0.1359467,0.007791646,0.00001418706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001262664,0.0003860801,0.9920438,0.0001553986,0.00008610677,0.00003052518,0.00004526927,0.0001654973,0.005824728],"genre_scores_gemma":[0.1011013,0.001258018,0.8777627,0.0003447369,0.0002426413,0.0004001444,0.0003690354,0.0007029444,0.01781841],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007643895,"threshold_uncertainty_score":0.02557141,"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."}}