{"id":"W2795213612","doi":"10.2298/yjor180120014g","title":"Less is more: Simplified Nelder-Mead method for large unconstrained optimization","year":2018,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Regular polygon; Mathematical optimization; Simplex; Simplex algorithm; Simple (philosophy); Algorithm; Computer science; Continuous optimization; Mathematics; Optimization problem; Convex optimization; Linear programming; Combinatorics; Multi-swarm optimization; 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.0008345116,0.0009325009,0.001158331,0.0006911702,0.0005575462,0.0008261875,0.001475832,0.001052008,0.007407563],"category_scores_gemma":[0.002639701,0.000391587,0.0009303745,0.0008214011,0.0004714459,0.001007983,0.001380452,0.001307881,0.001589382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004581884,"about_ca_system_score_gemma":0.001207313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005291484,"about_ca_topic_score_gemma":0.009849596,"domain_scores_codex":[0.9995863,0.0001586428,0.00001754735,0.00005117104,0.0001521223,0.00003425058],"domain_scores_gemma":[0.9993062,0.0003990541,0.00003931987,0.00008611032,0.0001248119,0.00004452751],"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.0002114666,0.0001442355,0.0009699812,0.0006275765,0.0001247064,0.0002640488,0.0001455132,0.6524421,0.006422582,0.03256213,0.02041029,0.2856754],"study_design_scores_gemma":[0.00002782968,0.00002587484,0.0001537978,0.00001912017,0.000008130884,0.00004630433,0.00001201559,0.982617,0.0007589769,0.008770484,0.007549894,0.0000106677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006523886,0.0007299618,0.9855726,0.0002727262,0.00008654703,0.00008154849,0.0001748568,0.0006784974,0.005879445],"genre_scores_gemma":[0.1029024,0.0005450828,0.8875598,0.0003686829,0.0001006716,0.0005307754,0.0006306421,0.0005286453,0.006833348],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007407563,"threshold_uncertainty_score":0.02478081,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2462101905584332,"score_gpt":0.5465173684657684,"score_spread":0.3003071779073352,"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."}}