{"id":"W4405558068","doi":"10.23952/jnva.9.2025.1.05","title":"Local optimality conditions and local saddle point theorems for nonconvex robust programming","year":2024,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Saddle point; Mathematical optimization; Mathematics; Saddle; Mathematical economics; Point (geometry); Computer science; Geometry","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004810908,0.001773208,0.001505947,0.0015146,0.0008132058,0.001699958,0.00139259,0.001289886,0.00546551],"category_scores_gemma":[0.008010849,0.0006755044,0.001444294,0.0009398118,0.003216122,0.003580001,0.002971791,0.003515086,0.001277996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001130554,"about_ca_system_score_gemma":0.001216521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007033162,"about_ca_topic_score_gemma":0.0007285779,"domain_scores_codex":[0.9985055,0.0006761333,0.00007310907,0.0003055009,0.0003417629,0.00009804819],"domain_scores_gemma":[0.9970071,0.001686427,0.0004083675,0.0001788332,0.0005604509,0.000158823],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003919087,0.00003526551,0.0003108962,0.0002193233,0.00005587868,0.0002998749,0.0001926496,0.1114701,0.005560319,0.867748,0.002959819,0.01110873],"study_design_scores_gemma":[0.00003612621,0.0001094944,0.0002936606,0.00006945364,0.00002059613,0.0001462851,0.0001038312,0.5188432,0.002428656,0.4745293,0.003383495,0.00003585219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008285751,0.0003708249,0.9826094,0.0006455337,0.00004534602,0.00005185211,0.0001198759,0.00007776319,0.007793759],"genre_scores_gemma":[0.6855547,0.002575331,0.2860203,0.0008255448,0.0004848057,0.001080684,0.0008254935,0.0006167879,0.02201633],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00546551,"threshold_uncertainty_score":0.02544284,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01655074785260677,"score_gpt":0.2791502745178224,"score_spread":0.2625995266652156,"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."}}