{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006532099,0.0001428808,0.0003422131,0.000526974,0.001177401,0.0001151575,0.0003897825,0.0000504471,0.0004309686],"category_scores_gemma":[0.004583223,0.0001378996,0.00007701387,0.0009058989,0.0003607791,0.0001489162,0.0003718058,0.0004328163,0.000002347155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001253149,"about_ca_system_score_gemma":0.0002441302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001521854,"about_ca_topic_score_gemma":0.00001800387,"domain_scores_codex":[0.997182,0.0006033624,0.0005965765,0.0003124673,0.0008275356,0.0004780832],"domain_scores_gemma":[0.9954126,0.002870178,0.00006988437,0.0004599179,0.001052701,0.0001347173],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009183672,0.002282301,0.00001802588,0.001911221,0.0002781403,0.000006780515,0.01176582,0.009609821,0.02828865,0.8809033,0.001775214,0.06306888],"study_design_scores_gemma":[0.001857268,0.0007834277,0.00000306754,0.00006275171,0.00003889155,0.00005454551,0.01627968,0.8546277,0.01083393,0.1088198,0.006330489,0.000308371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008896418,0.0001612599,0.9844409,0.001014822,0.00004203195,0.003641719,0.0001224089,0.00007668068,0.001603757],"genre_scores_gemma":[0.01658659,0.00002044876,0.9783471,0.00001009674,0.00002204473,0.001728025,0.00004471822,0.00005201775,0.003188911],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8450179,"threshold_uncertainty_score":0.9055737,"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."}}