{"id":"W3015993571","doi":"10.1007/s10898-022-01127-1","title":"Numerical certification of Pareto optimality for biobjective nonlinear problems","year":2022,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Parameterized complexity; Set (abstract data type); Pareto principle; Mathematical optimization; Class (philosophy); Mathematics; Polygon (computer graphics); Regular polygon; Computer science; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.0005949839,0.0001430264,0.0003066239,0.0001152476,0.0002018869,0.00004712951,0.0006075345,0.00004814301,0.0000223905],"category_scores_gemma":[0.0003156515,0.0001422016,0.0001626193,0.001150156,0.00004507906,0.0007998661,0.0001335202,0.0001471963,5.898177e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006236515,"about_ca_system_score_gemma":0.0002846651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009268017,"about_ca_topic_score_gemma":5.760247e-7,"domain_scores_codex":[0.998044,0.0001739916,0.0007814679,0.0002659149,0.0005430991,0.0001914935],"domain_scores_gemma":[0.9967692,0.00009204579,0.001362816,0.0002597265,0.001422879,0.00009328268],"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.0001048311,0.0003039631,0.0003450431,0.00001304464,0.00003725907,0.000001718745,0.0002010132,0.994288,0.00006720517,0.001861708,0.0001311557,0.002645104],"study_design_scores_gemma":[0.0009888713,0.000627854,0.0005275108,0.00001176123,0.00002184308,0.00007878952,0.0001243224,0.9957482,0.0004420778,0.0008789719,0.0004093914,0.0001404156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003770662,0.0001160713,0.9976559,0.0006068814,0.0005097133,0.0004549958,0.000061788,0.00003390756,0.0001836937],"genre_scores_gemma":[0.1576094,0.0000207875,0.8421575,0.00007917713,0.00005918761,0.000031049,0.00001890901,0.00001098682,0.00001296784],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1572324,"threshold_uncertainty_score":0.5798814,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01927778303810996,"score_gpt":0.2869851079830246,"score_spread":0.2677073249449147,"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."}}