{"id":"W4414845944","doi":"10.1080/10556788.2025.2545846","title":"Near-optimal algorithm with complexity separation for strongly convex-strongly concave composite saddle point problems","year":2025,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Optech (Canada)","funders":"Ministry of Science and Higher Education of the Russian Federation","keywords":"Saddle point; Separation (statistics); Point (geometry); Composite number; Computational complexity theory; Separation method","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.001935616,0.001676726,0.001959647,0.0008452028,0.0007400055,0.001632067,0.002143725,0.002070666,0.005897017],"category_scores_gemma":[0.006905578,0.0008927669,0.001204327,0.0007118661,0.001123773,0.002345348,0.002988028,0.003298382,0.002266611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009175281,"about_ca_system_score_gemma":0.002658747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00232248,"about_ca_topic_score_gemma":0.003015501,"domain_scores_codex":[0.99882,0.0003416545,0.00009199436,0.000237151,0.0003516714,0.0001574185],"domain_scores_gemma":[0.9972482,0.001724923,0.0001734256,0.0003430551,0.0003569907,0.000153296],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006290072,0.0002727844,0.001419681,0.0003824104,0.0001177352,0.0002421609,0.0002233484,0.7386155,0.005490141,0.05988596,0.009193918,0.1835273],"study_design_scores_gemma":[0.00004990726,0.00003729805,0.00004507141,0.00001000805,0.000006034452,0.00002485353,0.00001265933,0.9864785,0.0005234035,0.01197106,0.0008346057,0.000006566936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005314281,0.0001968511,0.9919049,0.0002194356,0.00005372646,0.00006333622,0.00002707571,0.0006853698,0.001535144],"genre_scores_gemma":[0.1420737,0.0001952666,0.8533456,0.0003087541,0.0001267561,0.000340499,0.0002815193,0.0004557376,0.002872257],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005897017,"threshold_uncertainty_score":0.01972747,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02667676483093195,"score_gpt":0.3373874385405367,"score_spread":0.3107106737096047,"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."}}