{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002456891,0.001190793,0.001335972,0.001547013,0.001109262,0.003592515,0.001737743,0.001217165,0.005703254],"category_scores_gemma":[0.007820705,0.0006900596,0.001269191,0.001480911,0.003056513,0.006311529,0.003552136,0.006461962,0.0006460915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001215699,"about_ca_system_score_gemma":0.00106614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007668458,"about_ca_topic_score_gemma":0.0009341261,"domain_scores_codex":[0.9988548,0.0005467509,0.0000533341,0.0001600173,0.0002893384,0.00009583253],"domain_scores_gemma":[0.9978523,0.001144154,0.0001775523,0.0002867265,0.0003065144,0.0002326463],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000102601,0.00001209574,0.00003999197,0.00002031738,0.00000417194,0.000006586155,0.00003396804,0.001742113,0.000127635,0.9930503,0.0008342387,0.004118279],"study_design_scores_gemma":[0.00000354794,0.000006592025,0.00002253878,0.000007700269,0.000002625825,0.000009262132,0.00001201622,0.01363351,0.00006408509,0.9852324,0.001003021,0.000002869009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02612765,0.001128122,0.9391246,0.001900766,0.0001990879,0.00003509894,0.0002096554,0.0001511947,0.03112392],"genre_scores_gemma":[0.6925024,0.00223075,0.2724729,0.001028348,0.0009171379,0.0003296139,0.0008094119,0.0004729459,0.02923649],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005703254,"threshold_uncertainty_score":0.01907927,"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."}}