{"id":"W2575486826","doi":"10.1007/s10107-017-1112-0","title":"Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs","year":2017,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Lipschitz continuity; Mathematics; Karush–Kuhn–Tucker conditions; Function (biology); Separable space; Constraint (computer-aided design); Normality; Applied mathematics; Term (time); Mathematical optimization; Continuous function (set theory); Nonlinear system; Mathematical analysis; Statistics","routes":{"ca_aff":true,"ca_fund":true,"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":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004601732,0.0001307989,0.0002077485,0.00005702565,0.0008432907,0.001243769,0.0004766615,0.00006362491,0.00002594557],"category_scores_gemma":[0.0003368583,0.0001120312,0.00009288675,0.0001139566,0.0001043891,0.0007429668,0.0001902885,0.00006830731,0.00001613145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001538628,"about_ca_system_score_gemma":0.00003271774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009014977,"about_ca_topic_score_gemma":0.000003748868,"domain_scores_codex":[0.9989108,0.00002512145,0.0002926131,0.0003268174,0.000217435,0.0002272074],"domain_scores_gemma":[0.9988748,0.0001185576,0.0002164217,0.0004880989,0.0001750223,0.0001271253],"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.00001205134,0.0008643256,0.002673487,0.0004346509,0.0001496039,0.000004986505,0.0006387201,0.0003373358,0.00005204718,0.8078552,0.0001452573,0.1868323],"study_design_scores_gemma":[0.0004102519,0.00006435812,0.001696297,0.00004899376,0.0000453951,0.00000779467,0.00003151821,0.9653103,0.00004377681,0.03096782,0.001195866,0.000177637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002735477,0.000007887846,0.9932369,0.002067383,0.0000457452,0.0005638533,0.000004489526,0.0001144878,0.001223778],"genre_scores_gemma":[0.3233178,0.000002773653,0.6761175,0.00007609103,0.00006096287,0.0001503495,0.00005228874,0.0000098018,0.0002123286],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.964973,"threshold_uncertainty_score":0.9997931,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03706456655714727,"score_gpt":0.3220293890959318,"score_spread":0.2849648225387845,"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."}}