{"id":"W3020948674","doi":"","title":"A progressive barrier derivative-free trust-region algorithm for constrained optimization","year":2016,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Trust region; Mathematical optimization; Constrained optimization; Domain (mathematical analysis); Computer science; Quadratic equation; Constrained optimization problem; Quadratic programming; Derivative-free optimization; Software; Optimization problem; Derivative (finance); Algorithm; Linear programming; Mathematics; Multi-swarm optimization","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.0009675167,0.00042018,0.0004426389,0.000514385,0.0003943263,0.0004366634,0.002017313,0.0002961443,0.00009156959],"category_scores_gemma":[0.002337179,0.0003297637,0.0002023228,0.0009869733,0.0002867721,0.001129042,0.0006224057,0.0002153703,0.00001224808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004424334,"about_ca_system_score_gemma":0.0006512408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001134666,"about_ca_topic_score_gemma":0.00001490154,"domain_scores_codex":[0.9964173,0.0003041977,0.0006606382,0.0009056932,0.000700068,0.001012043],"domain_scores_gemma":[0.995878,0.0006139287,0.0003948168,0.001709678,0.0008792416,0.0005243655],"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.0000981195,0.0003598601,0.001119826,0.00004618597,0.0001555792,0.0001833057,0.0003131265,0.01064279,0.001338032,0.09876786,0.006918736,0.8800566],"study_design_scores_gemma":[0.002140484,0.000266603,0.000329627,0.00007054473,0.00001716383,0.0001875067,0.00002348326,0.9825271,0.006984552,0.005634313,0.001358744,0.0004598318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001515112,0.0002677635,0.9871734,0.008692618,0.0001905028,0.002195327,0.0001189488,0.0009509238,0.000258976],"genre_scores_gemma":[0.009159634,0.00009017457,0.9857249,0.0007453748,0.0001688364,0.002073579,0.00002389599,0.00007299047,0.001940626],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9718844,"threshold_uncertainty_score":0.9999154,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01579796576342206,"score_gpt":0.2590720878640632,"score_spread":0.2432741221006411,"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."}}