{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T17:04:48Z","timestamp":1749488688452,"version":"3.37.3"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,6,14]],"date-time":"2020-06-14T00:00:00Z","timestamp":1592092800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,14]],"date-time":"2020-06-14T00:00:00Z","timestamp":1592092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["299010-04"],"award-info":[{"award-number":["299010-04"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s10589-020-00201-2","type":"journal-article","created":{"date-parts":[[2020,6,14]],"date-time":"2020-06-14T16:02:10Z","timestamp":1592150530000},"page":"961-989","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A regularization method for constrained nonlinear least squares"],"prefix":"10.1007","volume":"76","author":[{"given":"Dominique","family":"Orban","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4451-281X","authenticated-orcid":false,"given":"Abel Soares","family":"Siqueira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,14]]},"reference":[{"issue":"1","key":"201_CR1","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1137\/15M1008488","volume":"26","author":"R Andreani","year":"2016","unstructured":"Andreani, R., Mart\u00ednez, J., Ramos, A., Silva, P.: A cone-continuity constraint qualification and algorithmic consequences. SIAM J. Optim. 26(1), 96\u2013110 (2016). https:\/\/doi.org\/10.1137\/15M1008488","journal-title":"SIAM J. Optim."},{"issue":"1","key":"201_CR2","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1080\/10556788.2014.909970","volume":"30","author":"MR Ansari","year":"2014","unstructured":"Ansari, M.R., Mahdavi-Amiri, N.: A robust combined trust region-line search exact penalty projected structured scheme for constrained nonlinear least squares. Optim. Methods Softw. 30(1), 162\u2013190 (2014). https:\/\/doi.org\/10.1080\/10556788.2014.909970","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"201_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10556788.2015.1025401","volume":"32","author":"P Armand","year":"2015","unstructured":"Armand, P., Omheni, R.: A globally and quadratically convergent primal-dual augmented Lagrangian algorithm for equality constrained optimization. Optim. Methods Softw. 32(1), 1\u201321 (2015). https:\/\/doi.org\/10.1080\/10556788.2015.1025401","journal-title":"Optim. Methods Softw."},{"issue":"5","key":"201_CR4","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1080\/10556788.2012.668905","volume":"28","author":"P Armand","year":"2013","unstructured":"Armand, P., Benoist, J., Orban, D.: From global to local convergence of interior methods for nonlinear optimization. Optim. Methods Softw. 28(5), 1051\u20131080 (2013). https:\/\/doi.org\/10.1080\/10556788.2012.668905","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"201_CR5","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10589-014-9679-3","volume":"59","author":"P Armand","year":"2014","unstructured":"Armand, P., Benoist, J., Omheni, R., Pateloup, V.: Study of a primal-dual algorithm for equality constrained minimization. Comput. Optim. Appl. 59(3), 405\u2013433 (2014). https:\/\/doi.org\/10.1007\/s10589-014-9679-3","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"201_CR6","doi-asserted-by":"publisher","first-page":"1613","DOI":"10.1137\/16M1088570","volume":"28","author":"S Arreckx","year":"2018","unstructured":"Arreckx, S., Orban, D.: A regularized factorization-free method for equality-constrained optimization. SIAM J. Optim. 28(2), 1613\u20131639 (2018). https:\/\/doi.org\/10.1137\/16M1088570","journal-title":"SIAM J. Optim."},{"issue":"1","key":"201_CR7","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF02192305","volume":"85","author":"MC Bartholomew-Biggs","year":"1995","unstructured":"Bartholomew-Biggs, M.C., Hernandez, M.D.F.G.: Using the KKT matrix in an augmented Lagrangian SQP method for sparse constrained optimization. J. Optim. Theory Appl. 85(1), 201\u2013220 (1995). https:\/\/doi.org\/10.1007\/BF02192305","journal-title":"J. Optim. Theory Appl."},{"key":"201_CR8","unstructured":"Bellavia, S., Gurioli, G., Morini, B., Toint, Ph.L.: Adaptive regularization algorithms with inexact evaluations for nonconvex optimization. Technical report, University of Namur, (2018). URL http:\/\/www.optimization-online.org\/DB_HTML\/2018\/11\/6919.html"},{"key":"201_CR9","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2017.1385073","author":"N Bidabadi","year":"2017","unstructured":"Bidabadi, N.: Using a spectral scaling structured BFGS method for constrained nonlinear least squares. Optim. Methods Softw. (2017). https:\/\/doi.org\/10.1080\/10556788.2017.1385073","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"201_CR10","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/s10957-013-0438-x","volume":"162","author":"N Bidabadi","year":"2013","unstructured":"Bidabadi, N., Mahdavi-Amiri, N.: Superlinearly convergent exact penalty methods with projected structured secant updates for constrained nonlinear least squares. J. Optim. Theory Appl. 162(1), 154\u2013190 (2013). https:\/\/doi.org\/10.1007\/s10957-013-0438-x","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"201_CR11","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1145\/1114268.1114277","volume":"31","author":"TA Davis","year":"2005","unstructured":"Davis, T.A.: Algorithm 849: a concise sparse Cholesky factorization package. ACM Trans. Math. Softw. 31(4), 587\u2013591 (2005). https:\/\/doi.org\/10.1145\/1114268.1114277","journal-title":"ACM Trans. Math. Softw."},{"key":"201_CR12","doi-asserted-by":"publisher","DOI":"10.1080\/03155986.2018.1559428","author":"M Dehghani","year":"2019","unstructured":"Dehghani, M., Lambe, A., Orban, D.: A regularized interior-point method for constrained linear least squares. INFOR: Inf. Syst. Oper. Res. (2019). https:\/\/doi.org\/10.1080\/03155986.2018.1559428","journal-title":"INFOR: Inf. Syst. Oper. Res."},{"issue":"3","key":"201_CR13","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/BF01397083","volume":"18","author":"TJ Dekker","year":"1971","unstructured":"Dekker, T.J.: A floating-point technique for extending the available precision. Numer. Math. 18(3), 224\u2013242 (1971). https:\/\/doi.org\/10.1007\/BF01397083","journal-title":"Numer. Math."},{"issue":"1","key":"201_CR14","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1137\/1019005","volume":"19","author":"JE Dennis","year":"1977","unstructured":"Dennis, J.E., Mor\u00e9, J.J.: Quasi-Newton methods, motivation and theory. SIAM Rev. 19(1), 46\u201389 (1977). https:\/\/doi.org\/10.1137\/1019005","journal-title":"SIAM Rev."},{"issue":"6","key":"201_CR15","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1137\/0718067","volume":"18","author":"JE Dennis","year":"1981","unstructured":"Dennis, J.E., Walker, H.F.: Convergence theorems for least-change secant update methods. SIAM J. Numer. Anal. 18(6), 949\u2013987 (1981)","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"201_CR16","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1145\/355958.355965","volume":"7","author":"JE Dennis Jr","year":"1981","unstructured":"Dennis Jr., J.E., Gay, D.M., Welsch, R.E.: An adaptive nonlinear least-squares algorithm. ACM Trans. Math. Softw. 7(3), 348\u2013368 (1981). https:\/\/doi.org\/10.1145\/355958.355965","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"201_CR17","doi-asserted-by":"publisher","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 profile. Math. Program. Ser. A 91(2), 201\u2013213 (2002). https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math. Program. Ser. A"},{"issue":"2","key":"201_CR18","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1145\/992200.992202","volume":"30","author":"IS Duff","year":"2004","unstructured":"Duff, I.S.: MA57\u2014a code for the solution of sparse symmetric definite and indefinite systems. ACM Trans. Math. Softw. 30(2), 118\u2013144 (2004). https:\/\/doi.org\/10.1145\/992200.992202","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"201_CR19","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1137\/15M1020575","volume":"59","author":"I Dunning","year":"2017","unstructured":"Dunning, I., Huchette, J., Lubin, M.: JuMP: a modeling language for mathematical optimization. SIAM Rev. 59(2), 295\u2013320 (2017). https:\/\/doi.org\/10.1137\/15M1020575","journal-title":"SIAM Rev."},{"issue":"1","key":"201_CR20","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/bf02578992","volume":"13","author":"M Fernanda","year":"2005","unstructured":"Fernanda, M., Costa, P., Fernandes, E.M.G.P.: A primal-dual interior-point algorithm for nonlinear least squares constrained problems. Top 13(1), 145\u2013166 (2005). https:\/\/doi.org\/10.1007\/bf02578992","journal-title":"Top"},{"issue":"3","key":"201_CR21","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1590\/0101-7438.2014.034.03.0463","volume":"34","author":"D Fern\u00e1ndez","year":"2014","unstructured":"Fern\u00e1ndez, D., Solodov, M.: Stabilized sequential quadratic programming: a survey. Pesq. Oper. 34(3), 463\u2013479 (2014). https:\/\/doi.org\/10.1590\/0101-7438.2014.034.03.0463","journal-title":"Pesq. Oper."},{"issue":"3","key":"201_CR22","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10589-012-9502-y","volume":"54","author":"D Fern\u00e1ndez","year":"2012","unstructured":"Fern\u00e1ndez, D., Pilotta, E.A., Torres, G.A.: An inexact restoration strategy for the globalization of the sSQP method. Comput. Optim. Appl. 54(3), 595\u2013617 (2012). https:\/\/doi.org\/10.1007\/s10589-012-9502-y","journal-title":"Comput. Optim. Appl."},{"issue":"1\u20132","key":"201_CR23","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/s0168-9274(02)00119-8","volume":"43","author":"A Forsgren","year":"2002","unstructured":"Forsgren, A.: Inertia-controlling factorizations for optimization algorithms. Appl. Numer. Math. 43(1\u20132), 91\u2013107 (2002). https:\/\/doi.org\/10.1016\/s0168-9274(02)00119-8","journal-title":"Appl. Numer. Math."},{"issue":"1","key":"201_CR24","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s12532-012-0035-2","volume":"4","author":"MP Friedlander","year":"2012","unstructured":"Friedlander, M.P., Orban, D.: A primal-dual regularized interior-point method for convex quadratic programs. Math. Program. Comp. 4(1), 71\u2013107 (2012). https:\/\/doi.org\/10.1007\/s12532-012-0035-2","journal-title":"Math. Program. Comp."},{"issue":"1\u20132","key":"201_CR25","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10107-016-1066-7","volume":"163","author":"PE Gill","year":"2016","unstructured":"Gill, P.E., Kungurtsev, V., Robinson, D.P.: A stabilized SQP method: superlinear convergence. Math. Program. 163(1\u20132), 369\u2013410 (2016). https:\/\/doi.org\/10.1007\/s10107-016-1066-7","journal-title":"Math. Program."},{"issue":"1","key":"201_CR26","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1093\/imanum\/drw004","volume":"37","author":"PE Gill","year":"2016","unstructured":"Gill, P.E., Kungurtsev, V., Robinson, D.P.: A stabilized SQP method: global convergence. IMA J. Numer. Anal. 37(1), 407\u2013443 (2016). https:\/\/doi.org\/10.1093\/imanum\/drw004","journal-title":"IMA J. Numer. Anal."},{"issue":"3","key":"201_CR27","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NI Gould","year":"2015","unstructured":"Gould, N.I., Orban, D., Toint, Ph.L.: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput. Optim. Appl. 60(3), 545\u2013557 (2015). https:\/\/doi.org\/10.1007\/s10589-014-9687-3","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"201_CR28","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1093\/imanum\/6.3.357","volume":"6","author":"NIM Gould","year":"1986","unstructured":"Gould, N.I.M.: On the accurate determination of search directions for simple differentiable penalty functions. IMA J. Numer. Anal. 6(3), 357\u2013372 (1986). https:\/\/doi.org\/10.1093\/imanum\/6.3.357","journal-title":"IMA J. Numer. Anal."},{"key":"201_CR29","unstructured":"Gratton, S., Toint, Ph.L.: A note on solving nonlinear optimization problems in variable precision. Technical report, University of Namur, (2018). URL http:\/\/www.optimization-online.org\/DB_HTML\/2018\/12\/6982.html"},{"key":"201_CR30","unstructured":"Gratton, S., Simon, E., Toint, Ph.L.: Minimizing convex quadratic with variable precision Krylov methods. Technical report, University of Namur, (2018). arXiv:1807.07476"},{"key":"201_CR31","unstructured":"Gupta, S., Agrawal, A., Gopalakrishnan, K., Narayanan, P.: Deep learning with limited numerical precision. In: Proceedings of the 32nd International Conference on International Conference on Machine Learning, vol. 37 of ICML\u201915, pp. 1737\u20131746. JMLR.org (2015). http:\/\/dl.acm.org\/citation.cfm?id=3045118.3045303"},{"key":"201_CR32","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 (1981). https:\/\/doi.org\/10.1007\/978-3-642-48320-2"},{"key":"201_CR33","unstructured":"HSL. The HSL Mathematical Software Library. STFC Rutherford Appleton Laboratory (2007). http:\/\/www.hsl.rl.ac.uk"},{"issue":"2","key":"201_CR34","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10589-015-9744-6","volume":"62","author":"AF Izmailov","year":"2015","unstructured":"Izmailov, A.F., Solodov, M.V., Uskov, E.I.: Combining stabilized SQP with the augmented Lagrangian algorithm. Comput. Optim. Appl. 62(2), 405\u2013429 (2015). https:\/\/doi.org\/10.1007\/s10589-015-9744-6","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"201_CR35","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/s10957-016-0889-y","volume":"169","author":"AF Izmailov","year":"2016","unstructured":"Izmailov, A.F., Solodov, M.V., Uskov, E.I.: Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function. J. Optim. Theory Appl. 169(1), 148\u2013178 (2016). https:\/\/doi.org\/10.1007\/s10957-016-0889-y","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"201_CR36","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1023\/A:1016043919978","volume":"114","author":"Z Li","year":"2002","unstructured":"Li, Z., Osborne, M., Prvan, T.: Adaptive algorithm for constrained least-squares problems. J. Optim. Theory Appl. 114(2), 423\u2013441 (2002). https:\/\/doi.org\/10.1023\/A:1016043919978","journal-title":"J. Optim. Theory Appl."},{"key":"201_CR37","doi-asserted-by":"publisher","first-page":"900","DOI":"10.21914\/anziamj.v42i0.627","volume":"42","author":"ZF Li","year":"2000","unstructured":"Li, Z.F.: On limited memory SQP methods for large scale constrained nonlinear least squares problems. ANZIAM J. 42, 900 (2000). https:\/\/doi.org\/10.21914\/anziamj.v42i0.627","journal-title":"ANZIAM J."},{"key":"201_CR38","unstructured":"Luk\u0161an, L., Vl\u010dek, J.: Sparse and partially separable test problems for unconstrained and equality constrained optimization. Technical Report V-767, Prague: ICS AS CR (1999)"},{"key":"201_CR39","doi-asserted-by":"publisher","unstructured":"Ma, D., Saunders, M.A.: Solving multiscale linear programs using the simplex method in quadruple precision. In: Numerical analysis and optimization, pp. 223\u2013235. Springer International Publishing (2015). https:\/\/doi.org\/10.1007\/978-3-319-17689-5_9","DOI":"10.1007\/978-3-319-17689-5_9"},{"issue":"1","key":"201_CR40","doi-asserted-by":"publisher","first-page":"103","DOI":"10.24200\/squjs.vol17iss1pp103-124","volume":"17","author":"N Mahdavi-Amiri","year":"2012","unstructured":"Mahdavi-Amiri, N., Ansari, M.R.: A superlinearly convergent penalty method with nonsmooth line search for constrained nonlinear least squares. Sultan Qaboos Univ. J. Sci. [SQUJS] 17(1), 103 (2012). https:\/\/doi.org\/10.24200\/squjs.vol17iss1pp103-124","journal-title":"Sultan Qaboos Univ. J. Sci. [SQUJS]"},{"issue":"3","key":"201_CR41","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1145\/66888.66891","volume":"15","author":"N Mahdavi-Amiri","year":"1989","unstructured":"Mahdavi-Amiri, N., Bartels, R.H.: Constrained nonlinear least squares: an exact penalty approach with projected structured quasi-Newton updates. ACM Trans. Math. Softw. 15(3), 220\u2013242 (1989). https:\/\/doi.org\/10.1145\/66888.66891","journal-title":"ACM Trans. Math. Softw."},{"key":"201_CR42","doi-asserted-by":"publisher","DOI":"10.11159\/ijecs.2012.001","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. (2012). https:\/\/doi.org\/10.11159\/ijecs.2012.001","journal-title":"Int. J. Electr. Comput. Syst."},{"key":"201_CR43","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1023\/A:1022686919295","volume":"97","author":"JM Mart\u00ednez","year":"1998","unstructured":"Mart\u00ednez, J.M., Santos, L.T.: Some new theoretical results on recursive quadratic programming algorithms. J. Optim. Theory Appl. 97, 435\u2013454 (1998). https:\/\/doi.org\/10.1023\/A:1022686919295","journal-title":"J. Optim. Theory Appl."},{"key":"201_CR44","unstructured":"Micikevicius, P., Narang, S., Alben, J., Diamos, G.F., Elsen, E., Garc\u00eda, D., Ginsburg, B., Houston, M., Kuchaiev, O., Venkatesh, G., Wu, H.: Mixed precision training. In: 6th International Conference on Learning Representations, ICLR 2018, Vancouver, BC, Canada, April 30\u2013May 3, 2018, Conference Track Proceedings (2018). https:\/\/openreview.net\/forum?id=r1gs9JgRZ"},{"issue":"1","key":"201_CR45","doi-asserted-by":"publisher","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(1), 17\u201341 (1981). https:\/\/doi.org\/10.1145\/355934.355936","journal-title":"ACM Trans. Math. Softw."},{"key":"201_CR46","doi-asserted-by":"publisher","unstructured":"Orban, D., Arioli, M.: Iterative Solution of Symmetric Quasi-Definite Linear Systems. SIAM Spotlights. Society for Industrial and Applied Mathematics Philadelphia (2017). https:\/\/doi.org\/10.1137\/1.9781611974737","DOI":"10.1137\/1.9781611974737"},{"key":"201_CR47","unstructured":"Orban, D., Siqueira, A.S.: JuliaSmoothOptimizers, a framework for development of nonlinear optimization methods in Julia. Technical report, Les Cahiers du GERAD (2020). In preparation"},{"key":"201_CR48","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-0348-9297-1_19","volume-title":"Trends in Mathematical Optimization: 4th French\u2013German Conference on Optimization","author":"K Schittkowski","year":"1988","unstructured":"Schittkowski, K.: Solving constrained nonlinear least squares problems by a general purpose SQP-method. In: Hoffmann, K.-H., Zowe, J., Hiriart-Urruty, J.-B., Lemar\u00e9chal, C. (eds.) Trends in Mathematical Optimization: 4th French\u2013German Conference on Optimization, pp. 295\u2013309. Birkh\u00e4user, Basel (1988). https:\/\/doi.org\/10.1007\/978-3-0348-9297-1_19. ISBN 978-3-0348-9297-1"},{"key":"201_CR49","unstructured":"Schittkowski, K.: NLPLSQ: a Fortran implementation of an SQP-Gauss-Newton algorithm for least squares optimization. Technical report, Department of Computer Science, University of Bayreuth (2007)"},{"issue":"1","key":"201_CR50","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1137\/0805005","volume":"5","author":"RJ Vanderbei","year":"1995","unstructured":"Vanderbei, R.J.: Symmetric quasidefinite matrices. SIAM J. Optim. 5(1), 100\u2013113 (1995). https:\/\/doi.org\/10.1137\/0805005","journal-title":"SIAM J. Optim."},{"issue":"1","key":"201_CR51","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 an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006). https:\/\/doi.org\/10.1007\/s10107-004-0559-y","journal-title":"Math. Program."},{"issue":"3","key":"201_CR52","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1023\/A:1018665102534","volume":"11","author":"SJ Wright","year":"1998","unstructured":"Wright, S.J.: Superlinear convergence of a stabilized SQP method to a degenerate solution. Comput. Optim. Appl. 11(3), 253\u2013275 (1998). https:\/\/doi.org\/10.1023\/A:1018665102534","journal-title":"Comput. Optim. Appl."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00201-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-020-00201-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00201-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,13]],"date-time":"2021-06-13T23:21:56Z","timestamp":1623626516000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-020-00201-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,14]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["201"],"URL":"https:\/\/doi.org\/10.1007\/s10589-020-00201-2","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2020,6,14]]},"assertion":[{"value":"24 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 June 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}