{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T16:55:33Z","timestamp":1777568133205,"version":"3.51.4"},"reference-count":79,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T00:00:00Z","timestamp":1728691200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T00:00:00Z","timestamp":1728691200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Hong Kong Polytechnic University"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The late Professor M. J. D. Powell devised five trust-region methods for derivative-free optimization, namely COBYLA, UOBYQA, NEWUOA, BOBYQA, and LINCOA. He carefully implemented them into publicly available solvers, renowned for their robustness and efficiency. However, the solvers were implemented in Fortran 77 and hence may not be easily accessible to some users. We introduce the PDFO package, which provides user-friendly Python and MATLAB interfaces to Powell\u2019s code. With PDFO, users of such languages can call Powell\u2019s Fortran solvers easily without dealing with the Fortran code. Moreover, PDFO includes bug fixes and improvements, which are particularly important for handling problems that suffer from ill-conditioning or failures of function evaluations. In addition to the PDFO package, we provide an overview of Powell\u2019s methods, sketching them from a uniform perspective, summarizing their main features, and highlighting the similarities and interconnections among them. We also present experiments on PDFO to demonstrate its stability under noise, tolerance of failures in function evaluations, and potential to solve certain hyperparameter optimization problems.<\/jats:p>","DOI":"10.1007\/s12532-024-00257-9","type":"journal-article","created":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T03:16:38Z","timestamp":1728702998000},"page":"535-559","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["PDFO: a cross-platform package for Powell\u2019s derivative-free optimization solvers"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2717-2876","authenticated-orcid":false,"given":"Tom M.","family":"Ragonneau","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8934-8190","authenticated-orcid":false,"given":"Zaikun","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,12]]},"reference":[{"key":"257_CR1","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/j.orl.2020.05.011","volume":"48","author":"C Audet","year":"2020","unstructured":"Audet, C., Caporossi, G., Jacquet, S.: Binary, unrelaxable and hidden constraints in blackbox optimization. Oper. Res. Lett. 48, 467\u2013471 (2020). https:\/\/doi.org\/10.1016\/j.orl.2020.05.011","journal-title":"Oper. Res. Lett."},{"key":"257_CR2","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/040603371","volume":"17","author":"C Audet","year":"2006","unstructured":"Audet, C., Dennis, J.E., Jr.: Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17, 188\u2013217 (2006). https:\/\/doi.org\/10.1137\/040603371","journal-title":"SIAM J. Optim."},{"key":"257_CR3","series-title":"Springer Series in Operations Research and Financial Engineering","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68913-5","volume-title":"Derivative-Free and Blackbox Optimization","author":"C Audet","year":"2017","unstructured":"Audet, C., Hare, W.: Derivative-Free and Blackbox Optimization. Springer Series in Operations Research and Financial Engineering, Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68913-5"},{"key":"257_CR4","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10107-012-0578-z","volume":"134","author":"AS Bandeira","year":"2012","unstructured":"Bandeira, A.S., Scheinberg, K., Vicente, L.N.: Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization. Math. Program. 134, 223\u2013257 (2012). https:\/\/doi.org\/10.1007\/s10107-012-0578-z","journal-title":"Math. Program."},{"key":"257_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v067.i01","volume":"67","author":"D Bates","year":"2015","unstructured":"Bates, D., M\u00e4chler, M., Bolker, B.M., Walker, S.C.: Fitting linear mixed-effects models using lme4. J. Stat. Softw. 67, 1\u201348 (2015). https:\/\/doi.org\/10.18637\/jss.v067.i01","journal-title":"J. Stat. Softw."},{"key":"257_CR6","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1137\/18M1177718","volume":"29","author":"AS Berahas","year":"2019","unstructured":"Berahas, A.S., Byrd, R.H., Nocedal, J.: Derivative-free optimization of noisy functions via quasi-Newton methods. SIAM J. Optim. 29, 965\u2013993 (2019). https:\/\/doi.org\/10.1137\/18M1177718","journal-title":"SIAM J. Optim."},{"key":"257_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1137\/100814688","volume":"23","author":"SC Billups","year":"2013","unstructured":"Billups, S.C., Larson, J., Graf, P.: Derivative-free optimization of expensive functions with computational error using weighted regression. SIAM J. Optim. 23, 27\u201353 (2013). https:\/\/doi.org\/10.1137\/100814688","journal-title":"SIAM J. Optim."},{"key":"257_CR8","doi-asserted-by":"publisher","unstructured":"Buhmann, M.D., Fletcher, R., Iserles, A., Toint, P.: Michael J. D. Powell. 29 July 1936\u201319 April 2015. Biogr. Mems Fell. R. Soc. 64, 341\u2013366 (2018). https:\/\/doi.org\/10.1098\/rsbm.2017.0023","DOI":"10.1098\/rsbm.2017.0023"},{"key":"257_CR9","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/3338517","volume":"45","author":"C Cartis","year":"2019","unstructured":"Cartis, C., Fiala, J., Marteau, B., Roberts, L.: Improving the flexibility and robustness of model-based derivative-free optimization solvers. ACM Trans. Math. Softw. 45, 32 (2019). https:\/\/doi.org\/10.1145\/3338517","journal-title":"ACM Trans. Math. Softw."},{"key":"257_CR10","doi-asserted-by":"publisher","first-page":"2343","DOI":"10.1080\/02331934.2021.1883015","volume":"71","author":"C Cartis","year":"2022","unstructured":"Cartis, C., Roberts, L., Sheridan-Methven, O.: Escaping local minima with local derivative-free methods: a numerical investigation. Optimization 71, 2343\u20132373 (2022). https:\/\/doi.org\/10.1080\/02331934.2021.1883015","journal-title":"Optimization"},{"key":"257_CR11","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/1961189.1961199","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines. ACM Trans. Intell. Syst. Technol. 2, 27 (2011). https:\/\/doi.org\/10.1145\/1961189.1961199","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"257_CR12","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/10556788.2011.623162","volume":"28","author":"AR Conn","year":"2013","unstructured":"Conn, A.R., Le Digabel, S.: Use of quadratic models with mesh-adaptive direct search for constrained black box optimization. Optim. Methods Softw. 28, 139\u2013158 (2013). https:\/\/doi.org\/10.1080\/10556788.2011.623162","journal-title":"Optim. Methods Softw."},{"key":"257_CR13","first-page":"83","volume-title":"Approximation Theory and Optimization: Tributes to M. J. D. Powell","author":"AR Conn","year":"1997","unstructured":"Conn, A.R., Scheinberg, K., Toint, Ph.L.: On the convergence of derivative-free methods for unconstrained optimization. In: Buhmann, M.D., Iserles, A. (eds.) Approximation Theory and Optimization: Tributes to M. J. D. Powell, pp. 83\u2013108. Cambridge University Press, Cambridge (1997)"},{"key":"257_CR14","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BF02614326","volume":"79","author":"AR Conn","year":"1997","unstructured":"Conn, A.R., Scheinberg, K., Toint, Ph.L.: Recent progress in unconstrained nonlinear optimization without derivatives. Math. Program. 79, 397\u2013414 (1997). https:\/\/doi.org\/10.1007\/BF02614326","journal-title":"Math. Program."},{"key":"257_CR15","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10107-006-0073-5","volume":"111","author":"AR Conn","year":"2008","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Geometry of interpolation sets in derivative free optimization. Math. Program. 111, 141\u2013172 (2008). https:\/\/doi.org\/10.1007\/s10107-006-0073-5","journal-title":"Math. Program."},{"key":"257_CR16","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1093\/imanum\/drn046","volume":"28","author":"AR Conn","year":"2008","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation. IMA J. Numer. Anal. 28, 721\u2013748 (2008). https:\/\/doi.org\/10.1093\/imanum\/drn046","journal-title":"IMA J. Numer. Anal."},{"key":"257_CR17","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1137\/060673424","volume":"20","author":"AR Conn","year":"2009","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Global convergence of general derivative-free trust-region algorithms to first- and second-order critical points. SIAM J. Optim. 20, 387\u2013415 (2009). https:\/\/doi.org\/10.1137\/060673424","journal-title":"SIAM J. Optim."},{"key":"257_CR18","series-title":"MPS-SIAM Series on Optimization","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to Derivative-Free Optimization","author":"AR Conn","year":"2009","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to Derivative-Free Optimization. MPS-SIAM Series on Optimization, SIAM, Philadelphia (2009). https:\/\/doi.org\/10.1137\/1.9780898718768"},{"key":"257_CR19","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-1-4899-0289-4_3","volume-title":"Nonlinear Optimization and Applications","author":"AR Conn","year":"1996","unstructured":"Conn, A.R., Toint, Ph.L.: An algorithm using quadratic interpolation for unconstrained derivative free optimization. In: Di Pillo, G., Giannessi, F. (eds.) Nonlinear Optimization and Applications, pp. 27\u201347. Springer, Boston (1996). https:\/\/doi.org\/10.1007\/978-1-4899-0289-4_3"},{"key":"257_CR20","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1137\/1.9781611974683.ch37","volume-title":"Advances and Trends in Optimization with Engineering Applications","author":"AL Cust\u00f3dio","year":"2017","unstructured":"Cust\u00f3dio, A.L., Scheinberg, K., Vicente, L.N.: Methodologies and software for derivative-free optimization. In: Terlaky, T., Anjos, M.F., Ahmed, S. (eds.) Advances and Trends in Optimization with Engineering Applications, pp. 495\u2013506. SIAM, Philadelphia (2017). https:\/\/doi.org\/10.1137\/1.9781611974683.ch37"},{"key":"257_CR21","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1137\/1021091","volume":"21","author":"JE Dennis Jr","year":"1979","unstructured":"Dennis, J.E., Jr., Schnabel, R.B.: Least change secant updates for quasi-Newton methods. SIAM Rev. 21, 443\u2013459 (1979). https:\/\/doi.org\/10.1137\/1021091","journal-title":"SIAM Rev."},{"key":"257_CR22","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10107-014-0847-0","volume":"155","author":"M Dodangeh","year":"2016","unstructured":"Dodangeh, M., Vicente, L.N.: Worst case complexity of direct search under convexity. Math. Program. 155, 307\u2013332 (2016). https:\/\/doi.org\/10.1007\/s10107-014-0847-0","journal-title":"Math. Program."},{"key":"257_CR23","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1093\/comjnl\/6.2.163","volume":"6","author":"R Fletcher","year":"1963","unstructured":"Fletcher, R., Powell, M.J.D.: A rapidly convergent descent method for minimization. Comput. J. 6, 163\u2013168 (1963). https:\/\/doi.org\/10.1093\/comjnl\/6.2.163","journal-title":"Comput. J."},{"key":"257_CR24","doi-asserted-by":"publisher","first-page":"4377","DOI":"10.21105\/joss.04377","volume":"7","author":"J Fowkes","year":"2022","unstructured":"Fowkes, J., Roberts, L., B\u0171rmen, \u00c1.: PyCUTEst: an open source Python package of optimization test problems. J. Open Sour. Softw. 7, 4377 (2022). https:\/\/doi.org\/10.21105\/joss.04377","journal-title":"J. Open Sour. Softw."},{"key":"257_CR25","doi-asserted-by":"publisher","unstructured":"Gallard, F., Vanaret, C., Gu\u00e9not, D., Gachelin, V., Lafage, R., Pauwels, B., Barjhoux, P.J., Gazaix, A.: GEMS: a Python library for automation of multidisciplinary design optimization process generation. In: 2018 AIAA\/ASCE\/AHS\/ASC Structures, Structural Dynamics, and Materials Conference. AIAA, Kissimmee, FL, USA (2018). https:\/\/doi.org\/10.2514\/6.2018-0657","DOI":"10.2514\/6.2018-0657"},{"key":"257_CR26","doi-asserted-by":"publisher","first-page":"1987","DOI":"10.1137\/151005683","volume":"26","author":"R Garmanjani","year":"2016","unstructured":"Garmanjani, R., J\u00fadice, D., Vicente, L.N.: Trust-region methods without using derivatives: worst case complexity and the nonsmooth case. SIAM J. Optim. 26, 1987\u20132011 (2016). https:\/\/doi.org\/10.1137\/151005683","journal-title":"SIAM J. Optim."},{"key":"257_CR27","unstructured":"Ghanbari, H., Scheinberg, K.: Black-box optimization in machine learning with trust region based derivative free algorithm. Technical Report 17T-005, COR@L, Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA, USA (2017)"},{"key":"257_CR28","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NIM Gould","year":"2015","unstructured":"Gould, N.I.M., Orban, D., Toint, Ph.L.: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput. Optim. Appl. 60, 545\u2013557 (2015). https:\/\/doi.org\/10.1007\/s10589-014-9687-3","journal-title":"Comput. Optim. Appl."},{"key":"257_CR29","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1137\/140961602","volume":"25","author":"S Gratton","year":"2015","unstructured":"Gratton, S., Royer, C.W., Vicente, L.N., Zhang, Z.: Direct search based on probabilistic descent. SIAM J. Optim. 25, 1515\u20131541 (2015). https:\/\/doi.org\/10.1137\/140961602","journal-title":"SIAM J. Optim."},{"key":"257_CR30","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s10589-019-00062-4","volume":"72","author":"S Gratton","year":"2019","unstructured":"Gratton, S., Royer, C.W., Vicente, L.N., Zhang, Z.: Direct search based on probabilistic feasible descent for bound and linearly constrained problems. Comput. Optim. Appl. 72, 525\u2013559 (2019). https:\/\/doi.org\/10.1007\/s10589-019-00062-4","journal-title":"Comput. Optim. Appl."},{"key":"257_CR31","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/1031049","volume":"31","author":"WW Hager","year":"1989","unstructured":"Hager, W.W.: Updating the inverse of a matrix. SIAM Rev. 31, 221\u2013239 (1989). https:\/\/doi.org\/10.1137\/1031049","journal-title":"SIAM Rev."},{"key":"257_CR32","doi-asserted-by":"publisher","first-page":"2552","DOI":"10.1137\/21M1460971","volume":"32","author":"M Hough","year":"2022","unstructured":"Hough, M., Roberts, L.: Model-based derivative-free methods for convex-constrained optimization. SIAM J. Optim. 32, 2552\u20132579 (2022). https:\/\/doi.org\/10.1137\/21M1460971","journal-title":"SIAM J. Optim."},{"key":"257_CR33","doi-asserted-by":"publisher","unstructured":"Izadinia, H., Shan, Q., Seitz, S.M.: IM2CAD. In: 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 2422\u20132431. IEEE, Honolulu, HI, USA (2017). https:\/\/doi.org\/10.1109\/CVPR.2017.260","DOI":"10.1109\/CVPR.2017.260"},{"key":"257_CR34","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971903","volume-title":"Implicit Filtering","author":"CT Kelley","year":"2011","unstructured":"Kelley, C.T.: Implicit Filtering. SIAM, Philadelphia (2011). https:\/\/doi.org\/10.1137\/1.9781611971903"},{"key":"257_CR35","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1137\/S003614450242889","volume":"45","author":"TG Kolda","year":"2003","unstructured":"Kolda, T.G., Lewis, R.M., Torczon, V.: Optimization by direct search: new perspectives on some classical and modern methods. SIAM Rev. 45, 385\u2013482 (2003). https:\/\/doi.org\/10.1137\/S003614450242889","journal-title":"SIAM Rev."},{"key":"257_CR36","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1017\/S0962492919000060","volume":"28","author":"J Larson","year":"2019","unstructured":"Larson, J., Menickelly, M., Wild, S.M.: Derivative-free optimization methods. Acta Numer. 28, 287\u2013404 (2019). https:\/\/doi.org\/10.1017\/S0962492919000060","journal-title":"Acta Numer."},{"key":"257_CR37","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/1916461.1916468","volume":"37","author":"S Le Digabel","year":"2011","unstructured":"Le Digabel, S.: Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm. ACM Trans. Math. Softw. 37, 44 (2011). https:\/\/doi.org\/10.1145\/1916461.1916468","journal-title":"ACM Trans. Math. Softw."},{"key":"257_CR38","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1007\/s11081-023-09839-3","volume":"25","author":"S Le Digabel","year":"2024","unstructured":"Le Digabel, S., Wild, S.M.: A taxonomy of constraints in black-box simulation-based optimization. Optim. Eng. 25, 1124\u20131143 (2024). https:\/\/doi.org\/10.1007\/s11081-023-09839-3","journal-title":"Optim. Eng."},{"key":"257_CR39","doi-asserted-by":"publisher","first-page":"3079","DOI":"10.1093\/mnras\/sts565","volume":"429","author":"GA Mamon","year":"2013","unstructured":"Mamon, G.A., Biviano, A., Bou\u00e9, G.: MAMPOSSt: modelling anisotropy and mass profiles of observed spherical systems I. Gaussian 3D velocities. Mon. Not. R. Astron. Soc. 429, 3079\u20133098 (2013). https:\/\/doi.org\/10.1093\/mnras\/sts565","journal-title":"Mon. Not. R. Astron. Soc."},{"key":"257_CR40","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10514-009-9170-7","volume":"28","author":"K Mombaur","year":"2010","unstructured":"Mombaur, K., Truong, A., Laumond, J.P.: From human to humanoid locomotion\u2013an inverse optimal control approach. Auton. Robot. 28, 369\u2013383 (2010). https:\/\/doi.org\/10.1007\/s10514-009-9170-7","journal-title":"Auton. Robot."},{"key":"257_CR41","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"JJ Mor\u00e9","year":"1983","unstructured":"Mor\u00e9, J.J., Sorensen, D.C.: Computing a trust region step. SIAM J. Sci. Stat. Comput. 4, 553\u2013572 (1983). https:\/\/doi.org\/10.1137\/0904038","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"257_CR42","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/080724083","volume":"20","author":"JJ Mor\u00e9","year":"2009","unstructured":"Mor\u00e9, J.J., Wild, S.M.: Benchmarking derivative-free optimization algorithms. SIAM J. Optim. 20, 172\u2013191 (2009). https:\/\/doi.org\/10.1137\/080724083","journal-title":"SIAM J. Optim."},{"key":"257_CR43","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/2168773.2168777","volume":"38","author":"JJ Mor\u00e9","year":"2012","unstructured":"Mor\u00e9, J.J., Wild, S.M.: Estimating derivatives of noisy simulations. ACM Trans. Math. Softw. 38, 19 (2012). https:\/\/doi.org\/10.1145\/2168773.2168777","journal-title":"ACM Trans. Math. Softw."},{"key":"257_CR44","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder, J.A., Mead, R.: A simplex method for function minimization. Comput. J. 7, 308\u2013313 (1965). https:\/\/doi.org\/10.1093\/comjnl\/7.4.308","journal-title":"Comput. J."},{"key":"257_CR45","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/02286203.2009.11442507","volume":"29","author":"R Oeuvray","year":"2009","unstructured":"Oeuvray, R., Bierlaire, M.: BOOSTERS: a derivative-free algorithm based on radial basis functions. Int. J. Model. Simul. 29, 29\u201336 (2009). https:\/\/doi.org\/10.1080\/02286203.2009.11442507","journal-title":"Int. J. Model. Simul."},{"key":"257_CR46","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/3085592","volume":"44","author":"M Porcelli","year":"2017","unstructured":"Porcelli, M., Toint, Ph.L.: BFO, a trainable derivative-free brute force optimizer for nonlinear bound-constrained optimization and equilibrium computations with continuous and discrete variables. ACM Trans. Math. Softw. 44, 6 (2017). https:\/\/doi.org\/10.1145\/3085592","journal-title":"ACM Trans. Math. Softw."},{"key":"257_CR47","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/3474054","volume":"48","author":"M Porcelli","year":"2022","unstructured":"Porcelli, M., Toint, Ph.L.: Exploiting problem structure in derivative free optimization. ACM Trans. Math. Softw. 48, 6 (2022). https:\/\/doi.org\/10.1145\/3474054","journal-title":"ACM Trans. Math. Softw."},{"key":"257_CR48","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1093\/comjnl\/7.2.155","volume":"7","author":"MJD Powell","year":"1964","unstructured":"Powell, M.J.D.: An efficient method for finding the minimum of a function of several variables without calculating derivatives. Comput. J. 7, 155\u2013162 (1964). https:\/\/doi.org\/10.1093\/comjnl\/7.2.155","journal-title":"Comput. J."},{"key":"257_CR49","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/B978-0-12-597050-1.50006-3","volume-title":"Nonlinear Programming","author":"MJD Powell","year":"1970","unstructured":"Powell, M.J.D.: A new algorithm for unconstrained optimization. In: Rosen, J.B., Mangasarian, O.L., Ritter, K. (eds.) Nonlinear Programming, pp. 31\u201365. Academic Press, Madison (1970). https:\/\/doi.org\/10.1016\/B978-0-12-597050-1.50006-3"},{"key":"257_CR50","series-title":"Mathematics and Its Applications","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-94-015-8330-5_4","volume-title":"Advances in Optimization and Numerical Analysis","author":"MJD Powell","year":"1994","unstructured":"Powell, M.J.D.: A direct search optimization method that models the objective and constraint functions by linear interpolation. In: Gomez, S., Hennart, J.P. (eds.) Advances in Optimization and Numerical Analysis. Mathematics and Its Applications, vol. 275, pp. 51\u201367. Springer, Dordrecht (1994)"},{"key":"257_CR51","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1017\/S0962492900002841","volume":"7","author":"MJD Powell","year":"1998","unstructured":"Powell, M.J.D.: Direct search algorithms for optimization calculations. Acta Numer. 7, 287\u2013336 (1998). https:\/\/doi.org\/10.1017\/S0962492900002841","journal-title":"Acta Numer."},{"key":"257_CR52","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1080\/10556780108805839","volume":"16","author":"MJD Powell","year":"2001","unstructured":"Powell, M.J.D.: On the Lagrange functions of quadratic models that are defined by interpolation. Optim. Methods Softw. 16, 289\u2013309 (2001). https:\/\/doi.org\/10.1080\/10556780108805839","journal-title":"Optim. Methods Softw."},{"key":"257_CR53","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s101070100290","volume":"92","author":"MJD Powell","year":"2002","unstructured":"Powell, M.J.D.: UOBYQA: unconstrained optimization by quadratic approximation. Math. Program. 92, 555\u2013582 (2002). https:\/\/doi.org\/10.1007\/s101070100290","journal-title":"Math. Program."},{"key":"257_CR54","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10107-003-0490-7","volume":"100","author":"MJD Powell","year":"2004","unstructured":"Powell, M.J.D.: Least Frobenius norm updating of quadratic models that satisfy interpolation conditions. Math. Program. 100, 183\u2013215 (2004). https:\/\/doi.org\/10.1007\/s10107-003-0490-7","journal-title":"Math. Program."},{"key":"257_CR55","first-page":"56","volume-title":"Numerical Linear Algebra and Optimization","author":"MJD Powell","year":"2004","unstructured":"Powell, M.J.D.: On updating the inverse of a KKT matrix. In: Yuan, Y. (ed.) Numerical Linear Algebra and Optimization, pp. 56\u201378. Science Press, Beijing (2004)"},{"key":"257_CR56","series-title":"Nonconvex Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/0-387-30065-1_16","volume-title":"Large-Scale Nonlinear Optimization","author":"MJD Powell","year":"2006","unstructured":"Powell, M.J.D.: The NEWUOA software for unconstrained optimization without derivatives. In: Di Pillo, G., Roma, M. (eds.) Large-Scale Nonlinear Optimization. Nonconvex Optimization and Its Applications, vol. 83, pp. 255\u2013297. Springer, Boston (2006). https:\/\/doi.org\/10.1007\/0-387-30065-1_16"},{"key":"257_CR57","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1093\/imanum\/drm047","volume":"28","author":"MJD Powell","year":"2008","unstructured":"Powell, M.J.D.: Developments of NEWUOA for minimization without derivatives. IMA J. Numer. Anal. 28, 649\u2013664 (2008). https:\/\/doi.org\/10.1093\/imanum\/drm047","journal-title":"IMA J. Numer. Anal."},{"key":"257_CR58","unstructured":"Powell, M.J.D.: The BOBYQA algorithm for bound constrained optimization without derivatives. Technical Report DAMTP 2009\/NA06, Department of Applied Mathematics and Theoretical Physics, University of Cambridge, Cambridge, UK (2009)"},{"key":"257_CR59","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s10589-012-9483-x","volume":"53","author":"MJD Powell","year":"2012","unstructured":"Powell, M.J.D.: On the convergence of trust region algorithms for unconstrained minimization without derivatives. Comput. Optim. Appl. 53, 527\u2013555 (2012). https:\/\/doi.org\/10.1007\/s10589-012-9483-x","journal-title":"Comput. Optim. Appl."},{"key":"257_CR60","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10107-011-0510-y","volume":"138","author":"MJD Powell","year":"2013","unstructured":"Powell, M.J.D.: Beyond symmetric Broyden for updating quadratic models in minimization without derivatives. Math. Program. 138, 475\u2013500 (2013). https:\/\/doi.org\/10.1007\/s10107-011-0510-y","journal-title":"Math. Program."},{"key":"257_CR61","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s12532-015-0084-4","volume":"7","author":"MJD Powell","year":"2015","unstructured":"Powell, M.J.D.: On fast trust region methods for quadratic models with linear constraints. Math. Program. Comput. 7, 237\u2013267 (2015). https:\/\/doi.org\/10.1007\/s12532-015-0084-4","journal-title":"Math. Program. Comput."},{"key":"257_CR62","unstructured":"Ragonneau, T.M.: Model-based derivative-free optimization methods and software. Ph.D. thesis, Department of Applied Mathematics, The Hong Kong Polytechnic University, Hong Kong, China (2022). https:\/\/theses.lib.polyu.edu.hk\/handle\/200\/12294"},{"key":"257_CR63","doi-asserted-by":"publisher","unstructured":"Ragonneau, T.M., Zhang, Z.: An optimal interpolation set for model-based derivative-free optimization methods (2023). https:\/\/doi.org\/10.48550\/arXiv.2302.09992","DOI":"10.48550\/arXiv.2302.09992"},{"key":"257_CR64","unstructured":"Ragonneau, T.M., Zhang, Z.: COBYQA: Constrained Optimization BY Quadratic Approximations (2024). https:\/\/www.cobyqa.com"},{"key":"257_CR65","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1080\/10556788.2016.1226305","volume":"32","author":"RG Regis","year":"2017","unstructured":"Regis, R.G., Wild, S.M.: CONORBIT: constrained optimization by radial basis function interpolation in trust regions. Optim. Methods Softw. 32, 552\u2013580 (2017). https:\/\/doi.org\/10.1080\/10556788.2016.1226305","journal-title":"Optim. Methods Softw."},{"key":"257_CR66","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1007\/s10898-012-9951-y","volume":"56","author":"LM Rios","year":"2013","unstructured":"Rios, L.M., Sahinidis, N.V.: Derivative-free optimization: a review of algorithms and comparison of software implementations. J. Global Optim. 56, 1247\u20131293 (2013). https:\/\/doi.org\/10.1007\/s10898-012-9951-y","journal-title":"J. Global Optim."},{"key":"257_CR67","doi-asserted-by":"publisher","first-page":"A2302","DOI":"10.1137\/21M1452470","volume":"44","author":"HJM Shi","year":"2022","unstructured":"Shi, H.J.M., Xie, Y., Xuan, M.Q., Nocedal, J.: Adaptive finite-difference interval estimation for noisy derivative-free optimization. SIAM J. Sci. Comput. 44, A2302\u2013A2321 (2022). https:\/\/doi.org\/10.1137\/21M1452470","journal-title":"SIAM J. Sci. Comput."},{"key":"257_CR68","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1080\/10556788.2022.2121832","volume":"38","author":"HJM Shi","year":"2023","unstructured":"Shi, H.J.M., Xuan, M.Q., Oztoprak, F., Nocedal, J.: On the numerical performance of derivative-free optimization methods based on finite-difference approximations. Optim. Methods Softw. 38, 289\u2013311 (2023). https:\/\/doi.org\/10.1080\/10556788.2022.2121832","journal-title":"Optim. Methods Softw."},{"key":"257_CR69","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1137\/0720042","volume":"20","author":"T Steihaug","year":"1983","unstructured":"Steihaug, T.: The conjugate gradient method and trust regions in large scale optimization. IMA J. Numer. Anal. 20, 626\u2013637 (1983). https:\/\/doi.org\/10.1137\/0720042","journal-title":"IMA J. Numer. Anal."},{"key":"257_CR70","first-page":"57","volume-title":"Sparse Matrices and Their Uses","author":"PhL Toint","year":"1981","unstructured":"Toint, Ph.L.: Towards an efficient sparsity exploiting Newton method for minimization. In: Duff, I.S. (ed.) Sparse Matrices and Their Uses, pp. 57\u201388. Academic Press, New York (1981)"},{"key":"257_CR71","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S1052623493250780","volume":"7","author":"V Torczon","year":"1997","unstructured":"Torczon, V.: On the convergence of pattern search algorithms. SIAM J. Optim. 7, 1\u201325 (1997). https:\/\/doi.org\/10.1137\/S1052623493250780","journal-title":"SIAM J. Optim."},{"key":"257_CR72","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s13675-012-0003-7","volume":"1","author":"LN Vicente","year":"2013","unstructured":"Vicente, L.N.: Worst case complexity of direct search. EURO J. Comput. 1, 143\u2013153 (2013). https:\/\/doi.org\/10.1007\/s13675-012-0003-7","journal-title":"EURO J. Comput."},{"key":"257_CR73","unstructured":"Wild, S.M.: MNH: a derivative-free optimization algorithm using minimal norm Hessians. In: The Tenth Copper Mountain Conference on Iterative Methods (2008)"},{"key":"257_CR74","doi-asserted-by":"publisher","first-page":"3197","DOI":"10.1137\/070691814","volume":"30","author":"SM Wild","year":"2008","unstructured":"Wild, S.M., Regis, R.G., Shoemaker, C.A.: ORBIT: optimization by radial basis function interpolation in trust-regions. SIAM J. Sci. Comput. 30, 3197\u20133219 (2008). https:\/\/doi.org\/10.1137\/070691814","journal-title":"SIAM J. Sci. Comput."},{"key":"257_CR75","doi-asserted-by":"publisher","unstructured":"Xie, P., Yuan, Y.: Least $$H^2$$ norm updating quadratic interpolation model function for derivative-free trust-region algorithms (2023). https:\/\/doi.org\/10.48550\/arXiv.2302.12017","DOI":"10.48550\/arXiv.2302.12017"},{"key":"257_CR76","doi-asserted-by":"publisher","first-page":"3555","DOI":"10.1137\/09075531X","volume":"20","author":"H Zhang","year":"2010","unstructured":"Zhang, H., Conn, A.R., Scheinberg, K.: A derivative-free algorithm for least-squares minimization. SIAM J. Optim. 20, 3555\u20133576 (2010). https:\/\/doi.org\/10.1137\/09075531X","journal-title":"SIAM J. Optim."},{"key":"257_CR77","unstructured":"Zhang, Z.: On derivative-free optimization methods (in Chinese). Ph.D. thesis, Chinese Academy of Sciences, Beijing, China (2012)"},{"key":"257_CR78","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10107-013-0679-3","volume":"146","author":"Z Zhang","year":"2014","unstructured":"Zhang, Z.: Sobolev seminorm of quadratic functions with applications to derivative-free optimization. Math. Program. 146, 77\u201396 (2014). https:\/\/doi.org\/10.1007\/s10107-013-0679-3","journal-title":"Math. Program."},{"key":"257_CR79","unstructured":"Zhang, Z.: PRIMA: Reference Implementation for Powell\u2019s methods with Modernization and Amelioration (2024). http:\/\/www.libprima.net"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-024-00257-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-024-00257-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-024-00257-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T14:14:43Z","timestamp":1730988883000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-024-00257-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,12]]},"references-count":79,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["257"],"URL":"https:\/\/doi.org\/10.1007\/s12532-024-00257-9","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,12]]},"assertion":[{"value":"27 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}