{"id":"W2539372614","doi":"10.1137/15m1048896","title":"On Convergence Rate of Distributed Stochastic Gradient Algorithm for Convex Optimization with Inequality Constraints","year":2016,"lang":"en","type":"article","venue":"SIAM Journal on Control and Optimization","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; City University of Hong Kong","keywords":"Mathematics; Rate of convergence; Convex function; Convergence (economics); Bounded function; Convex optimization; Mathematical optimization; Computation; Regular polygon; Constraint (computer-aided design); Optimization problem; Algorithm; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008680612,0.0002615092,0.0004589467,0.0001601036,0.0002018633,0.0001412223,0.0002954906,0.00009553663,0.00002309176],"category_scores_gemma":[0.0003807027,0.0001660583,0.0000889172,0.000236007,0.0001533272,0.0004732745,0.00002191033,0.0001147337,0.000002430143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001101548,"about_ca_system_score_gemma":0.0001280951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002576404,"about_ca_topic_score_gemma":7.66422e-7,"domain_scores_codex":[0.9979875,0.0002815866,0.0006539923,0.000399819,0.0003339343,0.0003431441],"domain_scores_gemma":[0.9972324,0.0007313162,0.000787021,0.0002525895,0.0007677933,0.0002288807],"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.000434923,0.0001837561,0.00006392328,0.00001473214,0.0001211757,0.000007629246,0.00004021927,0.9746692,0.0001299659,0.008212685,0.00006195052,0.0160599],"study_design_scores_gemma":[0.01001689,0.0014427,0.0002194622,0.000252392,0.00004800955,0.00003871071,0.00001770118,0.9872195,0.0001216461,0.000377026,0.00001841035,0.0002276047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007949363,0.00004625329,0.996369,0.001145406,0.0004667992,0.0007792132,0.0003325272,0.00005209821,0.0000137453],"genre_scores_gemma":[0.9621566,0.00003621636,0.03736594,0.0002407034,0.00007592841,0.00004992318,0.00003943003,0.00001659568,0.00001865709],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9613616,"threshold_uncertainty_score":0.6771661,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0106527033334437,"score_gpt":0.2261616350650727,"score_spread":0.215508931731629,"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."}}