{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T23:26:28Z","timestamp":1757546788512,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,2,16]],"date-time":"2021-02-16T00:00:00Z","timestamp":1613433600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,2,16]],"date-time":"2021-02-16T00:00:00Z","timestamp":1613433600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004359","name":"Vetenskapsr\u00e5det","doi-asserted-by":"publisher","award":["621-2014-4772"],"award-info":[{"award-number":["621-2014-4772"]}],"id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004270","name":"Royal Institute of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004270","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2021,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The focus in this paper is interior-point methods for bound-constrained nonlinear optimization, where the system of nonlinear equations that arise are solved with Newton\u2019s method. There is a trade-off between solving Newton systems directly, which give high quality solutions, and solving many approximate Newton systems which are computationally less expensive but give lower quality solutions. We propose partial and full approximate solutions to the Newton systems. The specific approximate solution depends on estimates of the active and inactive constraints at the solution. These sets are at each iteration estimated by basic heuristics. The partial approximate solutions are computationally inexpensive, whereas a system of linear equations needs to be solved for the full approximate solution. The size of the system is determined by the estimate of the inactive constraints at the solution. In addition, we motivate and suggest two Newton-like approaches which are based on an intermediate step that consists of the partial approximate solutions. The theoretical setting is introduced and asymptotic error bounds are given. We also give numerical results to investigate the performance of the approximate solutions within and beyond the theoretical framework.<\/jats:p>","DOI":"10.1007\/s10589-021-00265-8","type":"journal-article","created":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T01:21:07Z","timestamp":1613697667000},"page":"155-191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1764-5449","authenticated-orcid":false,"given":"David","family":"Ek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6252-7815","authenticated-orcid":false,"given":"Anders","family":"Forsgren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,16]]},"reference":[{"issue":"2","key":"265_CR1","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/tac.1976.1101194","volume":"AC\u201321","author":"DP Bertsekas","year":"1976","unstructured":"Bertsekas, D.P.: On the Goldstein-Levitin-Polyak gradient projection method. IEEE Trans. Automatic Control AC\u201321(2), 174\u2013184 (1976). https:\/\/doi.org\/10.1109\/tac.1976.1101194","journal-title":"IEEE Trans. Automatic Control"},{"issue":"2","key":"265_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0320018","volume":"20","author":"DP Bertsekas","year":"1982","unstructured":"Bertsekas, D.P.: Projected Newton methods for optimization problems with simple constraints. SIAM J. Control Optim. 20(2), 221\u2013246 (1982). https:\/\/doi.org\/10.1137\/0320018","journal-title":"SIAM J. Control Optim."},{"key":"265_CR3","series-title":"Numerical analysis","first-page":"37","volume-title":"On the local behavior of an interior point method for nonlinear programming","author":"RH Byrd","year":"1998","unstructured":"Byrd, R.H., Liu, G., Nocedal, J.: On the local behavior of an interior point method for nonlinear programming. Numerical analysis, pp. 37\u201356. Addison-Wesley-Longman, Boston (1998)"},{"issue":"5","key":"265_CR4","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.1137\/0916069","volume":"16","author":"RH Byrd","year":"1995","unstructured":"Byrd, R.H., Lu, P., Nocedal, J., Zhu, C.Y.: A limited memory algorithm for bound constrained optimization. SIAM J. Sci. Comput. 16(5), 1190\u20131208 (1995). https:\/\/doi.org\/10.1137\/0916069","journal-title":"SIAM J. Sci. Comput."},{"issue":"2 Ser. A","key":"265_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF01582221","volume":"67","author":"TF Coleman","year":"1994","unstructured":"Coleman, T.F., Li, Y.: On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds. Math. Program. 67(2 Ser. A), 189\u2013224 (1994). https:\/\/doi.org\/10.1007\/BF01582221","journal-title":"Math. Program."},{"issue":"2","key":"265_CR6","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1137\/0725029","volume":"25","author":"AR Conn","year":"1988","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Global convergence of a class of trust region algorithms for optimization with simple bounds. SIAM J. Numer. Anal. 25(2), 433\u2013460 (1988). https:\/\/doi.org\/10.1137\/0725029","journal-title":"SIAM J. Numer. Anal."},{"key":"265_CR7","doi-asserted-by":"publisher","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust region methods. Society for Industrial and Applied Mathematics (2000). https:\/\/doi.org\/10.1137\/1.9780898719857. URL https:\/\/epubs.siam.org\/doi\/abs\/10.1137\/1.9780898719857","DOI":"10.1137\/1.9780898719857"},{"issue":"1","key":"265_CR8","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1137\/S1052623493253991","volume":"8","author":"F Facchinei","year":"1998","unstructured":"Facchinei, F., J\u00fadice, J., Soares, Ja: An active set Newton algorithm for large-scale nonlinear programs with box constraints. SIAM J. Optim. 8(1), 158\u2013186 (1998). https:\/\/doi.org\/10.1137\/S1052623493253991","journal-title":"SIAM J. Optim."},{"issue":"4","key":"265_CR9","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(4), 1132\u20131152 (1998). https:\/\/doi.org\/10.1137\/S1052623496305560","journal-title":"SIAM J. Optim."},{"issue":"2","key":"265_CR10","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1137\/060650210","volume":"18","author":"A Forsgren","year":"2007","unstructured":"Forsgren, A., Gill, P.E., Griffin, J.D.: Iterative solution of augmented systems arising in interior methods. SIAM J. Optim. 18(2), 666\u2013690 (2007)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"265_CR11","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1137\/S0895479894270658","volume":"17","author":"A Forsgren","year":"1996","unstructured":"Forsgren, A., Gill, P.E., Shinnerl, J.R.: Stability of symmetric ill-conditioned systems arising in interior methods for constrained optimization. SIAM J. Matrix Anal. Appl. 17(1), 187\u2013211 (1996). https:\/\/doi.org\/10.1137\/S0895479894270658","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"265_CR12","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1137\/S0036144502414942","volume":"44","author":"A Forsgren","year":"2002","unstructured":"Forsgren, A., Gill, P.E., Wright, M.H.: Interior methods for nonlinear optimization. SIAM Rev. 44(4), 525\u2013597 (2002). https:\/\/doi.org\/10.1137\/S0036144502414942","journal-title":"SIAM Rev."},{"key":"265_CR13","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1137\/0613022","volume":"13","author":"PE Gill","year":"1992","unstructured":"Gill, P.E., Murray, W., Poncele\u00f3n, D.B., Saunders, M.A.: Preconditioners for indefinite systems arising in optimization. SIAM J. Matrix Anal. Appl. 13, 292\u2013311 (1992)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"265_CR14","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s10589-019-00102-z","volume":"74","author":"J Gondzio","year":"2019","unstructured":"Gondzio, J., Sobral, F.N.C.: Quasi-Newton approaches to interior point methods for quadratic problems. Comput. Optim. Appl. 74(1), 93\u2013120 (2019). https:\/\/doi.org\/10.1007\/s10589-019-00102-z","journal-title":"Comput. Optim. Appl."},{"key":"265_CR15","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1017\/S0962492904000248","volume":"14","author":"N Gould","year":"2005","unstructured":"Gould, N., Orban, D., Toint, P.: Numerical methods for large-scale nonlinear optimization. Acta Numer. 14, 299\u2013361 (2005). https:\/\/doi.org\/10.1017\/S0962492904000248","journal-title":"Acta Numer."},{"issue":"3","key":"265_CR16","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, P.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."},{"key":"265_CR17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717730","volume-title":"Linear and nonlinear optimization","author":"I Griva","year":"2009","unstructured":"Griva, I., Nash, S., Sofer, A.: Linear and nonlinear optimization, 2nd edn. Society for Industrial and Applied Mathematics, London (2009)","edition":"2"},{"issue":"2","key":"265_CR18","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1137\/050635225","volume":"17","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: A new active set algorithm for box constrained optimization. SIAM J. Optim. 17(2), 526\u2013557 (2006). https:\/\/doi.org\/10.1137\/050635225","journal-title":"SIAM J. Optim."},{"issue":"3 Ser. A","key":"265_CR19","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s101070050107","volume":"86","author":"M Heinkenschloss","year":"1999","unstructured":"Heinkenschloss, M., Ulbrich, M., Ulbrich, S.: Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption. Math. Program. 86(3 Ser. A), 615\u2013635 (1999). https:\/\/doi.org\/10.1007\/s101070050107","journal-title":"Math. Program."},{"issue":"2","key":"265_CR20","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10589-006-6514-5","volume":"35","author":"C Kanzow","year":"2006","unstructured":"Kanzow, C., Klug, A.: On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints. Comput. Optim. Appl. 35(2), 177\u2013197 (2006). https:\/\/doi.org\/10.1007\/s10589-006-6514-5","journal-title":"Comput. Optim. Appl."},{"key":"265_CR21","doi-asserted-by":"publisher","first-page":"3548","DOI":"10.1137\/08073812X","volume":"32","author":"D Kim","year":"2010","unstructured":"Kim, D., Sra, S., Dhillon, I.: Tackling box-constrained optimization via a new projected quasi-newton approach. SIAM J. Scientific Computing 32, 3548\u20133563 (2010). https:\/\/doi.org\/10.1137\/08073812X","journal-title":"SIAM J. Scientific Computing"},{"key":"265_CR22","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623498345075","author":"CJ Lin","year":"1999","unstructured":"Lin, C.J., Mor\u00e9, J.J.: Newton\u2019s method for large bound-constrained optimization problems. SIAM J. Optim. (1999). https:\/\/doi.org\/10.1137\/S1052623498345075. Dedicated to John E. Dennis, Jr., on his 60th birthday","journal-title":"SIAM J. Optim."},{"issue":"2","key":"265_CR23","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/s10957-017-1170-8","volume":"175","author":"B Morini","year":"2017","unstructured":"Morini, B., Simoncini, V.: Stability and accuracy of inexact interior point methods for convex quadratic programming. J. Optim. Theory Appl. 175(2), 450\u2013477 (2017). https:\/\/doi.org\/10.1007\/s10957-017-1170-8","journal-title":"J. Optim. Theory Appl."},{"key":"265_CR24","series-title":"Springer Series in Operations Research and Financial Engineering","volume-title":"Numerical optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical optimization. Springer Series in Operations Research and Financial Engineering, 2nd edn. Springer, New York (2006)","edition":"2"},{"key":"265_CR25","doi-asserted-by":"publisher","unstructured":"Orban, D., Siqueira, A.S.: JuliaSmoothOptimizers: Infrastructure and solvers for continuous optimization in Julia (2019). https:\/\/doi.org\/10.5281\/zenodo.2655082. URL https:\/\/juliasmoothoptimizers.github.io","DOI":"10.5281\/zenodo.2655082"},{"key":"265_CR26","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719468","volume-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"JM Ortega","year":"2000","unstructured":"Ortega, J.M., Rheinboldt, W.C.: Iterative Solution of Nonlinear Equations in Several Variables. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2000)"},{"issue":"1","key":"265_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1022690711754","volume":"92","author":"A Schwartz","year":"1997","unstructured":"Schwartz, A., Polak, E.: Family of projected descent methods for optimization problems with simple bounds. J. Optim. Theory Appl. 92(1), 1\u201331 (1997). https:\/\/doi.org\/10.1023\/A:1022690711754","journal-title":"J. Optim. Theory Appl."},{"key":"265_CR28","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008677427361","author":"RJ Vanderbei","year":"1999","unstructured":"Vanderbei, R.J., Shanno, D.F.: An interior-point algorithm for nonconvex nonlinear programming. Computational optimization (1999). https:\/\/doi.org\/10.1023\/A:1008677427361. A tribute to Olvi Mangasarian, Part II","journal-title":"Computational optimization"},{"issue":"1 Ser. A","key":"265_CR29","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 Ser. A), 25\u201357 (2006). https:\/\/doi.org\/10.1007\/s10107-004-0559-y","journal-title":"Math. Program."},{"issue":"3 Ser. A","key":"265_CR30","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10107-004-0560-5","volume":"107","author":"RA Waltz","year":"2006","unstructured":"Waltz, R.A., Morales, J.L., Nocedal, J., Orban, D.: An interior algorithm for nonlinear optimization that combines line search and trust region steps. Math. Program. 107(3 Ser. A), 391\u2013408 (2006). https:\/\/doi.org\/10.1007\/s10107-004-0560-5","journal-title":"Math. Program."},{"issue":"1","key":"265_CR31","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1137\/S1052623497322279","volume":"9","author":"MH Wright","year":"1999","unstructured":"Wright, M.H.: Ill-Conditioning and computational error in interior methods for nonlinear programming. SIAM J. Optim. 9(1), 84\u2013111 (1999). https:\/\/doi.org\/10.1137\/S1052623497322279","journal-title":"SIAM J. Optim."},{"issue":"4","key":"265_CR32","doi-asserted-by":"publisher","first-page":"1287","DOI":"10.1137\/S0895479893260498","volume":"16","author":"SJ Wright","year":"1995","unstructured":"Wright, S.J.: Stability of linear equations solvers in interior-point methods. SIAM J. Matrix Anal. Appl. 16(4), 1287\u20131307 (1995). https:\/\/doi.org\/10.1137\/S0895479893260498","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"265_CR33","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1137\/S1052623498347438","volume":"12","author":"SJ Wright","year":"2001","unstructured":"Wright, S.J.: Effects of finite-precision arithmetic on interior-point methods for nonlinear programming. SIAM J. Optim. 12(1), 36\u201378 (2001). https:\/\/doi.org\/10.1137\/S1052623498347438","journal-title":"SIAM J. Optim."},{"issue":"4","key":"265_CR34","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1145\/279232.279236","volume":"23","author":"C Zhu","year":"1997","unstructured":"Zhu, C., Byrd, R.H., Lu, P., Nocedal, J.: Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization. ACM Trans. Math. Softw. 23(4), 550\u2013560 (1997). https:\/\/doi.org\/10.1145\/279232.279236","journal-title":"ACM Trans. Math. Softw."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00265-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-021-00265-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00265-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T17:12:45Z","timestamp":1617210765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-021-00265-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,16]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["265"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00265-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2021,2,16]]},"assertion":[{"value":"8 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}