{"id":"W7123353663","doi":"10.1109/cdc57313.2025.11312395","title":"A fully distributed algorithm for the nonconvex constrained optimization problem","year":2025,"lang":"","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Lipschitz continuity; Bounded function; Constrained optimization; Robustness (evolution); Convergence (economics); Optimization problem; Convex function; Convex optimization; Lyapunov function","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","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001640225,0.0006945895,0.0007917609,0.000215708,0.001079265,0.001907196,0.002763451,0.0003807402,0.0001740203],"category_scores_gemma":[0.0003344236,0.0005244508,0.0005065718,0.002113231,0.0004045948,0.0007127078,0.0005525835,0.0003492993,0.00005418319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003728881,"about_ca_system_score_gemma":0.001442556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001644621,"about_ca_topic_score_gemma":0.00002616179,"domain_scores_codex":[0.994873,0.0003227459,0.001594459,0.001359245,0.0006273074,0.001223166],"domain_scores_gemma":[0.9945433,0.001535615,0.0006110869,0.001632252,0.001434248,0.0002434641],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008177245,0.0005345204,0.00005848004,0.0002503841,0.00131402,0.00001432338,0.0003300268,0.1484139,0.0000926279,0.1148768,0.02786369,0.7061695],"study_design_scores_gemma":[0.005206169,0.0001833093,0.00006497108,0.000217025,0.0002978369,0.00001496069,0.0003330596,0.9625804,0.0001883707,0.0006204603,0.02977292,0.0005205365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000002235998,0.0008972105,0.9660414,0.01737904,0.00332402,0.006742584,0.001437987,0.0004118635,0.003763628],"genre_scores_gemma":[0.2082548,0.0001757018,0.7640482,0.003237639,0.0007632285,0.00349578,0.001047915,0.00008884069,0.01888789],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8141665,"threshold_uncertainty_score":0.9997207,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01187654189952846,"score_gpt":0.2509533961613619,"score_spread":0.2390768542618334,"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."}}