{"id":"W4405848166","doi":"10.23952/jnva.9.2025.2.02","title":"Bregman ADMM: A new algorithm for nonconvex optimization with linear constraints","year":2024,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Division of Mathematical Sciences; Fundamental Research Funds of China West Normal University; China West Normal University; National Natural Science Foundation of China; Chongqing Normal University","keywords":"Mathematical optimization; Computer science; Algorithm; Linear programming; Optimization problem; Optimization algorithm; Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002414503,0.001338311,0.001515965,0.0008282311,0.0005088222,0.001207576,0.002227492,0.002541709,0.002244374],"category_scores_gemma":[0.004064623,0.0006758149,0.001041208,0.001375392,0.001404289,0.002335787,0.002102812,0.004471185,0.001011957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000730856,"about_ca_system_score_gemma":0.002239469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002195833,"about_ca_topic_score_gemma":0.002747088,"domain_scores_codex":[0.9988084,0.000399967,0.00007548594,0.0001889568,0.0004616743,0.00006558657],"domain_scores_gemma":[0.998822,0.0005245354,0.0001584563,0.0001437435,0.0002863809,0.00006481625],"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.0001074803,0.0001001879,0.0003622129,0.000410396,0.0001360488,0.0001803777,0.0001422574,0.6754125,0.007662306,0.09927057,0.01283211,0.2033836],"study_design_scores_gemma":[0.00002077356,0.00004536563,0.00004662597,0.00002271393,0.000008428444,0.00008192061,0.000006918537,0.9822884,0.001131335,0.01051561,0.005819011,0.00001292541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005459626,0.0002343563,0.9982949,0.0001323954,0.00004757379,0.00002013101,0.00002095905,0.0001008381,0.0006029037],"genre_scores_gemma":[0.03590068,0.0007952838,0.9585032,0.0002951119,0.0001300921,0.0001789907,0.0002481451,0.000115827,0.00383265],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002541709,"threshold_uncertainty_score":0.01276928,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01105046593844212,"score_gpt":0.2486510802936248,"score_spread":0.2376006143551827,"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."}}