{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001634006,0.001156938,0.00127577,0.0005990909,0.0004449426,0.0009660813,0.002541413,0.001592777,0.002730812],"category_scores_gemma":[0.005089671,0.0007384039,0.001049354,0.0006313851,0.0009723757,0.001279774,0.002151537,0.002154845,0.001106912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008585413,"about_ca_system_score_gemma":0.001638282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005052636,"about_ca_topic_score_gemma":0.003226108,"domain_scores_codex":[0.9992379,0.0002585357,0.0000344342,0.00009727181,0.0003060628,0.00006583925],"domain_scores_gemma":[0.9980421,0.001160592,0.0001502815,0.0001843687,0.0003628864,0.00009978886],"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.00009800398,0.00004885219,0.0002430195,0.0001342383,0.00005826225,0.00009212752,0.0001076326,0.9215479,0.004241528,0.01678363,0.001829599,0.05481523],"study_design_scores_gemma":[0.000009030804,0.00001692845,0.00001326707,0.000004844839,0.000003533331,0.00001069596,0.000002161578,0.9973353,0.0005353048,0.001491761,0.0005732825,0.00000380093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001750843,0.00009858283,0.9971648,0.00004223928,0.00001418757,0.00001988415,0.00001174501,0.0002143613,0.0006833685],"genre_scores_gemma":[0.1947802,0.0002362016,0.800334,0.0001254749,0.00004082115,0.0002880355,0.0001513983,0.0004263319,0.003617611],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005052636,"threshold_uncertainty_score":0.01004642,"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."}}