{"id":"W2131919032","doi":"10.1016/j.mcm.2004.10.014","title":"Set contraction algorithm for computingpareto set in nonconvex nonsmooth multiobjective optimization","year":2004,"lang":"en","type":"article","venue":"Mathematical and Computer Modelling","topic":"Advanced Control Systems Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Monotonic function; Mathematics; Pareto principle; Solution set; Ideal point; Set (abstract data type); Contraction (grammar); Mathematical optimization; Point (geometry); Pareto optimal; Algorithm; Set function; Multi-objective optimization; Applied mathematics; Discrete mathematics; Combinatorics; Computer science; Mathematical analysis; Geometry","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":[],"consensus_categories":[],"category_scores_codex":[0.0001403209,0.0001721315,0.0002866035,0.00008723653,0.00006370553,0.00005672951,0.00005568384,0.00009522789,0.00000194021],"category_scores_gemma":[0.000005275819,0.0001725124,0.00004022017,0.0001010609,0.00001837837,0.0002120044,0.0000166787,0.0001120269,0.000003225509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001085606,"about_ca_system_score_gemma":0.000008820431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000831026,"about_ca_topic_score_gemma":0.000001799616,"domain_scores_codex":[0.9990885,0.00001551727,0.0003550836,0.0002190846,0.00009738286,0.0002243932],"domain_scores_gemma":[0.9995954,0.000134261,0.00005090926,0.00009679431,0.00006374691,0.00005890401],"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.000005841842,0.00001953966,0.000002201677,0.00008549333,0.00001653941,0.000001491313,0.0009266546,0.9901148,0.000008088513,0.001929337,0.00000183453,0.006888158],"study_design_scores_gemma":[0.001474452,0.00003760718,0.000002312535,0.0001575394,0.00001255757,0.00001274035,0.00007018269,0.9882526,0.00006188318,0.009716362,0.00001124194,0.0001904561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004487331,0.00006031675,0.9944081,0.00002155356,0.000136113,0.0006155348,0.00001124553,0.0001974788,0.00006234145],"genre_scores_gemma":[0.3553737,0.00001147439,0.6443704,0.00002224841,0.0001098808,0.00005749914,0.00002261302,0.00002791675,0.000004234421],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3508864,"threshold_uncertainty_score":0.7034853,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01550639848801347,"score_gpt":0.2273310297279956,"score_spread":0.2118246312399822,"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."}}