{"id":"W2159874655","doi":"10.1007/s10107-013-0735-z","title":"First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Complementarity (molecular biology); Cone (formal languages); Second-order cone programming; Stationary point; Complementarity theory; Positive-definite matrix; Limiting; Mathematical optimization; Applied mathematics; Semidefinite programming; Mathematical analysis; Algorithm; Regular polygon; Convex optimization; Geometry; Nonlinear system","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004023571,0.0002454861,0.0004035879,0.00008417424,0.0004147176,0.0006979351,0.0004575868,0.00007653503,0.001442813],"category_scores_gemma":[0.0002214694,0.0001861175,0.0001313371,0.0005658781,0.0003279886,0.000516528,0.0001442342,0.0001359776,0.0002964019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005253444,"about_ca_system_score_gemma":0.00006512881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001875188,"about_ca_topic_score_gemma":0.00001297201,"domain_scores_codex":[0.9979646,0.00005143898,0.0005969612,0.0004500051,0.0004412458,0.0004957818],"domain_scores_gemma":[0.998005,0.0005742438,0.0001888633,0.0004391156,0.0005485935,0.0002442092],"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.000004229765,0.0008972181,0.0003201882,0.0002625781,0.0001628458,0.000002232543,0.0004194857,0.0002507406,0.00001038311,0.9899462,0.0002275102,0.00749632],"study_design_scores_gemma":[0.001042059,0.0002087677,0.0002637989,0.0001263359,0.0001004419,0.00004298867,0.0002684866,0.7677755,0.00002238162,0.228337,0.001408778,0.0004034571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001050038,0.000004421602,0.9908273,0.003892777,0.00002107996,0.001739783,0.00001373743,0.0003006358,0.002150262],"genre_scores_gemma":[0.2175397,4.969851e-7,0.7808929,0.0002581243,0.00002210551,0.001034649,0.0000959617,0.00001572165,0.0001403155],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7675248,"threshold_uncertainty_score":0.99947,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0369526614574933,"score_gpt":0.2794488674892481,"score_spread":0.2424962060317548,"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."}}