{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T00:16:33Z","timestamp":1770768993319,"version":"3.50.0"},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,18]],"date-time":"2026-12-18T00:00:00Z","timestamp":1797552000000},"content-version":"am","delay-in-days":292,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100006602","name":"Air Force Research Laboratory Information Directorate","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006602","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1016\/j.orl.2025.107398","type":"journal-article","created":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T07:59:42Z","timestamp":1765353582000},"page":"107398","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A feasible method for constrained derivative-free optimization"],"prefix":"10.1016","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4590-9897","authenticated-orcid":false,"given":"Melody","family":"Qiming Xuan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9662-2730","authenticated-orcid":false,"given":"Jorge","family":"Nocedal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.orl.2025.107398_bib0001","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1137\/080724083","article-title":"Benchmarking derivative-free optimization algorithms","volume":"20","author":"Mor\u00e9","year":"2009","journal-title":"SIAM J. Optim."},{"issue":"3","key":"10.1016\/j.orl.2025.107398_bib0002","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1007\/s10898-012-9951-y","article-title":"Derivative-free optimization: a review of algorithms and comparison of software implementations","volume":"56","author":"Rios","year":"2013","journal-title":"J. Global Optim."},{"key":"10.1016\/j.orl.2025.107398_bib0003","first-page":"1","article-title":"On the numerical performance of finite-difference-based methods for derivative-free optimization","author":"Shi","year":"2022","journal-title":"Optim. Methods Softw."},{"key":"10.1016\/j.orl.2025.107398_bib0004","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1017\/S0962492919000060","article-title":"Derivative-free optimization methods","volume":"28","author":"Larson","year":"2019","journal-title":"Acta Numerica"},{"key":"10.1016\/j.orl.2025.107398_bib0005","series-title":"Proceedings of 7th AIAA\/USAF\/NASA\/ISSMO Symposium on Multidisciplinary Analysis and Optimization, St. Louis, MO","first-page":"3","article-title":"A derivative free optimization algorithm in practice","volume":"48","author":"Conn","year":"1998"},{"issue":"6","key":"10.1016\/j.orl.2025.107398_bib0006","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1080\/10556788.2015.1026968","article-title":"A trust-region derivative-free algorithm for constrained optimization","volume":"30","author":"Conejo","year":"2015","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"10.1016\/j.orl.2025.107398_bib0007","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.1137\/S1052623498339727","article-title":"A globally convergent augmented Lagrangian pattern search algorithm for optimization with general constraints and simple bounds","volume":"12","author":"Lewis","year":"2002","journal-title":"SIAM J. Optim."},{"issue":"1","key":"10.1016\/j.orl.2025.107398_bib0008","first-page":"36","article-title":"Nonlinearly constrained optimization using heuristic penalty methods and asynchronous parallel generating set search","volume":"2010","author":"Griffin","year":"2010","journal-title":"Appl. Math. Res. eXpress"},{"key":"10.1016\/j.orl.2025.107398_bib0009","series-title":"Technical Report","article-title":"LINearly Constrained Optimization Algorithm","author":"Powell","year":"2005"},{"issue":"4","key":"10.1016\/j.orl.2025.107398_bib0010","doi-asserted-by":"crossref","first-page":"2552","DOI":"10.1137\/21M1460971","article-title":"Model-based derivative-free methods for convex-constrained optimization","volume":"32","author":"Hough","year":"2022","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.orl.2025.107398_bib0011","series-title":"Introduction to derivative-free optimization","volume":"8","author":"Conn","year":"2009"},{"key":"10.1016\/j.orl.2025.107398_bib0012","series-title":"Large-Scale Nonlinear Optimization","first-page":"255","article-title":"The NEWUOA software for unconstrained optimization without derivatives","author":"Powell","year":"2006"},{"issue":"1","key":"10.1016\/j.orl.2025.107398_bib0013","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1080\/10556780802409296","article-title":"On the geometry phase in model-based algorithms for derivative-free optimization","volume":"24","author":"Fasano","year":"2009","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"10.1016\/j.orl.2025.107398_bib0014","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s10107-023-01941-9","article-title":"A trust region method for noisy unconstrained optimization","volume":"202","author":"Sun","year":"2023","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2025.107398_bib0015","doi-asserted-by":"crossref","unstructured":"M.J.D. Powell, A direct search optimization method that models the objective by quadratic interpolation, 1994, (Presentation at the 5th Stockholm Optimization Days, Stockholm).","DOI":"10.1007\/978-94-015-8330-5_4"},{"key":"10.1016\/j.orl.2025.107398_bib0016","unstructured":"M.J.D. Powell, The BOBYQA algorithm for bound constrained optimization without derivatives, Cambridge NA Report NA2009\/06, University of Cambridge, Cambridge (2009) 26\u201346."},{"issue":"3","key":"10.1016\/j.orl.2025.107398_bib0017","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s12532-015-0084-4","article-title":"On fast trust region methods for quadratic models with linear constraints","volume":"7","author":"Powell","year":"2015","journal-title":"Math. Programm. Comput."},{"key":"10.1016\/j.orl.2025.107398_bib0018","unstructured":"T.M. Ragonneau, Z. Zhang, PDFO: Cross-Platform Interfaces for Powell\u2019s Derivative-Free Optimization Solvers (Version 1.0), 2020, 10.5281\/zenodo.3887569."},{"key":"10.1016\/j.orl.2025.107398_bib0019","series-title":"Advances in Optimization and Numerical Analysis, Proceedings of the Sixth Workshop on Optimization and Numerical Analysis, Oaxaca, Mexico","first-page":"51","article-title":"A direct search optimization method that models the objective and constraint functions by linear interpolation","volume":"275","author":"Powell","year":"1994"},{"key":"10.1016\/j.orl.2025.107398_bib0020","unstructured":"T.M. Ragonneau, Model-based derivative-free optimization methods and software,(2022), arXiv preprint arXiv: 2210.12018."},{"issue":"4","key":"10.1016\/j.orl.2025.107398_bib0021","doi-asserted-by":"crossref","first-page":"1286","DOI":"10.1137\/060654797","article-title":"On augmented Lagrangian methods with general lower-level constraints","volume":"18","author":"Andreani","year":"2008","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.orl.2025.107398_bib0022","series-title":"Technical Report","article-title":"HOPSPACK 2.0 user manual","author":"Plantenga","year":"2009"},{"issue":"1","key":"10.1016\/j.orl.2025.107398_bib0023","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-023-00245-5","article-title":"Structure-aware methods for expensive derivative-free nonsmooth composite optimization","volume":"16","author":"Larson","year":"2024","journal-title":"Math. Programm. Comput."},{"issue":"1","key":"10.1016\/j.orl.2025.107398_bib0024","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.cam.2004.11.029","article-title":"CONDOR, A new parallel, constrained extension of Powell\u2019s UOBYQA algorithm: experimental results and comparison with the DFO algorithm","volume":"181","author":"Berghen","year":"2005","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.orl.2025.107398_bib0025","first-page":"324","article-title":"Global convergence of trust-region algorithms for convex constrained minimization without derivatives","volume":"220","author":"Conejo","year":"2013","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"10.1016\/j.orl.2025.107398_bib0026","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10107-012-0578-z","article-title":"Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization","volume":"134","author":"Bandeira","year":"2012","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2025.107398_bib0027","series-title":"Large-Scale Nonlinear Optimization","first-page":"35","article-title":"KNITRO: an integrated package for nonlinear optimization","author":"Byrd","year":"2006"},{"issue":"4","key":"10.1016\/j.orl.2025.107398_bib0028","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/S0893-9659(01)00162-8","article-title":"A numerical study of limited memory BFGS methods","volume":"15","author":"Morales","year":"2002","journal-title":"Appl. Math. Lett."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637725001592?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637725001592?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T16:35:48Z","timestamp":1770654948000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637725001592"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":28,"alternative-id":["S0167637725001592"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2025.107398","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2026,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A feasible method for constrained derivative-free optimization","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.orl.2025.107398","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107398"}}