{"id":"W4311163083","doi":"10.23952/jnva.7.2023.1.07","title":"Optimization conditions and decomposable algorithms for convertible nonconvex optimization","year":2022,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Convertible; Mathematical optimization; Optimization algorithm; Algorithm; Computer science; Mathematics; Engineering; Structural engineering","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008311818,0.000117663,0.0003598457,0.0006512136,0.0005077065,0.00007094531,0.0001134526,0.0000448592,0.000933764],"category_scores_gemma":[0.000394161,0.0001141894,0.000153425,0.0008953671,0.00004566377,0.0003444096,0.0000771725,0.0001733703,2.765627e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009369436,"about_ca_system_score_gemma":0.0001438244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005538271,"about_ca_topic_score_gemma":0.000002096634,"domain_scores_codex":[0.998476,0.0001218759,0.0005946268,0.0001807104,0.0004764068,0.0001503754],"domain_scores_gemma":[0.9976866,0.0007383314,0.0005228205,0.00009902117,0.0008340622,0.0001192051],"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.00006640828,0.0001625395,0.0004840962,0.00001807755,0.0006779685,0.000002121343,0.000126078,0.9952316,0.0000150454,0.002797206,0.0002340068,0.000184908],"study_design_scores_gemma":[0.001253756,0.0001687983,0.000146562,0.000004198374,0.0007291917,0.00004719905,0.0002394939,0.9914587,0.00001724394,0.005335161,0.000480059,0.0001197031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001043451,0.0001073131,0.997278,0.0009824277,0.00007656589,0.000202853,0.0002427552,0.00001229984,0.00005428155],"genre_scores_gemma":[0.007919046,0.0001740297,0.9908488,0.0001281618,0.0001556979,0.00002958511,0.0003306679,0.00002104485,0.000392975],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006875596,"threshold_uncertainty_score":0.9999795,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04357959626343707,"score_gpt":0.3681774466172429,"score_spread":0.3245978503538058,"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."}}