{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001608806,0.001171629,0.0007217358,0.0006333258,0.0004088951,0.0008186451,0.001013005,0.0008935439,0.004036724],"category_scores_gemma":[0.002888369,0.0004414753,0.0008893136,0.0006912954,0.001243887,0.001434235,0.001514856,0.002156451,0.000657611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006469477,"about_ca_system_score_gemma":0.001144272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008782303,"about_ca_topic_score_gemma":0.001174653,"domain_scores_codex":[0.9992266,0.0002774332,0.0000317451,0.0001521079,0.000269537,0.00004256223],"domain_scores_gemma":[0.9989569,0.0006319634,0.000115383,0.00008479782,0.0001606712,0.00005025101],"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.00006444288,0.00008642478,0.0004536201,0.0004475139,0.00007546858,0.0001291807,0.0001475878,0.4751223,0.006355798,0.4460666,0.002971755,0.06807934],"study_design_scores_gemma":[0.00001161805,0.00005643611,0.0000712449,0.00002132298,0.00000692376,0.00004175677,0.00001556035,0.9001316,0.0008456718,0.094731,0.004059745,0.000007162303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002152139,0.0002367222,0.9951767,0.0001138314,0.00002983119,0.00003059867,0.00002132939,0.00002389984,0.002214945],"genre_scores_gemma":[0.2052521,0.00201942,0.7754691,0.0002583738,0.0004006407,0.0006368996,0.0003192098,0.0001941243,0.01545002],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004036724,"threshold_uncertainty_score":0.01350421,"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."}}