{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T19:40:01Z","timestamp":1745696401760,"version":"3.40.4"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T00:00:00Z","timestamp":1743206400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T00:00:00Z","timestamp":1743206400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371307"],"award-info":[{"award-number":["12371307"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003399","name":"Science and Technology Commission of Shanghai Municipality","doi-asserted-by":"publisher","award":["22YF1412400"],"award-info":[{"award-number":["22YF1412400"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s10915-025-02878-1","type":"journal-article","created":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T02:41:28Z","timestamp":1744080088000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Derivative-Free Regularized Primal-Dual Interior-Point Algorithm for Constrained Nonlinear Least Squares Problems"],"prefix":"10.1007","volume":"103","author":[{"given":"Xi","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinyan","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,29]]},"reference":[{"key":"2878_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)","journal-title":"Oper. Res. Lett."},{"key":"2878_CR2","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1137\/070692662","volume":"20","author":"C Audet","year":"2009","unstructured":"Audet, C., Dennis, J.E.: A progressive barrier for derivative-free nonlinear programming. SIAM J. Optim. 20, 445\u2013472 (2009)","journal-title":"SIAM J. Optim."},{"key":"2878_CR3","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, Cham (2017)"},{"key":"2878_CR4","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1137\/040620886","volume":"17","author":"C Audet","year":"2006","unstructured":"Audet, C., Orban, D.: Finding optimal algorithmic parameters using derivative-free optimization. SIAM J. Optim. 17, 642\u2013664 (2006)","journal-title":"SIAM J. Optim."},{"key":"2878_CR5","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1080\/10556788.2012.668905","volume":"28","author":"P Armand","year":"2012","unstructured":"Armand, P., Benoist, J., Orban, D.: From global to local convergence of interior methods for nonlinear optimization. Optimiz. Methods Softw. 28, 1051\u20131080 (2012)","journal-title":"Optimiz. Methods Softw."},{"key":"2878_CR6","doi-asserted-by":"publisher","first-page":"1613","DOI":"10.1137\/16M1088570","volume":"28","author":"S Arreckx","year":"2016","unstructured":"Arreckx, S., Orban, D.: A Regularized Factorization-Free Method for Equality-Constrained Optimization. SIAM J. Optim. 28, 1613\u20131639 (2016)","journal-title":"SIAM J. Optim."},{"key":"2878_CR7","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01404679","volume":"18","author":"KM Brown","year":"1971","unstructured":"Brown, K.M., Denneis, J.E., Jr.: Derivative free analogues of the Levenberg-Marquardt and Gauss algorithms for nonlinear least squares approximation. Numer. Math. 18, 289\u2013297 (1971)","journal-title":"Numer. Math."},{"key":"2878_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/PL00011391","volume":"89","author":"RH Byrd","year":"2000","unstructured":"Byrd, R.H., Gilbert, J.C., Nocedal, J.: A trust region method based on interior point techniques for nonlinear programming. Math. Program., Series B 89, 149\u2013185 (2000)","journal-title":"Math. Program., Series B"},{"key":"2878_CR9","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/s12532-019-00161-7","volume":"11","author":"C Cartis","year":"2019","unstructured":"Cartis, C., Roberts, L.: A derivative-free Gauss-Newton method. Math. Program. Comput. 11, 631\u2013674 (2019)","journal-title":"Math. Program. Comput."},{"key":"2878_CR10","doi-asserted-by":"publisher","first-page":"1","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, 1\u201341 (2019)","journal-title":"ACM Trans. Math. Softw."},{"key":"2878_CR11","doi-asserted-by":"publisher","first-page":"3447","DOI":"10.1137\/090747634","volume":"32","author":"FE Curtis","year":"2010","unstructured":"Curtis, F.E., Schenk, O., W\u00e4chter, A.: An interior-point algorithm for large-scale nonlinear optimization with inexact step computations. SIAM J. Sci. Comput. 32, 3447\u20133475 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"2878_CR12","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10107-012-0557-4","volume":"136","author":"FE Curtis","year":"2012","unstructured":"Curtis, F.E., Huber, J., Schenk, O., W\u00e4chter, A.: A note on the implementation of an interior-point algorithm for nonlinear optimization with inexact step computations. Math. Program. 136, 209\u2013227 (2012)","journal-title":"Math. Program."},{"key":"2878_CR13","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1080\/10556788.2024.2329588","volume":"39","author":"FE Curtis","year":"2024","unstructured":"Curtis, F.E., Dezfulian, S., W\u00e4chter, A.: Derivative-free bound-constrained optimization for solving structured problems with surrogate models. Optimiz. Method. Softw. 39, 845\u2013873 (2024)","journal-title":"Optimiz. Method. Softw."},{"key":"2878_CR14","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10915-024-02649-4","volume":"100","author":"X Chen","year":"2024","unstructured":"Chen, X., Fan, J.Y.: On the global complexity of a derivative-free Levenberg-Marquardt algorithm via orthogonal spherical smoothing. J. Sci. Comput. 100, 85 (2024)","journal-title":"J. Sci. Comput."},{"doi-asserted-by":"crossref","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to Derivative-Free Optimization. MPS-SIAM Series on Optimization, SIAM, Philadelphia (2009)","key":"2878_CR15","DOI":"10.1137\/1.9780898718768"},{"key":"2878_CR16","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s10898-017-0596-8","volume":"71","author":"MFP Costa","year":"2018","unstructured":"Costa, M.F.P., Rocha, A.M.A.C., Fernandes, E.M.G.P.: Filter-based DIRECT method for constrained global optimization. J. Global Optim. 71, 517\u2013536 (2018)","journal-title":"J. Global Optim."},{"key":"2878_CR17","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1137\/S1052623496305560","volume":"8","author":"A Forsgren","year":"1998","unstructured":"Forsgren, A., Gill, P.E.: Primal-dual interior methods for nonconvex nonlinear programming. SIAM J. Optim. 8, 1132\u20131152 (1998)","journal-title":"SIAM J. Optim."},{"key":"2878_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3699956","volume":"50","author":"D Ge","year":"2024","unstructured":"Ge, D., Liu, T., Liu, J., Tan, J., Ye, Y.: Algorithm 1053: SOLNP+: a derivative-free solver for constrained nonlinear optimization. ACM Trans. Math. Softw. 50, 1\u201324 (2024)","journal-title":"ACM Trans. Math. Softw."},{"key":"2878_CR19","doi-asserted-by":"publisher","first-page":"101459","DOI":"10.1016\/j.jco.2020.101459","volume":"58","author":"MLN Gon\u00e7alves","year":"2020","unstructured":"Gon\u00e7alves, M.L.N., Menezes, T.C.: Gauss-Newton methods with approximate projections for solving constrained nonlinear least squares problems. J. Complex. 58, 101459 (2020)","journal-title":"J. Complex."},{"key":"2878_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-48320-2","volume-title":"Test Examples for Nonlinear Programming Codes","author":"W Hock","year":"1981","unstructured":"Hock, W., Schittkowski, K.: Test Examples for Nonlinear Programming Codes. Springer, Berlin, Heidelberg (1981)"},{"key":"2878_CR21","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)","journal-title":"SIAM J. Optim."},{"key":"2878_CR22","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1007\/s10107-022-01866-9","volume":"199","author":"D Kozak","year":"2023","unstructured":"Kozak, D., Molinari, C., Rosasco, L., Tenorio, L., Villa, S.: Zeroth-order optimization with orthogonal random directions. Math. Program. 199, 1179\u20131219 (2023)","journal-title":"Math. Program."},{"key":"2878_CR23","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)","journal-title":"Acta Numer."},{"unstructured":"Luk\u030csan, V., Vl\u010dek, J.: Sparse and partially separable test problems for unconstrained and equality constrained optimization, Institute of Computer Science, Academy of Sciences of the Czech Republic, Technical Report 767 (1999)","key":"2878_CR24"},{"unstructured":"Luk\u0161an, L., Vl\u010dek, J., Matonoha, C.: Problems for nonlinear least squares and nonlinear equations, Institute of Computer Science, Academy of Sciences of the Czech Republic, Technical Report 1259 (2018)","key":"2878_CR25"},{"key":"2878_CR26","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)","journal-title":"SIAM J. Optim."},{"key":"2878_CR27","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1287\/ijoo.2022.0085","volume":"5","author":"A Nguyen","year":"2023","unstructured":"Nguyen, A., Balasubramanian, K.: Stochastic zeroth-order functional constrained optimization: oracle complexity and applications. INFORMS J. Optim. 5, 256\u2013272 (2023)","journal-title":"INFORMS J. Optim."},{"key":"2878_CR28","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, New York, NY (2006)","edition":"2"},{"issue":"1","key":"2878_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1166\/jcies.2012.1001","volume":"1","author":"N Mahdavi-Amiri","year":"2012","unstructured":"Mahdavi-Amiri, N., Bidabadi, N.: Constrained nonlinear least squares: a superlinearly convergent projected structured secant method. Int. J. Electr. Comput. Syst. 1(1), 1\u20138 (2012)","journal-title":"Int. J. Electr. Comput. Syst."},{"key":"2878_CR30","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1007\/s10589-020-00201-2","volume":"76","author":"D Orban","year":"2020","unstructured":"Orban, D., Siqueira, A.S.: A regularization method for constrained nonlinear least squares. Comput. Optim. Appl. 76, 961\u2013989 (2020)","journal-title":"Comput. Optim. Appl."},{"key":"2878_CR31","first-page":"51","volume-title":"A direct search optimization method that models the objective and constraint functions by linear interpolation","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, pp. 51\u201367. Springer, Dordrecht (1994)"},{"key":"2878_CR32","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)","journal-title":"Math. Program. Comput."},{"key":"2878_CR33","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.cam.2017.11.001","volume":"334","author":"S Qiu","year":"2018","unstructured":"Qiu, S., Chen, Z.: An interior point method for nonlinear optimization with a quasi-tangential subproblem. J. Comput. Appl. Math. 334, 77\u201396 (2018)","journal-title":"J. Comput. Appl. Math."},{"key":"2878_CR34","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s12532-024-00257-9","volume":"16","author":"TM Ragonneau","year":"2024","unstructured":"Ragonneau, T.M., Zhang, Z.: PDFO: a cross-platform package for Powell\u2019s derivative-free optimization solvers. Math. Program. Comput. 16, 535\u2013559 (2024)","journal-title":"Math. Program. Comput."},{"key":"2878_CR35","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/s40314-021-01562-y","volume":"40","author":"PR Sampaio","year":"2021","unstructured":"Sampaio, P.R.: DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems. Comput. Appl. Math. 40, 176 (2021)","journal-title":"Comput. Appl. Math."},{"doi-asserted-by":"crossref","unstructured":"Schittkowski, K: More Test Examples for Nonlinear Programming Codes, Berlin, Berlin (1987)","key":"2878_CR36","DOI":"10.1007\/978-3-642-61582-5"},{"doi-asserted-by":"crossref","unstructured":"Schittkowski, K: Solving constrained nonlinear least squares problems by a general purpose SQP-method, Trends in Mathematical Optimization, Birkh\u00e4user Basel, Basel, pp. 295\u2013309 (1988)","key":"2878_CR37","DOI":"10.1007\/978-3-0348-9297-1_19"},{"key":"2878_CR38","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s11590-014-0830-y","volume":"10","author":"A Tr\u00f6ltzsch","year":"2016","unstructured":"Tr\u00f6ltzsch, A.: A sequential quadratic programming algorithm for equality-constrained optimization without derivatives. Optimiz. Lett. 10, 383\u2013399 (2016)","journal-title":"Optimiz. Lett."},{"unstructured":"Vanderbei, R.J.: LOQO User\u2019s Guide - Version 4.05, Princeton University, School of Engineering and Applied Science, Department of Operations Research and Financial Engineering, Princeton, New Jersey (2006)","key":"2878_CR39"},{"key":"2878_CR40","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Math. Program. 106, 25\u201357 (2006)","journal-title":"Math. Program."},{"key":"2878_CR41","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/BF02592190","volume":"75","author":"H Yamashita","year":"1996","unstructured":"Yamashita, H., Yabe, H.: Superlinear and quadratic convergence of some primal-dual interior point methods for constrained optimization. Math. Program. 75, 377\u2013397 (1996)","journal-title":"Math. Program."},{"key":"2878_CR42","doi-asserted-by":"publisher","first-page":"355","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, 355\u2013357 (2010)","journal-title":"SIAM J. Optim."},{"key":"2878_CR43","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10589-022-00393-9","volume":"83","author":"R Zhao","year":"2022","unstructured":"Zhao, R., Fan, J.: Levenberg-Marquardt method based on probabilistic Jacobian models for nonlinear equations. Comput. Optim. Appl. 83, 381\u2013401 (2022)","journal-title":"Comput. Optim. Appl."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02878-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-025-02878-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02878-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T19:10:40Z","timestamp":1745694640000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-025-02878-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,29]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["2878"],"URL":"https:\/\/doi.org\/10.1007\/s10915-025-02878-1","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2025,3,29]]},"assertion":[{"value":"15 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"48"}}