{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:39:42Z","timestamp":1740123582168,"version":"3.37.3"},"reference-count":90,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T00:00:00Z","timestamp":1709596800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T00:00:00Z","timestamp":1709596800000},"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":["61876199"],"award-info":[{"award-number":["61876199"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003816","name":"Huawei Technologies","doi-asserted-by":"publisher","award":["YBWL2011085"],"award-info":[{"award-number":["YBWL2011085"]}],"id":[{"id":"10.13039\/501100003816","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":[[2024,4]]},"DOI":"10.1007\/s10915-024-02476-7","type":"journal-article","created":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T15:02:33Z","timestamp":1709650953000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Regularization Continuation Method for Optimization Problems with Nonlinear Equality Constraints"],"prefix":"10.1007","volume":"99","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4924-6007","authenticated-orcid":false,"given":"Xin-long","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hang","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,5]]},"reference":[{"key":"2476_CR1","first-page":"147","volume":"10","author":"N Andrei","year":"2008","unstructured":"Andrei, N.: An unconstrained optimization test functions collection. Adv. Model Optim. 10, 147\u2013161 (2008)","journal-title":"Adv. Model Optim."},{"key":"2476_CR2","unstructured":"Adorio, E.P., Diliman, U.P.: MVF\u2014Multivariate test functions library in C for unconstrained global optimization, http:\/\/www.geocities.ws\/eadorio\/mvf.pdf (2005)"},{"key":"2476_CR3","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719154","volume-title":"Introduction to Numerical Continuation Methods","author":"EL Allgower","year":"2003","unstructured":"Allgower, E.L., Georg, K.: Introduction to Numerical Continuation Methods. SIAM, Philadelphia (2003)"},{"key":"2476_CR4","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971392","volume-title":"Computer Methods for Ordinary Differential Equations and Differential-Algebraic Equations","author":"UM Ascher","year":"1998","unstructured":"Ascher, U.M., Petzold, L.R.: Computer Methods for Ordinary Differential Equations and Differential-Algebraic Equations. SIAM, Philadelphia (1998)"},{"key":"2476_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0962492900002518","volume":"4","author":"PT Boggs","year":"1995","unstructured":"Boggs, P.T., Tolle, J.W.: Sequential quadratic programming. Acta Numer. 4, 1\u201351 (1995)","journal-title":"Acta Numer."},{"key":"2476_CR6","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1093\/imamat\/6.1.76","volume":"6","author":"CG Broyden","year":"1970","unstructured":"Broyden, C.G.: The convergence of a class of double-rank minimization algorithms. J. Inst. Math. Appl. 6, 76\u201390 (1970)","journal-title":"J. Inst. Math. Appl."},{"key":"2476_CR7","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/BF00939812","volume":"62","author":"AA Brown","year":"1989","unstructured":"Brown, A.A., Bartholomew-Biggs, M.C.: ODE versus SQP methods for constrained optimization. J. Optim. Theory Appl. 62, 371\u2013386 (1989)","journal-title":"J. Optim. Theory Appl."},{"key":"2476_CR8","volume-title":"Numerical Solution of Initial-Value Problems in Differential-Algebraic Equations","author":"KE Brenan","year":"1996","unstructured":"Brenan, K.E., Campbell, S.L., Petzold, L.R.: Numerical Solution of Initial-Value Problems in Differential-Algebraic Equations. SIAM, Philadelphia (1996)"},{"key":"2476_CR9","doi-asserted-by":"crossref","unstructured":"Bioucas-Dias, J.M., Figueiredo, M.A.T.: Alternating direction algorithms for constrained sparse regression: application to hyperspectral unmixing. In: 2010 2nd Workshop on Hyperspectral Image and Signal Processing: Evolution in Remote Sensing, 1\u20134, http:\/\/doi.org\/10.1109\/WHISPERS.2010.5594963 (2010)","DOI":"10.1109\/WHISPERS.2010.5594963"},{"key":"2476_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0168-9274(97)00109-8","volume":"27","author":"JC Butcher","year":"1998","unstructured":"Butcher, J.C., Jackiewicz, Z.: Construction of high order diagonally implicit multistage integration methods for ordinary differential equations. Appl. Numer. Math. 27, 1\u201312 (1998)","journal-title":"Appl. Numer. Math."},{"key":"2476_CR11","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1137\/0724077","volume":"24","author":"R Byrd","year":"1987","unstructured":"Byrd, R., Nocedal, J., Yuan, Y.X.: Global convergence of a class of quasi-Newton methods on convex problems. SIAM J. Numer. Anal. 24, 1171\u20131189 (1987)","journal-title":"SIAM J. Numer. Anal."},{"key":"2476_CR12","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s10846-008-9257-y","volume":"54","author":"F Caballero","year":"2009","unstructured":"Caballero, F., Merino, L., Ferruz, J., Ollero, A.: Vision-based odometry and SLAM for medium and high altitude flying UAVs. J. Intell. Robot. Syst. 54, 137\u2013161 (2009)","journal-title":"J. Intell. Robot. Syst."},{"key":"2476_CR13","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1137\/S106482750241044X","volume":"25","author":"TS Coffey","year":"2003","unstructured":"Coffey, T.S., Kelley, C.T., Keyes, D.E.: Pseudotransient continuation and differential-algebraic equations. SIAM J. Sci. Comput. 25, 553\u2013569 (2003)","journal-title":"SIAM J. Sci. Comput."},{"key":"2476_CR14","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-Region Methods","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N., Toint, Ph.L.: Trust-Region Methods. SIAM, Philadelphia (2000)"},{"key":"2476_CR15","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1137\/100802955","volume":"10","author":"MT Chu","year":"2011","unstructured":"Chu, M.T., Lin, M.M.: Dynamical system characterization of the central path and its variants-a revisit. SIAM J. Appl. Dyn. Syst. 10, 887\u2013905 (2011)","journal-title":"SIAM J. Appl. Dyn. Syst."},{"key":"2476_CR16","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1137\/050645506","volume":"49","author":"A d\u2019Aspremont","year":"2007","unstructured":"d\u2019Aspremont, A., El Ghaoui, L., Jordan, M., Lanckriet, G.R.: A direct formulation for sparse PCA using semidefinite programming. SIAM Rev. 49, 434\u2013448 (2007)","journal-title":"SIAM Rev."},{"key":"2476_CR17","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program 91, 201\u2013213 (2002)","journal-title":"Math. Program"},{"key":"2476_CR18","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/S0895479895290954","volume":"20","author":"A Edelman","year":"1999","unstructured":"Edelman, A., Arias, T.A., Smith, S.T.: The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl. 20, 303\u2013353 (1999)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2476_CR19","doi-asserted-by":"crossref","unstructured":"Fiacco, A.V., McCormick, G.P.: Nonlinear Programming: Sequential Unconstrained Minimization Techniques, SIAM (1990)","DOI":"10.1137\/1.9781611971316"},{"key":"2476_CR20","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1093\/comjnl\/13.3.317","volume":"13","author":"R Fletcher","year":"1970","unstructured":"Fletcher, R.: A new approach to variable metric algorithms. Comput J 13, 317\u2013322 (1970)","journal-title":"Comput J"},{"key":"2476_CR21","doi-asserted-by":"crossref","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)","journal-title":"Comput J"},{"key":"2476_CR22","doi-asserted-by":"crossref","unstructured":"Fadili, J.M., Starck, J.L.: Monotone operator splitting for optimization problems in sparse recovery. In: IEEE ICIP, Cairo, Egypt, pp. 1461\u20131464, http:\/\/doi.org\/10.1109\/ICIP.2009.5414555 (2009)","DOI":"10.1109\/ICIP.2009.5414555"},{"key":"2476_CR23","doi-asserted-by":"crossref","first-page":"3133","DOI":"10.1109\/TIP.2010.2053941","volume":"19","author":"MAT Figueiredo","year":"2010","unstructured":"Figueiredo, M.A.T., Bioucas-Dias, J.M.: Restoration of Poissonian images using alternating direction optimization. IEEE Trans. Image Process. 19, 3133\u20133145 (2010)","journal-title":"IEEE Trans. Image Process."},{"key":"2476_CR24","first-page":"1663","volume":"11","author":"PA Forero","year":"2010","unstructured":"Forero, P.A., Cano, A., Giannakis, G.B.: Consensus-based distributed support vector machines. J. Mach. Learn. Res. 11, 1663\u20131707 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"2476_CR25","unstructured":"GAMS v28.2, GAMS Corporation, https:\/\/www.gams.com\/ (2019)"},{"key":"2476_CR26","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/s10957-010-9765-3","volume":"148","author":"BS Goh","year":"2011","unstructured":"Goh, B.S.: Approximate greatest descent methods for optimization with equality constraints. J. Optim. Theory Appl. 148, 505\u2013527 (2011)","journal-title":"J. Optim. Theory Appl."},{"key":"2476_CR27","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1090\/S0025-5718-1970-0258249-6","volume":"24","author":"D Goldfarb","year":"1970","unstructured":"Goldfarb, D.: A family of variable metric updates derived by variational means. Math. Comput. 24, 23\u201326 (1970)","journal-title":"Math. Comput."},{"key":"2476_CR28","doi-asserted-by":"crossref","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)","DOI":"10.1007\/s10589-014-9687-3"},{"key":"2476_CR29","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944","volume-title":"Matrix Computations","author":"GH Golub","year":"2013","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 4th edn. The Johns Hopkins University Press, Baltimore (2013)","edition":"4"},{"key":"2476_CR30","volume-title":"Practical Optimization","author":"PE Gill","year":"1981","unstructured":"Gill, P.E., Murray, W., Wright, M.H.: Practical Optimization. Academic Press, London (1981)"},{"key":"2476_CR31","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/S0036144504446096","volume":"47","author":"PE Gill","year":"2005","unstructured":"Gill, P.E., Murray, W., Saunders, M.A.: SNOPT: an SQP algorithm for large-scale constrained optimization. SIAM Rev. 47, 99\u2013131 (2005)","journal-title":"SIAM Rev."},{"key":"2476_CR32","unstructured":"Gill, P.E., Murray, W., Saunders, M.A.: User\u2019s guide for SQOPT Version 7: software for large-scale linear and quadratic programming (2006)"},{"key":"2476_CR33","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00932858","volume":"22","author":"SP Han","year":"1977","unstructured":"Han, S.P.: A globally convergent method for nonlinear programming. J. Optim. Theory Appl. 22, 297\u2013307 (1977)","journal-title":"J. Optim. Theory Appl."},{"key":"2476_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02149761","volume":"6","author":"PC Hansen","year":"1994","unstructured":"Hansen, P.C.: Regularization tools: a MATLAB package for analysis and solution of discrete ill-posed problems. Numer Algorithms 6, 1\u201335 (1994)","journal-title":"Numer Algorithms"},{"key":"2476_CR35","volume-title":"Optimization and Dynamical Systems","author":"U Helmke","year":"1996","unstructured":"Helmke, U., Moore, J.B.: Optimization and Dynamical Systems, 2nd edn. Springer, London (1996)","edition":"2"},{"key":"2476_CR36","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1137\/S0036142998335972","volume":"37","author":"DJ Higham","year":"1999","unstructured":"Higham, D.J.: Trust region algorithms and timestep selection. SIAM J. Numer. Anal. 37, 194\u2013210 (1999)","journal-title":"SIAM J. Numer. Anal."},{"key":"2476_CR37","doi-asserted-by":"publisher","unstructured":"Hock, W., Schittkowski, K.: A comparative performance evaluation of 27 nonlinear programming codes. Computing 30, 335\u2013358 https:\/\/doi.org\/10.1007\/BF02242139 (1983)","DOI":"10.1007\/BF02242139"},{"key":"2476_CR38","doi-asserted-by":"crossref","first-page":"1390","DOI":"10.1137\/0732064","volume":"32","author":"Z Jackiewicz","year":"1995","unstructured":"Jackiewicz, Z., Tracogna, S.: A general class of two-step Runge\u2013Kutta methods for ordinary differential equations. SIAM J. Numer. Anal. 32, 1390\u20131427 (1995)","journal-title":"SIAM J. Numer. Anal."},{"key":"2476_CR39","doi-asserted-by":"crossref","first-page":"3071","DOI":"10.1137\/07069866X","volume":"46","author":"CT Kelley","year":"2008","unstructured":"Kelley, C.T., Liao, L.-Z., Qi, L., Chu, M.T., Reese, J.P., Winton, C.: Projected pseudotransient continuation. SIAM J. Numer. Anal. 46, 3071\u20133083 (2008)","journal-title":"SIAM J. Numer. Anal."},{"key":"2476_CR40","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10589-019-00109-6","volume":"74","author":"JH Lee","year":"2019","unstructured":"Lee, J.H., Jung, Y.M., Yuan, Y.X., Yun, S.: A subsapce SQP method for equality constrained optimization. Comput. Optim. Appl. 74, 177\u2013194 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"2476_CR41","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/BF02193101","volume":"81","author":"L Luk\u0161an","year":"1994","unstructured":"Luk\u0161an, L.: Inexact trust region method for large sparse systems of nonlinear equations. J. Optim. Theory Appl. 81, 569\u2013590 (1994)","journal-title":"J. Optim. Theory Appl."},{"key":"2476_CR42","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1090\/qam\/10666","volume":"2","author":"K Levenberg","year":"1944","unstructured":"Levenberg, K.: A method for the solution of certain problems in least squares. Q. Appl. Math. 2, 164\u2013168 (1944)","journal-title":"Q. Appl. Math."},{"key":"2476_CR43","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1023\/B:JOGO.0000015310.27011.02","volume":"28","author":"L-Z Liao","year":"2004","unstructured":"Liao, L.-Z., Qi, H.D., Qi, L.Q.: Neurodynamical optimization. J. Glob. Optim. 28, 175\u2013195 (2004)","journal-title":"J. Glob. Optim."},{"key":"2476_CR44","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1137\/080739884","volume":"21","author":"X-W Liu","year":"2011","unstructured":"Liu, X.-W., Yuan, Y.-Y.: A sequential quadratic programming method without a penalty function or a filter for nonlinear equality constrained optimization. SIAM J. Optim. 21, 545\u2013571 (2011)","journal-title":"SIAM J. Optim."},{"key":"2476_CR45","doi-asserted-by":"publisher","unstructured":"Lu, Z.S., Pong, K.K., Zhang, Y.: An alternating direction method for finding Dantzig selectors. Comput. Stat. Data Anal. 56, 4037\u20134046, https:\/\/doi.org\/10.1016\/j.csda.2012.04.019 (2012)","DOI":"10.1016\/j.csda.2012.04.019"},{"key":"2476_CR46","first-page":"153","volume":"23","author":"X-L Luo","year":"2005","unstructured":"Luo, X.-L.: Singly diagonally implicit Runge\u2013Kutta methods combining line search techniques for unconstrained optimization. J. Comput. Math. 23, 153\u2013164 (2005)","journal-title":"J. Comput. Math."},{"key":"2476_CR47","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1080\/10556780601079233","volume":"22","author":"X-L Luo","year":"2007","unstructured":"Luo, X.-L., Liao, L.-Z., Tam, H.-W.: Convergence analysis of the Levenberg\u2013Marquardt method. Optim. Methds Softw. 22, 659\u2013678 (2007)","journal-title":"Optim. Methds Softw."},{"key":"2476_CR48","doi-asserted-by":"crossref","first-page":"1851","DOI":"10.1016\/j.laa.2009.12.023","volume":"432","author":"S-T Liu","year":"2010","unstructured":"Liu, S.-T., Luo, X.-L.: A method based on Rayleigh quotient gradient flow for extreme and interior eigenvalue problems. Linear Algebra Appl. 432, 1851\u20131863 (2010)","journal-title":"Linear Algebra Appl."},{"key":"2476_CR49","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.jocs.2012.01.002","volume":"3","author":"X-L Luo","year":"2012","unstructured":"Luo, X.-L.: A dynamical method of DAEs for the smallest eigenvalue problem. J. Comput. Sci. 3, 113\u2013119 (2012)","journal-title":"J. Comput. Sci."},{"key":"2476_CR50","doi-asserted-by":"crossref","unstructured":"Luo, X.-L., Lin, J.-R., Wu, W.-L.: A prediction-correction dynamic method for large-scale generalized eigenvalue problems. Abstr Appl Anal (2013), Article ID 845459, 1\u20138, http:\/\/dx.doi.org\/10.1155\/2013\/845459","DOI":"10.1155\/2013\/845459"},{"key":"2476_CR51","doi-asserted-by":"publisher","unstructured":"Luo, X.-L., Lv, J.-H., Sun, G.: Continuation methods with the trusty time-stepping scheme for linearly constrained optimization with noisy data. Optim. Eng. 23, 329\u2013360, https:\/\/doi.org\/10.1007\/s11081-020-09590-z (2022)","DOI":"10.1007\/s11081-020-09590-z"},{"key":"2476_CR52","doi-asserted-by":"publisher","unstructured":"Luo, X.-L., Xiao, H., Lv, J.-H.: Continuation Newton methods with the residual trust-region time-stepping scheme for nonlinear equations. Numer Algorithms 89, 223\u2013247, https:\/\/doi.org\/10.1007\/s11075-021-01112-x (2022)","DOI":"10.1007\/s11075-021-01112-x"},{"key":"2476_CR53","doi-asserted-by":"publisher","unstructured":"Luo, X.-L., Yao, Y.-Y.: Primal-dual path-following methods and the trust-region updating strategy for linear programming with noisy data. J. Comput. Math. 40, 760\u2013780, https:\/\/doi.org\/10.4208\/jcm.2101-m2020-0173 (2022)","DOI":"10.4208\/jcm.2101-m2020-0173"},{"key":"2476_CR54","doi-asserted-by":"publisher","unstructured":"Luo, X.-L., Xiao, H., Lv, J.-H., Zhang, S.: Explicit pseudo-transient continuation and the trust-region updating strategy for unconstrained optimization. Appl. Numer. Math. 165, 290\u2013302, https:\/\/doi.org\/10.1016\/j.apnum.2021.02.019 (2021)","DOI":"10.1016\/j.apnum.2021.02.019"},{"key":"2476_CR55","doi-asserted-by":"publisher","unstructured":"Luo, X.-L., Xiao, H.: Generalized continuation Newton methods and the trust-region updating strategy for the underdetermined system. J. Sci. Comput. 88, article 56, pp. 1\u201322. https:\/\/doi.org\/10.1007\/s10915-021-01566-0 (2021)","DOI":"10.1007\/s10915-021-01566-0"},{"key":"2476_CR56","doi-asserted-by":"publisher","unstructured":"Luo, X.-L., Xiao, H.: The regularization continuation method with an adaptive time step control for linearly constrained optimization problems. Appl. Numer. Math. 181, 255\u2013276, published online at https:\/\/doi.org\/10.1016\/j.apnum.2022.06.008 (2022)","DOI":"10.1016\/j.apnum.2022.06.008"},{"key":"2476_CR57","unstructured":"Luo, X.-L., Xiao, H., Zhang, S.: Continuation Newton methods with deflation techniques for global optimization problems, arXiv preprint available at http:\/\/arxiv.org\/abs\/2107.13864, or Research Square preprint available at https:\/\/doi.org\/10.21203\/rs.3.rs-1102775\/v1, July 30, 2021. Software available at https:\/\/teacher.bupt.edu.cn\/luoxinlong\/zh_CN\/zzcg\/41406\/list\/index.htm"},{"key":"2476_CR58","unstructured":"Luo, X.-L., Zhang, S., Xiao, H.: Residual regularization path-following methods for linear complementarity problems, arXiv preprint available at http:\/\/arxiv.org\/abs\/2205.10727, pp. 1\u201330 (2022)"},{"key":"2476_CR59","doi-asserted-by":"publisher","unstructured":"Ng, M., Weiss, P. Yuan, X.-M.: Solving constrained total-variation image restoration and reconstruction problems via alternating direction methods. SIAM. J. Sci. Comput. 32, 2710\u20132736, https:\/\/doi.org\/10.1137\/090774823 (2010)","DOI":"10.1137\/090774823"},{"key":"2476_CR60","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0421-7","volume":"99","author":"MF Mascarenhas","year":"2004","unstructured":"Mascarenhas, M.F.: The BFGS method with exact line searches fails for non-convex objective functions. Math. Program 99, 49\u201361 (2004)","journal-title":"Math. Program"},{"key":"2476_CR61","unstructured":"Mak, M.-W.: Lecture notes of constrained optimization and support vector machines, http:\/\/www.eie.polyu.edu.hk\/~mwmak\/EIE6207\/ContOpt-SVM-beamer.pdf (2019)"},{"key":"2476_CR62","unstructured":"MATLAB v9.8.0 (R2020a), The MathWorks Inc., http:\/\/www.mathworks.com (2020)"},{"key":"2476_CR63","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"JJ Mor\u00e9","year":"1981","unstructured":"Mor\u00e9, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7, 17\u201341 (1981)","journal-title":"ACM Trans. Math. Softw."},{"key":"2476_CR64","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0111030","volume":"11","author":"D Marquardt","year":"1963","unstructured":"Marquardt, D.: An algorithm for least-squares estimation of nonlinear parameters. SIAM J. Appl. Math. 11, 431\u2013441 (1963)","journal-title":"SIAM J. Appl. Math."},{"key":"2476_CR65","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1023\/B:NUMA.0000021763.84725.b9","volume":"35","author":"N Maculan","year":"2004","unstructured":"Maculan, N., Lavor, C.: A function to test methods applied to global minimization of potential energy of molecules. Numer. Algorithms 35, 287\u2013300 (2004)","journal-title":"Numer. Algorithms"},{"key":"2476_CR66","first-page":"394","volume":"26","author":"EH Moore","year":"1920","unstructured":"Moore, E.H.: On the reciprocal of the general algebraic matrix. Bull. New Ser. Am. Math. Soc. 26, 394\u2013395 (1920)","journal-title":"Bull. New Ser. Am. Math. Soc."},{"key":"2476_CR67","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, Berlin (1999)"},{"key":"2476_CR68","unstructured":"Osborne, M.J.: Mathematical methods for economic theory, https:\/\/mjo.osborne.economics.utoronto.ca\/index.php\/tutorial\/index\/1\/mem (2016)"},{"key":"2476_CR69","first-page":"129","volume":"10","author":"P-Q Pan","year":"1992","unstructured":"Pan, P.-Q.: New ODE methods for equality constrained optimization (2): algorithms. J. Comput. Math. 10, 129\u2013146 (1992)","journal-title":"J. Comput. Math."},{"key":"2476_CR70","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1017\/S0305004100030401","volume":"51","author":"RA Penrose","year":"1955","unstructured":"Penrose, R.A.: Generalized inverses for matrices. Math. Proc. Camb. Philos. Soc. 51, 406\u2013413 (1955)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"2476_CR71","first-page":"1","volume-title":"Nonlinear Programming 2","author":"MJD Powell","year":"1975","unstructured":"Powell, M.J.D.: Convergence properties of a class of minimization algorithms. In: Mangasarian, O.L., Meyer, R.R., Robinson, S.M. (eds.) Nonlinear Programming 2, pp. 1\u201327. Academic Press, New York (1975)"},{"key":"2476_CR72","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/BFb0067703","volume-title":"Numerical Analysis","author":"MJD Powell","year":"1978","unstructured":"Powell, M.J.D.: A fast algorithm for nonlinearly constrained optimization calculations. In: Watson, G.A. (ed.) Numerical Analysis, pp. 144\u2013157. Springer, Berlin (1978)"},{"key":"2476_CR73","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/B978-0-12-468660-1.50007-4","volume-title":"Nonlinear Programming 3","author":"MJD Powell","year":"1978","unstructured":"Powell, M.J.D.: The convergence of variable metric methods for nonlinearly constrained optimization calculations. In: Mangasarian, O.L., Meyer, R.R., Robinson, S.M. (eds.) Nonlinear Programming 3, pp. 27\u201363. Academic Press, New York (1978)"},{"key":"2476_CR74","doi-asserted-by":"publisher","unstructured":"Schittkowski, K.: NLPQL: a fortran subroutine solving constrained nonlinear programming problems. Ann. Oper. Res. 5, 485\u2013500, https:\/\/doi.org\/10.1007\/BF02739235 (1986)","DOI":"10.1007\/BF02739235"},{"key":"2476_CR75","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1080\/01630560008816971","volume":"21","author":"J Schropp","year":"2000","unstructured":"Schropp, J.: A dynamical systems approach to constrained minimization. Numer. Funct. Anal. Optim. 21, 537\u2013551 (2000)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"2476_CR76","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/S0377-0427(02)00671-4","volume":"150","author":"J Schropp","year":"2003","unstructured":"Schropp, J.: One and multistep discretizations of index 2 differential algebraic systems and their use in optimization. J. Comput. Appl. Math. 150, 375\u2013396 (2003)","journal-title":"J. Comput. Appl. Math."},{"key":"2476_CR77","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511615542","volume-title":"Solving ODEs with MATLAB","author":"LF Shampine","year":"2003","unstructured":"Shampine, L.F., Gladwell, I., Thompson, S.: Solving ODEs with MATLAB. Cambridge University Press, Cambridge (2003)"},{"key":"2476_CR78","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1090\/S0025-5718-1970-0274029-X","volume":"24","author":"DF Shanno","year":"1970","unstructured":"Shanno, D.F.: Conditioning of quasi-Newton methods for function minimization. Math. Comput. 24, 647\u2013656 (1970)","journal-title":"Math. Comput."},{"key":"2476_CR79","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/s10851-009-0179-5","volume":"36","author":"G Steidl","year":"2010","unstructured":"Steidl, G., Teuber, T.: Removing multiplicative noise by Douglas\u2013Rachford splitting methods. J. Math. Imaging Vis. 36, 168\u2013184 (2010)","journal-title":"J. Math. Imaging Vis."},{"key":"2476_CR80","unstructured":"Surjanovic, S., Bingham, D.: Virtual library of simulation experiments: Test functions and datasets, retrieved from http:\/\/www.sfu.ca\/~ssurjano (2020)"},{"key":"2476_CR81","volume-title":"Optimization Theory and Methods: Nonlinear Programming","author":"WY Sun","year":"2006","unstructured":"Sun, W.Y., Yuan, Y.X.: Optimization Theory and Methods: Nonlinear Programming. Springer, New York (2006)"},{"key":"2476_CR82","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF00934495","volume":"30","author":"K Tanabe","year":"1980","unstructured":"Tanabe, K.: A geometric method in nonlinear programming. J. Optim. Theory Appl. 30, 181\u2013210 (1980)","journal-title":"J. Optim. Theory Appl."},{"key":"2476_CR83","first-page":"176","volume":"39","author":"AN Tikhonov","year":"1943","unstructured":"Tikhonov, A.N.: The stability of inverse problems. Dokl Akad Nauk SSRR 39, 176\u2013179 (1943)","journal-title":"Dokl Akad Nauk SSRR"},{"key":"2476_CR84","volume-title":"Solutions of Ill-Posed Problems","author":"AN Tikhonov","year":"1977","unstructured":"Tikhonov, A.N., Arsenin, V.Y.: Solutions of Ill-Posed Problems. Wiley, New York (1977)"},{"key":"2476_CR85","doi-asserted-by":"publisher","unstructured":"Vanderbei, R., Lin, K., Liu, H., Wang, L.: Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods. Math. Prog. Comput. 8, 253\u2013269, https:\/\/doi.org\/10.1007\/s12532-016-0105-y (2016)","DOI":"10.1007\/s12532-016-0105-y"},{"key":"2476_CR86","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10107-012-0584-1","volume":"142","author":"Z-W Wen","year":"2013","unstructured":"Wen, Z.-W., Yin, W.-T.: A feasible method for optimization with orthogonality constraints. Math. Program 142, 397\u2013434 (2013)","journal-title":"Math. Program"},{"key":"2476_CR87","unstructured":"Wilson, R.B.: A Simplicial Method for Convex Programming, Ph.D. thesis, Harvard University (1963)"},{"key":"2476_CR88","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1093\/biostatistics\/kxp008","volume":"10","author":"DM Witten","year":"2009","unstructured":"Witten, D.M., Tibshirani, R., Hastie, T.: A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis. Biostatistics 10, 515\u2013534 (2009)","journal-title":"Biostatistics"},{"key":"2476_CR89","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01588311","volume":"18","author":"H Yamashita","year":"1980","unstructured":"Yamashita, H.: A differential equation approach to nonlinear programming. Math. Program 18, 155\u2013168 (1980)","journal-title":"Math. Program"},{"key":"2476_CR90","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10107-015-0893-2","volume":"151","author":"Y Yuan","year":"2015","unstructured":"Yuan, Y.: Recent advances in trust region algorithms. Math. Program 151, 249\u2013281 (2015)","journal-title":"Math. Program"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02476-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-024-02476-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02476-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T18:08:20Z","timestamp":1711476500000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-024-02476-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,5]]},"references-count":90,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["2476"],"URL":"https:\/\/doi.org\/10.1007\/s10915-024-02476-7","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2024,3,5]]},"assertion":[{"value":"28 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}],"article-number":"17"}}