{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:54:41Z","timestamp":1740142481243,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T00:00:00Z","timestamp":1678406400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T00:00:00Z","timestamp":1678406400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["2020M3H1A1077095","NRF-2016R1A5A1008055"],"award-info":[{"award-number":["2020M3H1A1077095","NRF-2016R1A5A1008055"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["NRF-2019R1F1A1057051","2019R1F1A1047134"],"award-info":[{"award-number":["NRF-2019R1F1A1057051","2019R1F1A1047134"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["2022R1A2C1010537","2022R1A2C1011503"],"award-info":[{"award-number":["2022R1A2C1010537","2022R1A2C1011503"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s40314-023-02251-8","type":"journal-article","created":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T17:02:51Z","timestamp":1678467771000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A limited-memory trust-region method for nonlinear optimization with many equality constraints"],"prefix":"10.1007","volume":"42","author":[{"given":"Jae Hwa","family":"Lee","sequence":"first","affiliation":[]},{"given":"Yoon Mo","family":"Jung","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5782-7266","authenticated-orcid":false,"given":"Sangwoon","family":"Yun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,10]]},"reference":[{"key":"2251_CR1","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou L, Curtis FE, Nocedal J (2018) Optimization methods for large-scale machine learning. SIAM Rev 60:223\u2013311. https:\/\/doi.org\/10.1137\/16M1080173","journal-title":"SIAM Rev"},{"key":"2251_CR2","doi-asserted-by":"publisher","unstructured":"Brust JJ, Erway JB, Marcia RF (2017) On solving L-SR1 trust-region subproblems. Comput Optim Appl 66:245\u2013266. https:\/\/doi.org\/10.1007\/s10589-016-9868-3","DOI":"10.1007\/s10589-016-9868-3"},{"key":"2251_CR3","doi-asserted-by":"publisher","unstructured":"Brust JJ, Marcia RF, Petra CG (2019) Large-scale quasi-newton trust-region methods with low-dimensional linear equality constraints. Comput Optim Appl 74:669\u2013701. https:\/\/doi.org\/10.1007\/s10589-019-00127-4","DOI":"10.1007\/s10589-019-00127-4"},{"key":"2251_CR4","doi-asserted-by":"crossref","unstructured":"Brust JJ, Burdakov O, Erway JB, Marcia RF, Yuan YX (2022) Algorithm 1030: SC-SR1: MATLAB software for limitedmemory SR1 trust-region methods. ACM Trans. Math. Softw. 48, 1\u201333. https:\/\/doi.org\/10.1145\/3550269","DOI":"10.1145\/3550269"},{"key":"2251_CR5","unstructured":"Brust JJ, Erway JB, Marcia RF (2022b) Shape-changing trust-region methods using multipoint symmetric secant matrices. arXiv:2209.12057"},{"key":"2251_CR6","doi-asserted-by":"publisher","DOI":"10.1137\/21M1393819","author":"JJ Brust","year":"2022","unstructured":"Brust JJ, Marcia RF, Petra CG, Saunders MA (2022c) Large-scale optimization with linear equality constraints using reduced compact representation. SIAM J Sci Comput. https:\/\/doi.org\/10.1137\/21M1393819","journal-title":"SIAM J Sci Comput"},{"key":"2251_CR7","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s12532-016-0109-7","volume":"9","author":"O Burdakov","year":"2017","unstructured":"Burdakov O, Gong L, Zikrin S, Yuan YX (2017) On efficiently combining limited-memory and trust-region techniques. Math Program Comput 9:101\u2013134. https:\/\/doi.org\/10.1007\/s12532-016-0109-7","journal-title":"Math Program Comput"},{"key":"2251_CR8","doi-asserted-by":"crossref","unstructured":"Byrd RH, Omojokun EO (1987) Robust trust-region methods for nonlinearly constrained optimization. Paper presented at the SIAM conference on optimization, Houston, TX, USA","DOI":"10.1137\/0724076"},{"key":"2251_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01582063","volume":"63","author":"RH Byrd","year":"1994","unstructured":"Byrd RH, Nocedal J, Schnabel RB (1994) Representations of quasi-newton matrices and their use in limited memory methods. Math Program 63:129\u2013156. https:\/\/doi.org\/10.1007\/BF01582063","journal-title":"Math Program"},{"key":"2251_CR10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-region methods","author":"AR Conn","year":"2000","unstructured":"Conn AR, Gould NIM, Toint PL (2000) Trust-region methods. SIAM, Philadelphia"},{"key":"2251_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2019.124861","author":"CM Costa","year":"2019","unstructured":"Costa CM, Grapiglia GN (2019) A subspace version of the Wang\u2013Yuan augmented Lagrangian trust region method for equality constrained optimization. Appl Math Comput. https:\/\/doi.org\/10.1016\/j.amc.2019.124861","journal-title":"Appl Math Comput"},{"key":"2251_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0002-9904-1943-07818-4","volume":"49","author":"R Courant","year":"1943","unstructured":"Courant R (1943) Variational methods for the solution of problems of equilibrium and vibrations. Bull Am Math Soc 49:1\u201323. https:\/\/doi.org\/10.1090\/S0002-9904-1943-07818-4","journal-title":"Bull Am Math Soc"},{"key":"2251_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/S1052623492238881","volume":"7","author":"JE Dennis Jr","year":"1997","unstructured":"Dennis JE Jr, El-Alem MM, Maciel MC (1997) A global convergence theory for general trust-region-based algorithms for equality constrained optimization. SIAM J Optim 7:177\u2013207. https:\/\/doi.org\/10.1137\/S1052623492238881","journal-title":"SIAM J Optim"},{"key":"2251_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0377-0427(02)00699-4","volume":"152","author":"J Dong","year":"2003","unstructured":"Dong J, Shi J, Wang S, Xue Y, Liu S (2003) A trust-region algorithm for equality-constrained optimization via a reduced dimension approach. J Comput Appl Math 152:99\u2013118. https:\/\/doi.org\/10.1016\/S0377-0427(02)00699-4","journal-title":"J Comput Appl Math"},{"key":"2251_CR15","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0728015","volume":"28","author":"MM El-Alem","year":"1991","unstructured":"El-Alem MM (1991) A global convergence theory for the Celis\u2013Dennis\u2013Tapia trust-region algorithm for constrained optimization. SIAM J Numer Anal 28:266\u2013290. https:\/\/doi.org\/10.1137\/0728015","journal-title":"SIAM J Numer Anal"},{"key":"2251_CR16","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/BF02192134","volume":"87","author":"MM El-Alem","year":"1995","unstructured":"El-Alem MM (1995) Global convergence without the assumption of linear independence for a trust-region algorithm for constrained optimization. J Optim Theory Appl 87:563\u2013577. https:\/\/doi.org\/10.1007\/BF02192134","journal-title":"J Optim Theory Appl"},{"key":"2251_CR17","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/140997737","volume":"36","author":"JB Erway","year":"2015","unstructured":"Erway JB, Marcia RF (2015) On efficiently computing the eigenvalues of limited-memory quasi-newton matrices. SIAM J Matrix Anal Appl 36:1338\u20131359. https:\/\/doi.org\/10.1137\/140997737","journal-title":"SIAM J Matrix Anal Appl"},{"key":"2251_CR18","doi-asserted-by":"crossref","unstructured":"Erway JB, Rezapour M (2021) A new multipoint symmetric secant method with a dense initial matrix. Optim. Methods Softw.https:\/\/doi.org\/10.1080\/10556788.2023.2167993","DOI":"10.1080\/10556788.2023.2167993"},{"key":"2251_CR19","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1080\/10556788.2019.1624747","volume":"35","author":"JB Erway","year":"2020","unstructured":"Erway JB, Griffin J, Marcia RF, Omheni R (2020) Trust-region algorithms for training responses: machine learning methods using indefinite hessian approximations. Optim Methods Softw 35:460\u2013487. https:\/\/doi.org\/10.1080\/10556788.2019.1624747","journal-title":"Optim Methods Softw"},{"key":"2251_CR20","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s101070100244","volume":"91","author":"R Fletcher","year":"2002","unstructured":"Fletcher R, Leyffer S (2002) Nonlinear programming without a penalty function. Math Program 91:239\u2013269. https:\/\/doi.org\/10.1007\/s101070100244","journal-title":"Math Program"},{"key":"2251_CR21","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1017\/S0962492904000248","volume":"14","author":"NIM Gould","year":"2005","unstructured":"Gould NIM, Orban D, Toint PL (2005) Numerical methods for large-scale nonlinear optimization. Acta Numer 14:299\u2013361. https:\/\/doi.org\/10.1017\/S0962492904000248","journal-title":"Acta Numer"},{"key":"2251_CR22","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NIM Gould","year":"2015","unstructured":"Gould NIM, Orban D, Toint PL (2015) CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput Optim Appl 60:545\u2013557. https:\/\/doi.org\/10.1007\/s10589-014-9687-3","journal-title":"Comput Optim Appl"},{"key":"2251_CR23","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1017\/S0962492904000248","volume":"1","author":"GN Grapiglia","year":"2013","unstructured":"Grapiglia GN, Yuan J, Yuan YX (2013) A subspace version of the Powell\u2013Yuan trust-region algorithm for equality constrained optimization. J Oper Res Soc China 1:425\u2013451. https:\/\/doi.org\/10.1017\/S0962492904000248","journal-title":"J Oper Res Soc China"},{"key":"2251_CR24","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1137\/S1052623493262993","volume":"8","author":"M Lalee","year":"1998","unstructured":"Lalee M, Nocedal J, Plantenga T (1998) On the implementation of an algorithm for large-scale equality constrained optimization. SIAM J Optim 8:682\u2013706. https:\/\/doi.org\/10.1137\/S1052623493262993","journal-title":"SIAM J Optim"},{"key":"2251_CR25","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10589-019-00109-6","volume":"74","author":"JH Lee","year":"2019","unstructured":"Lee JH, Jung YM, Yuan YX, Yun S (2019) A subspace SQP method for equality constrained optimization. Comput Optim Appl 74:177\u2013194. https:\/\/doi.org\/10.1007\/s10589-019-00109-6","journal-title":"Comput Optim Appl"},{"key":"2251_CR26","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"JJ Mor\u00e9","year":"1983","unstructured":"Mor\u00e9 JJ, Sorensen DC (1983) Computing a trust region step. SIAM J Sci Stat Comput 4:553\u2013572. https:\/\/doi.org\/10.1137\/0904038","journal-title":"SIAM J Sci Stat Comput"},{"key":"2251_CR27","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","volume":"35","author":"J Nocedal","year":"1980","unstructured":"Nocedal J (1980) Updating quasi-newton matrices with limited storage. Math Comput 35:773\u2013782. https:\/\/doi.org\/10.1090\/S0025-5718-1980-0572855-7","journal-title":"Math Comput"},{"key":"2251_CR28","volume-title":"Numerical optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal J, Wright SJ (2006) Numerical optimization, 2nd edn. Springer, New York","edition":"2"},{"key":"2251_CR29","unstructured":"Omojokun EO (1991) Trust region algorithms for optimization with nonlinear equality and inequality constraints. Dissertation, University of Colorado Boulder"},{"key":"2251_CR30","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/B978-0-12-597050-1.50006-3","volume-title":"Nonlinear programming","author":"MJD Powell","year":"1970","unstructured":"Powell MJD (1970) A new algorithm for unconstrained optimization. In: Rosen JB, Mangasarian OL, Ritter K (eds) Nonlinear programming. Academic Press, New York, pp 31\u201365. https:\/\/doi.org\/10.1016\/B978-0-12-597050-1.50006-3"},{"key":"2251_CR31","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/BFb0067703","volume-title":"Numerical analysis","author":"MJD Powell","year":"1978","unstructured":"Powell MJD (1978) A fast algorithm for nonlinearly constrained optimization calculations. In: Watson GA (ed) Numerical analysis. Springer, Berlin, pp 144\u2013157. https:\/\/doi.org\/10.1007\/BFb0067703"},{"key":"2251_CR32","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF01588787","volume":"49","author":"MJD Powell","year":"1990","unstructured":"Powell MJD, Yuan YX (1990) A trust region algorithm for equality constrained optimization. Math Program 49:189\u2013211. https:\/\/doi.org\/10.1007\/BF01588787","journal-title":"Math Program"},{"key":"2251_CR33","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1137\/0720042","volume":"20","author":"T Steihaug","year":"1983","unstructured":"Steihaug T (1983) The conjugate gradient method and trust regions in large scale optimization. SIAM J Numer Anal 20:626\u2013637. https:\/\/doi.org\/10.1137\/0720042","journal-title":"SIAM J Numer Anal"},{"key":"2251_CR34","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 (2016) A sequential quadratic programming algorithm for equality-constrained optimization without derivatives. Optim Lett 10:383\u2013399. https:\/\/doi.org\/10.1007\/s11590-014-0830-y","journal-title":"Optim Lett"},{"key":"2251_CR35","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10107-002-0343-9","volume":"95","author":"M Ulbrich","year":"2003","unstructured":"Ulbrich M, Ulbrich S (2003) Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function. Math Program 95:103\u2013135. https:\/\/doi.org\/10.1007\/s10107-002-0343-9","journal-title":"Math Program"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-023-02251-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-023-02251-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-023-02251-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T12:28:49Z","timestamp":1680784129000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-023-02251-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,10]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["2251"],"URL":"https:\/\/doi.org\/10.1007\/s40314-023-02251-8","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2023,3,10]]},"assertion":[{"value":"18 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"109"}}