{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005794931,0.0001114268,0.0001534364,0.0001682374,0.000256342,0.0001272878,0.0002940594,0.00006405291,0.00002693221],"category_scores_gemma":[0.0001351796,0.0001197459,0.00006730209,0.0005222068,0.00005182148,0.0006173557,0.0001080334,0.0000598753,0.000003239252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003426257,"about_ca_system_score_gemma":0.00004478974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001975844,"about_ca_topic_score_gemma":0.000005591012,"domain_scores_codex":[0.999129,0.0001027854,0.0001399533,0.0004203019,0.00003935509,0.000168593],"domain_scores_gemma":[0.9990192,0.0003501086,0.0001299155,0.0002273123,0.0001768412,0.00009661352],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002821089,0.00001388344,0.0002901021,0.000009778227,0.00002101373,3.878249e-7,0.0001024509,0.6128297,0.0000587101,0.3847807,0.00001196559,0.001878488],"study_design_scores_gemma":[0.00055115,0.00003587057,0.00008294101,0.0000103389,0.00003622251,0.00000158415,0.00002694492,0.9859271,0.0000629159,0.01257139,0.0005411339,0.0001523708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004665509,0.000008509761,0.9975241,0.0003694817,0.00007926892,0.000152319,0.000001423775,0.0001075532,0.001290745],"genre_scores_gemma":[0.5090113,0.00001470118,0.4903373,0.0002065237,0.000020508,8.76823e-7,0.000005289284,0.000005871133,0.0003976633],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5085447,"threshold_uncertainty_score":0.4883098,"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."}}