{"id":"W3158960540","doi":"10.1007/s10107-022-01839-y","title":"An optimal gradient method for smooth strongly convex minimization","year":2022,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"ca_institutions":"Google (Canada)","funders":"H2020 European Research Council; Agence Nationale de la Recherche","keywords":"Mathematics; Constructive; Oracle; Mathematical optimization; Class (philosophy); Minification; Regular polygon; Point (geometry); Convex optimization; Upper and lower bounds; Proximal Gradient Methods; Sequence (biology); Computer science; Mathematical analysis","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.001302424,0.001208205,0.001163694,0.0009110204,0.0004340037,0.0009192331,0.001250795,0.001546674,0.004219265],"category_scores_gemma":[0.004476146,0.0007771942,0.0009295112,0.000846225,0.001415614,0.001496005,0.002003311,0.002805858,0.001433639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006238499,"about_ca_system_score_gemma":0.001627482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001822866,"about_ca_topic_score_gemma":0.002393708,"domain_scores_codex":[0.9994125,0.0002633694,0.00002182966,0.00007253447,0.0001974751,0.00003221765],"domain_scores_gemma":[0.9991546,0.0005141713,0.00003869369,0.00005523425,0.0001839206,0.00005341054],"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.0001332442,0.0001474206,0.0002381767,0.0004697648,0.00008537146,0.000140425,0.0001411113,0.3315929,0.009477506,0.4758441,0.0165074,0.1652226],"study_design_scores_gemma":[0.0000155613,0.00003496869,0.00004595557,0.00002131496,0.000009687921,0.00004108429,0.000008949478,0.9466053,0.0006844667,0.04783397,0.004686657,0.0000121199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006040489,0.0001138737,0.9976923,0.0001349774,0.00005751309,0.00001703965,0.000017862,0.00006075862,0.001301662],"genre_scores_gemma":[0.04222247,0.0004712879,0.948484,0.000250568,0.000189516,0.0002402766,0.0001150543,0.000355858,0.007670884],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004219265,"threshold_uncertainty_score":0.01411486,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0240464595519915,"score_gpt":0.2911768973617581,"score_spread":0.2671304378097666,"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."}}