{"id":"W3040442494","doi":"10.1007/s10957-020-01706-w","title":"On Approximate Stationary Points of the Regularized Mathematical Program with Complementarity Constraints","year":2020,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Guelph; Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Conseil Régional de Bretagne; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Stationary point; Mathematics; Theory of computation; Complementarity (molecular biology); Stationary sequence; Sequence (biology); Stationary solution; Applied mathematics; Regularization (linguistics); Convergence (economics); Stationary state; Mathematical optimization; Weak convergence; Constraint (computer-aided design); Stationary process; Mathematical analysis; Stochastic process; Algorithm; Computer science; 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":[],"consensus_categories":[],"category_scores_codex":[0.0003733074,0.00007999308,0.0001608968,0.00005396913,0.0001450204,0.00005494528,0.0003086531,0.00002461657,0.0001252912],"category_scores_gemma":[0.00009005711,0.00004998959,0.00005871688,0.0004681709,0.0001524482,0.0002077529,0.00005184265,0.00009641964,0.000001159541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000115371,"about_ca_system_score_gemma":0.0000748915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.259721e-7,"about_ca_topic_score_gemma":7.100314e-8,"domain_scores_codex":[0.9989747,0.0001665456,0.0003922388,0.0001213875,0.0002785291,0.00006663062],"domain_scores_gemma":[0.9986711,0.000248121,0.0005170628,0.0001594392,0.0003245823,0.00007975734],"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.00005366592,0.0001967117,0.00004496039,0.00001699587,0.0000591508,2.670693e-7,0.0002475921,0.1387184,0.00002645444,0.8584689,0.00005774872,0.002109071],"study_design_scores_gemma":[0.001423668,0.000297996,0.0004330155,0.00004997789,0.0001165361,0.00003973292,0.0002583646,0.8189958,0.0003972201,0.1775162,0.0003282215,0.0001432632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000318179,0.00000749225,0.99264,0.006039394,0.000008328829,0.0003368872,0.00001023597,0.00001733238,0.0006221581],"genre_scores_gemma":[0.2628423,0.0000159268,0.7355765,0.001451856,0.00002882861,0.00003454972,0.00001361955,0.000007385889,0.0000291052],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6809527,"threshold_uncertainty_score":0.2038516,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01314037019398161,"score_gpt":0.2549632184526553,"score_spread":0.2418228482586737,"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."}}