{"id":"W1964916956","doi":"10.1007/s10589-012-9480-0","title":"Strong duality and minimal representations for cone optimization","year":2012,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":65,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Second-order cone programming; Strong duality; Duality (order theory); Mathematics; Complementarity (molecular biology); Mathematical optimization; Conic optimization; Interior point method; Weak duality; Duality gap; Cone (formal languages); Linear programming; Linear complementarity problem; Preprocessor; Complementarity theory; Semidefinite programming; Wolfe duality; Optimization problem; Algorithm; Discrete mathematics; Convex optimization; Computer science; Convex analysis; Nonlinear system; Geometry","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":[],"consensus_categories":[],"category_scores_codex":[0.0003562793,0.0001765682,0.0002004598,0.0001655286,0.000542738,0.0001009419,0.00008910635,0.00008962782,0.0001157098],"category_scores_gemma":[0.0003304138,0.0001933436,0.00004044565,0.0003665897,0.0001790415,0.0005480417,0.00007766639,0.00009693805,0.000003284146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000498548,"about_ca_system_score_gemma":0.00005420281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001979896,"about_ca_topic_score_gemma":6.578516e-7,"domain_scores_codex":[0.9985927,0.00007403491,0.0004463624,0.0003427954,0.0002582129,0.0002858674],"domain_scores_gemma":[0.9978057,0.001039947,0.000206673,0.0001922238,0.0005200482,0.000235402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001164274,0.0001299965,0.0003655537,0.00005169181,0.00001880862,3.859481e-8,0.000152161,0.776034,0.000003791635,0.2216693,0.0003308926,0.001232116],"study_design_scores_gemma":[0.000910181,0.00002397487,0.0004033731,0.000009218244,0.00004544483,0.00001330899,0.0002990612,0.9798628,0.00001785408,0.01705299,0.001144048,0.0002177219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000228979,0.0001862237,0.9960946,0.0008065303,0.00003918543,0.001498668,0.0001508072,0.0001360933,0.0008588812],"genre_scores_gemma":[0.03397584,0.00009443433,0.9634091,0.0001356558,0.0001908967,0.0009706763,0.0007519138,0.00004213939,0.0004293688],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2046163,"threshold_uncertainty_score":0.7884323,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08166275618822488,"score_gpt":0.4123049513317906,"score_spread":0.3306421951435657,"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."}}