{"id":"W4412767593","doi":"10.23952/jano.7.2025.2.02","title":"Solving an uncertain quadratic multiobjective optimization problem using Newton’s descent method via a robust optimization approach","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Descent (aeronautics); Mathematical optimization; Multi-objective optimization; Robust optimization; Quadratic equation; Descent direction; Optimization problem; Newton's method; Quadratic programming; Computer science; Mathematics; Newton's method in optimization; Gradient descent; Iterative method; Engineering; Nonlinear system; Artificial intelligence; Local convergence; Artificial neural network","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00394134,0.0003823982,0.0008808278,0.001178705,0.0005110556,0.0009105831,0.0005605181,0.0002635323,0.0001363673],"category_scores_gemma":[0.001117371,0.0003037757,0.0001650382,0.002102674,0.00009233149,0.001383947,0.0001805267,0.0004023393,0.000001075138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003496994,"about_ca_system_score_gemma":0.0002757738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002672092,"about_ca_topic_score_gemma":7.226334e-7,"domain_scores_codex":[0.9946579,0.0006674319,0.002136343,0.0007662599,0.001386902,0.0003851885],"domain_scores_gemma":[0.9951859,0.0009049462,0.001776727,0.0004141957,0.001443635,0.0002746202],"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.0004633366,0.0002954259,0.00008349037,0.00002082885,0.00005057526,0.000003596839,0.0009021316,0.9734428,0.0006482954,0.0004249028,0.00005432434,0.0236103],"study_design_scores_gemma":[0.001500428,0.0001213966,0.0000641659,0.00008731792,0.0001256294,0.00005434199,0.001342441,0.9947599,0.0001653593,0.00145133,0.00003065143,0.0002970554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006827357,0.00009720433,0.9971427,0.0002096207,0.0002974672,0.0006740446,0.000003276603,0.00004162421,0.0008513283],"genre_scores_gemma":[0.06946047,0.00003781767,0.9300037,0.0002586542,0.0001304327,0.00001438539,0.00001635595,0.00003788414,0.00004030687],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06877773,"threshold_uncertainty_score":0.9999414,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09640393866883326,"score_gpt":0.395242406603361,"score_spread":0.2988384679345277,"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."}}