{"id":"W3213237799","doi":"10.1287/moor.2021.1207","title":"Penalty and Augmented Lagrangian Methods for Constrained DC Programming","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Mathematics; Augmented Lagrangian method; Penalty method; Sequence (biology); Stationary point; Mathematical optimization; Infimum and supremum; Pointwise; Regular polygon; Function (biology); Convergence (economics); Constraint (computer-aided design); Limit point; Point (geometry); Applied mathematics; Combinatorics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001142976,0.001361886,0.0009101198,0.0008417777,0.0004166069,0.001136879,0.00107144,0.001219091,0.003839639],"category_scores_gemma":[0.002756099,0.0004633008,0.0009028207,0.0007799467,0.001024645,0.001291684,0.001602936,0.002231324,0.0005952632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000779323,"about_ca_system_score_gemma":0.001186764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002904794,"about_ca_topic_score_gemma":0.002593172,"domain_scores_codex":[0.9994577,0.0002160329,0.00002498417,0.00008407467,0.0001656986,0.00005153276],"domain_scores_gemma":[0.9989811,0.0005683681,0.0001084978,0.00006787943,0.0001996268,0.00007453718],"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.00005841135,0.00005800767,0.0004197474,0.0002461023,0.00004294163,0.0001033117,0.0000638424,0.8421109,0.00173876,0.1194369,0.001924953,0.03379611],"study_design_scores_gemma":[0.000004291104,0.00001494809,0.00002338162,0.00001035908,0.000002384952,0.000008903815,0.000005110525,0.9896414,0.0001943297,0.008864093,0.001226968,0.000003782548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004093345,0.000434883,0.9915665,0.0002058036,0.00007133857,0.0000343712,0.00004749717,0.00006072918,0.003485505],"genre_scores_gemma":[0.391118,0.001747729,0.586193,0.0004459061,0.0003058536,0.0005024384,0.000571684,0.0003670426,0.01874848],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003839639,"threshold_uncertainty_score":0.01284486,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2225674321148509,"score_gpt":0.5456395272196878,"score_spread":0.3230720951048369,"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."}}