{"id":"W2517321039","doi":"10.1007/s10589-018-0020-4","title":"A progressive barrier derivative-free trust-region algorithm for constrained optimization","year":2018,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Trust region; Mathematical optimization; Mathematics; Quadratic equation; Domain (mathematical analysis); Quadratic programming; Constrained optimization; Constrained optimization problem; Derivative (finance); Software; Optimization problem; Algorithm; Computer science","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.0002146251,0.0002721982,0.0002747952,0.0002147445,0.0008168879,0.0001546114,0.0002888298,0.0001452564,0.0002776116],"category_scores_gemma":[0.0005358834,0.0002839013,0.00007491846,0.0007259966,0.0005942294,0.0003841299,0.0001220943,0.0001221862,0.000007172837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000885112,"about_ca_system_score_gemma":0.0001942818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.370119e-7,"about_ca_topic_score_gemma":5.232044e-7,"domain_scores_codex":[0.9980991,0.00007729104,0.000549841,0.0005773253,0.0003692581,0.0003271967],"domain_scores_gemma":[0.9964224,0.0006831753,0.0003403466,0.0003685965,0.001970937,0.0002145961],"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.00002877297,0.0001699202,0.00002033188,0.00003709314,0.00005951862,0.00000102334,0.0002051339,0.879721,0.000003919301,0.08901005,0.001219519,0.02952366],"study_design_scores_gemma":[0.001789348,0.0001111727,0.00001179039,0.00002374848,0.00003608469,0.00003907847,0.000152199,0.9209937,0.0000627295,0.07493804,0.001558308,0.0002837965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002714861,0.00006778137,0.9949921,0.0008142572,0.00005610909,0.002633865,0.0001867326,0.000267379,0.0009545792],"genre_scores_gemma":[0.002003002,0.00002705838,0.9942055,0.0002762072,0.0003753669,0.001787284,0.0006483751,0.00007079022,0.000606383],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04127266,"threshold_uncertainty_score":0.9999613,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03824738742991372,"score_gpt":0.3552282416599088,"score_spread":0.3169808542299951,"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."}}