{"id":"W2153413094","doi":"10.48550/arxiv.1210.3039","title":"Sequential Convex Programming Methods for A Class of Structured Nonlinear Programming","year":2012,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Lipschitz continuity; Nonlinear programming; Mathematical optimization; Convex optimization; Class (philosophy); Sequence (biology); Convergence (economics); Mathematics; Regular polygon; Scheme (mathematics); Computer science; Nonlinear system; Artificial intelligence","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001643117,0.000535475,0.001067809,0.0002700516,0.0001525579,0.00007875223,0.0007222534,0.0006930029,0.0001191741],"category_scores_gemma":[0.002594319,0.0005158784,0.0004383128,0.0003412724,0.0002890252,0.0001733584,0.001022376,0.001083057,0.000007167157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002059488,"about_ca_system_score_gemma":0.0003700838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001825098,"about_ca_topic_score_gemma":0.00001010421,"domain_scores_codex":[0.9963362,0.0003752443,0.001098908,0.0007532931,0.0005137335,0.0009226191],"domain_scores_gemma":[0.9957538,0.0008922042,0.0009986178,0.001057487,0.001040663,0.0002572302],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005205045,0.001486694,0.01227471,0.01470323,0.002240835,0.00001959689,0.005674303,0.002868065,0.008608022,0.006911079,0.000234077,0.9444589],"study_design_scores_gemma":[0.01291411,0.001171863,0.00155396,0.002860439,0.003325731,0.000111985,0.004010225,0.3835431,0.2481203,0.09513751,0.2401133,0.007137539],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02997933,0.0003990044,0.963877,0.0001236537,0.000836697,0.004325445,0.00009801564,0.000282796,0.00007809859],"genre_scores_gemma":[0.01563185,0.00003281563,0.9817697,0.00002033188,0.0006463157,0.0009247013,0.0002784517,0.0002047842,0.0004910589],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9373214,"threshold_uncertainty_score":0.9997293,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1819429652009932,"score_gpt":0.47746450849377,"score_spread":0.2955215432927768,"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."}}