{"id":"W275043376","doi":"","title":"Smoothing SQP methods for solving nonsmooth and nonconvex constrained optimization problems","year":2014,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Sequential quadratic programming; Mathematics; Smoothing; Mathematical optimization; Sequence (biology); Penalty method; Convergence (economics); Limit point; Quadratic programming","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.001464733,0.001067593,0.001002269,0.000557862,0.0004231774,0.0006772914,0.0009622207,0.0009620397,0.001893247],"category_scores_gemma":[0.003123472,0.0005733715,0.0006270784,0.0008025041,0.001212477,0.0007245896,0.001025936,0.001399952,0.0003510771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006734581,"about_ca_system_score_gemma":0.001603285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004044002,"about_ca_topic_score_gemma":0.003761911,"domain_scores_codex":[0.9995479,0.0001685151,0.00002766862,0.0000695632,0.0001516409,0.00003471663],"domain_scores_gemma":[0.9987013,0.0008528429,0.0001212145,0.00007982845,0.0001927784,0.00005198139],"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.00002923012,0.00001723849,0.0002709829,0.0001043465,0.00002857068,0.0000470138,0.00004275874,0.9650271,0.001700491,0.01424494,0.00038721,0.01810021],"study_design_scores_gemma":[0.000003707668,0.000008571474,0.00001705091,0.000002599618,0.000001337976,0.000003135065,0.000002829255,0.9959006,0.0002268375,0.003583338,0.0002485688,0.000001489918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005023276,0.0001348212,0.9939043,0.00007383539,0.00001547196,0.00002291469,0.00001223101,0.0001011437,0.0007120801],"genre_scores_gemma":[0.4015324,0.0004885439,0.5938287,0.000135974,0.00006380981,0.0003388698,0.000173105,0.000230381,0.003208279],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004044002,"threshold_uncertainty_score":0.008040905,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04641661131137968,"score_gpt":0.2148970412890664,"score_spread":0.1684804299776868,"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."}}