{"id":"W2768763745","doi":"10.1007/s10589-018-0016-0","title":"Mesh-based Nelder–Mead algorithm for inequality constrained optimization","year":2018,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":36,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Convergence (economics); Mathematical optimization; Simplex algorithm; Mathematics; Algorithm; Simplex; Rate of convergence; Point (geometry); Computer science; Linear programming; Key (lock)","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003960627,0.0002488856,0.0002748302,0.0002532103,0.0007006512,0.000138291,0.0001984945,0.000139108,0.0003513256],"category_scores_gemma":[0.0003248964,0.0002678097,0.00007663126,0.0007250243,0.0004326877,0.0002635425,0.0000558115,0.0001166734,0.00001152297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008321388,"about_ca_system_score_gemma":0.0002314712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001983115,"about_ca_topic_score_gemma":0.000001227076,"domain_scores_codex":[0.9980717,0.00009364635,0.0006056005,0.0005412747,0.0003842041,0.0003035858],"domain_scores_gemma":[0.996484,0.0009987592,0.0002888111,0.0002938934,0.001737407,0.000197065],"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.00001492902,0.00016957,0.00001265455,0.00003559889,0.00002582475,1.595479e-7,0.0000520856,0.9150054,0.000003410092,0.06068117,0.0004926465,0.02350657],"study_design_scores_gemma":[0.001480841,0.00009330099,0.00001066158,0.00001731965,0.00003254362,0.000005335553,0.00006089013,0.9602947,0.00006773262,0.0361138,0.001546868,0.0002760525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001400241,0.00002709878,0.9957167,0.0009825504,0.00005971393,0.00192753,0.0001955659,0.000292087,0.0007847454],"genre_scores_gemma":[0.00360456,0.00001857023,0.993031,0.0005526871,0.0002758463,0.0009951515,0.00121384,0.00005790512,0.0002504059],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04528928,"threshold_uncertainty_score":0.9999774,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0606054398186082,"score_gpt":0.3863672623675488,"score_spread":0.3257618225489406,"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."}}