{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004612488,0.0003830988,0.0005202997,0.0001031562,0.0002392339,0.0003062255,0.00019209,0.0001591525,0.00003514462],"category_scores_gemma":[0.0001674359,0.0003154413,0.0001277755,0.0003192088,0.0001443679,0.0002183034,0.0000345927,0.0002708929,0.00001247669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006532593,"about_ca_system_score_gemma":0.00001959199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002780578,"about_ca_topic_score_gemma":0.000005117892,"domain_scores_codex":[0.998141,0.00004426859,0.0005051628,0.0003724582,0.0002748154,0.000662311],"domain_scores_gemma":[0.998872,0.0002932214,0.00008260718,0.000401238,0.0001896676,0.0001611966],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001323243,0.0007299432,0.00005259525,0.0007333074,0.0002520813,0.00004839334,0.00204908,0.001170391,0.00397425,0.1100729,0.0009739037,0.8798108],"study_design_scores_gemma":[0.002186341,0.001923883,0.0002368814,0.001240928,0.0003608957,0.0003763246,0.0003477143,0.7199315,0.03769822,0.1351483,0.09839454,0.002154537],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007425161,0.0001368883,0.9869074,0.0004585004,0.0000637609,0.001534902,0.000002994484,0.002135189,0.001335209],"genre_scores_gemma":[0.2427927,0.000002104686,0.7567074,0.00007276021,0.00009070268,0.0002202182,0.00001955348,0.00005649612,0.00003813983],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8776563,"threshold_uncertainty_score":0.9999298,"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."}}