{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002480439,0.0009639031,0.001723627,0.001084764,0.0009449057,0.001020973,0.002055034,0.001529069,0.004333407],"category_scores_gemma":[0.004232395,0.0007879519,0.001046291,0.001107191,0.001069304,0.001376266,0.002350452,0.002397385,0.0006129348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008141382,"about_ca_system_score_gemma":0.001474107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00242677,"about_ca_topic_score_gemma":0.002750604,"domain_scores_codex":[0.9993562,0.0002513325,0.00002890523,0.00007143396,0.000237524,0.00005449907],"domain_scores_gemma":[0.9983708,0.001008118,0.00007193641,0.0001305032,0.0003464678,0.00007223036],"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.000226169,0.0001682671,0.0007916095,0.0002390908,0.00007390566,0.0001297676,0.0002026997,0.7098281,0.006287965,0.0614358,0.003208946,0.2174077],"study_design_scores_gemma":[0.00001009185,0.00002110879,0.00004003967,0.000005739235,0.000003276411,0.00001256793,0.000006338993,0.9941818,0.0006456924,0.004574978,0.0004950579,0.000003432241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006175881,0.00006603342,0.9925517,0.00005788011,0.00003481931,0.00004024182,0.00001713882,0.0001318842,0.0009243858],"genre_scores_gemma":[0.1211413,0.0001088907,0.8753203,0.00009591569,0.00003358792,0.0004155029,0.0001330751,0.0002256127,0.002525817],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004333407,"threshold_uncertainty_score":0.01449668,"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."}}