{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003097426,0.001327065,0.001987512,0.001963325,0.0008170712,0.002479067,0.001552987,0.002241735,0.005440994],"category_scores_gemma":[0.01548315,0.001109695,0.001249292,0.001431048,0.00269751,0.002607554,0.002365083,0.002607138,0.0004803158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001846776,"about_ca_system_score_gemma":0.002331986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004464445,"about_ca_topic_score_gemma":0.003405104,"domain_scores_codex":[0.9992447,0.0004191854,0.00002642739,0.0001010766,0.0001305857,0.0000780792],"domain_scores_gemma":[0.9939521,0.004735695,0.000400859,0.0001580766,0.0005614849,0.000191768],"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.0000989393,0.0001103607,0.0005216349,0.0001895903,0.00006877229,0.0001047692,0.0001756767,0.5849396,0.000952406,0.3994792,0.002070871,0.01128815],"study_design_scores_gemma":[0.00000723524,0.00002311925,0.00005911483,0.00002258634,0.000005760026,0.00001112701,0.00002699004,0.9296479,0.0001527415,0.06970225,0.0003350844,0.000006083254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06472614,0.000590597,0.9188471,0.001149866,0.00009213107,0.0001139251,0.0001539328,0.0001089411,0.01421745],"genre_scores_gemma":[0.7338862,0.001420462,0.2435177,0.0004279507,0.0001967215,0.0005620799,0.0007032033,0.00044138,0.01884422],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005440994,"threshold_uncertainty_score":0.01820189,"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."}}