{"id":"W2042860556","doi":"10.1007/s10107-008-0261-6","title":"Primal-dual first-order methods with $${\\mathcal {O}(1/\\epsilon)}$$ iteration-complexity for cone programming","year":2009,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":154,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Semidefinite programming; Second-order cone programming; Linear programming; Cone (formal languages); Convex optimization; Rank (graph theory); Regular polygon; Combinatorics; Mathematical optimization; Discrete mathematics; Algorithm","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.004369251,0.002529753,0.00171495,0.001080839,0.001013545,0.002637667,0.002736154,0.002194354,0.01298257],"category_scores_gemma":[0.01636166,0.000917559,0.001214336,0.001334474,0.002562608,0.003425905,0.003283538,0.008854479,0.002809998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002281171,"about_ca_system_score_gemma":0.003585122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004430411,"about_ca_topic_score_gemma":0.008190772,"domain_scores_codex":[0.9983374,0.0007364145,0.00006498906,0.000138021,0.0005909075,0.0001323313],"domain_scores_gemma":[0.9920667,0.006144964,0.0002697514,0.0005811114,0.0006896323,0.0002477726],"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.00033493,0.0004157904,0.000424219,0.0004741124,0.00006514291,0.0001132164,0.0001697067,0.2961376,0.001548022,0.5682063,0.01720364,0.1149075],"study_design_scores_gemma":[0.00003833136,0.00003029078,0.00005130546,0.00003229047,0.000008100727,0.00002591669,0.00001789438,0.8937531,0.0004963892,0.1030397,0.002494893,0.00001188986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002039945,0.0003683254,0.9907013,0.0006580886,0.0001494447,0.00007256313,0.00008957838,0.0002370918,0.005683643],"genre_scores_gemma":[0.08920204,0.0006511151,0.8926027,0.0004495247,0.0002763906,0.000837933,0.0002867866,0.0008298001,0.01486371],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01298257,"threshold_uncertainty_score":0.04343104,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04902607468451811,"score_gpt":0.3262534941219266,"score_spread":0.2772274194374085,"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."}}