{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003203289,0.0003261811,0.0004380553,0.000237201,0.0001314321,0.0000788485,0.0001433982,0.0001399484,0.0002816587],"category_scores_gemma":[0.00002342123,0.0002969162,0.0001837694,0.0002554183,0.00003334675,0.00006651341,6.113813e-7,0.0001970581,0.00001281047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001358191,"about_ca_system_score_gemma":0.00007079542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002034693,"about_ca_topic_score_gemma":0.00002754442,"domain_scores_codex":[0.9985309,0.00004363987,0.000536216,0.0002711462,0.0002044561,0.0004136587],"domain_scores_gemma":[0.9992055,0.0002290278,0.00004131445,0.0003151917,0.0001099381,0.00009903485],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004331504,0.0001218425,0.000001709898,0.0007908093,0.0007231863,0.000001996966,0.0002152955,0.8234119,0.1211752,0.0001749521,0.000249979,0.05308981],"study_design_scores_gemma":[0.003503388,0.00008843036,0.0002427543,0.0001607783,0.0002296441,0.000007326469,0.00003957451,0.9724232,0.02178205,0.0002001059,0.001038714,0.0002840502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007262604,0.00006169923,0.9882531,0.0003157541,0.001020708,0.001568758,0.0001258656,0.001014142,0.0003773367],"genre_scores_gemma":[0.9572527,0.000006643579,0.04179482,0.000160364,0.00001934505,0.0004948167,0.000007172112,0.00004608985,0.0002179841],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9499902,"threshold_uncertainty_score":0.9999483,"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."}}