{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007296003,0.0006322321,0.0009594566,0.0007852385,0.000518603,0.0007557037,0.001581784,0.001647793,0.006006191],"category_scores_gemma":[0.00295641,0.0003761504,0.0007287762,0.00106507,0.0004713532,0.0008741436,0.001108892,0.001410301,0.001540304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005631265,"about_ca_system_score_gemma":0.001114553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005634148,"about_ca_topic_score_gemma":0.005432593,"domain_scores_codex":[0.9995725,0.0001421139,0.00002413633,0.00004205842,0.0001948832,0.00002437105],"domain_scores_gemma":[0.9993005,0.0003706073,0.00003219804,0.00007224565,0.0002016956,0.00002285292],"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.0001395852,0.00008333337,0.0004232526,0.0002916004,0.00008837091,0.00008166265,0.00009391034,0.7106813,0.007052522,0.04453481,0.007645044,0.2288846],"study_design_scores_gemma":[0.000006455401,0.000007739098,0.00004134186,0.000008076836,0.00000375874,0.000009312815,0.000003779693,0.9927449,0.0005636194,0.004373206,0.002233764,0.000004113615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001520977,0.0001680225,0.9954258,0.00005772614,0.00004346992,0.00002199445,0.000038039,0.0001478904,0.002576153],"genre_scores_gemma":[0.07949173,0.0003091709,0.9144936,0.0000967965,0.00004995408,0.0002622694,0.0002433264,0.0002230426,0.004830071],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006006191,"threshold_uncertainty_score":0.02009267,"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."}}