{"id":"W7081958452","doi":"10.1109/tac.2025.3609398","title":"Primal-Dual Accelerated Mirror-Descent Method for Constrained Bilinear Saddle-Point Problems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Geodetic Measurements and Engineering Structures","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Bilinear interpolation; Acceleration; Convex optimization; Constrained optimization; Set (abstract data type); Class (philosophy); Scheme (mathematics); Regular polygon","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.001239582,0.00109876,0.001108308,0.00041992,0.0004256571,0.0008033224,0.001347567,0.001079898,0.00528902],"category_scores_gemma":[0.002469837,0.0005506609,0.0006896777,0.000385346,0.0007637311,0.0009038808,0.00164424,0.001615784,0.001053134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006446698,"about_ca_system_score_gemma":0.001780839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002442327,"about_ca_topic_score_gemma":0.002274566,"domain_scores_codex":[0.9996675,0.0001247674,0.00001263206,0.00004280181,0.0001130666,0.00003924502],"domain_scores_gemma":[0.9993506,0.0002969045,0.00005794264,0.00006570835,0.000164441,0.00006442195],"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.00009055873,0.00006026813,0.0003210542,0.0001292335,0.00003491613,0.00009714709,0.0000807448,0.8820849,0.002669825,0.0740665,0.002456867,0.03790798],"study_design_scores_gemma":[0.000008526771,0.00001330286,0.00001454501,0.000003152788,0.000001477775,0.000008861595,0.000003127668,0.9938427,0.0002005908,0.005207062,0.0006941008,0.000002548576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002901712,0.00005762557,0.9951443,0.0001006746,0.00003247695,0.00003083565,0.00002054803,0.00008110364,0.00163074],"genre_scores_gemma":[0.3069203,0.0002980675,0.6798312,0.0002183649,0.0001102612,0.0005286853,0.0001877224,0.0002484839,0.01165692],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00528902,"threshold_uncertainty_score":0.01769352,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02009213545171109,"score_gpt":0.2588356135545464,"score_spread":0.2387434781028353,"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."}}