{"id":"W2896436568","doi":"","title":"Mesh-based Nelder-Mead algorithm for inequality constrained optimization","year":2017,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Convergence (economics); Mathematical optimization; Algorithm; Simplex algorithm; Computer science; Mathematics; Point (geometry); Linear programming","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001649488,0.0004620821,0.0006142486,0.0003884208,0.001238452,0.0005494233,0.001083644,0.0004243392,0.0001561289],"category_scores_gemma":[0.004720491,0.0004801134,0.0002730296,0.000262694,0.0003616406,0.0006866448,0.0002490422,0.0004385506,0.000007484488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004839183,"about_ca_system_score_gemma":0.0005212055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006244676,"about_ca_topic_score_gemma":0.0002700544,"domain_scores_codex":[0.9967225,0.0002037729,0.0007908848,0.000675353,0.0006416564,0.0009658321],"domain_scores_gemma":[0.9952776,0.0008098984,0.0007553362,0.001986247,0.0007565469,0.0004143832],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005056087,0.002082024,0.003451342,0.0005938938,0.0003618622,0.0001137397,0.0004134881,0.3196551,0.001460224,0.1626655,0.009738731,0.4989585],"study_design_scores_gemma":[0.002079793,0.00016113,0.0002630274,0.00006562086,0.00004376899,0.00001673396,0.0000580734,0.9702542,0.005340221,0.02059079,0.0006216971,0.00050497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004060956,0.00007164943,0.9910399,0.004185513,0.0001502366,0.002413149,0.0002765787,0.000830869,0.0006260542],"genre_scores_gemma":[0.01917559,0.00005352693,0.9768207,0.0006936155,0.0001886946,0.001465893,0.0001435218,0.000149536,0.001308928],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6505991,"threshold_uncertainty_score":0.999765,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04647607653764747,"score_gpt":0.3423832298216191,"score_spread":0.2959071532839717,"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."}}