{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T10:30:16Z","timestamp":1722594616447},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T00:00:00Z","timestamp":1557964800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T00:00:00Z","timestamp":1557964800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["NRF-2016R1A5A1008055","NRF-2016R1D1A1B03931337"],"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-2016R1D1A1B03934371"],"id":[{"id":"10.13039\/501100003725","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":[[2019,9]]},"DOI":"10.1007\/s10589-019-00109-6","type":"journal-article","created":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T07:04:27Z","timestamp":1557990267000},"page":"177-194","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A subspace SQP method for equality constrained optimization"],"prefix":"10.1007","volume":"74","author":[{"given":"Jae Hwa","family":"Lee","sequence":"first","affiliation":[]},{"given":"Yoon Mo","family":"Jung","sequence":"additional","affiliation":[]},{"given":"Ya-xiang","family":"Yuan","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-5782-7266","authenticated-orcid":false,"given":"Sangwoon","family":"Yun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,16]]},"reference":[{"key":"109_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01582063","volume":"63","author":"RH Byrd","year":"1994","unstructured":"Byrd, R.H., Nocedal, J., Schnabel, R.B.: Representations of quasi-Newton matrices and their use in limited memory methods. Math. Program. 63, 129\u2013156 (1994)","journal-title":"Math. Program."},{"key":"109_CR2","doi-asserted-by":"publisher","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":"109_CR3","first-page":"71","volume-title":"Numerical Optimization 1984","author":"MR Celis","year":"1985","unstructured":"Celis, M.R., Dennis, J.E., Tapia, R.A.: A trust region strategy for nonlinear equality constrained optimization. In: Boggs, P.T., Byrd, R.H., Schnabel, R.B. (eds.) Numerical Optimization 1984, pp. 71\u201382. SIAM, Philadelphia (1985)"},{"key":"109_CR4","first-page":"772","volume":"30","author":"JW Daniel","year":"1976","unstructured":"Daniel, J.W., Gragg, W.B., Kaufman, L., Stewart, G.W.: Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization. Math. Comput. 30, 772\u2013795 (1976)","journal-title":"Math. Comput."},{"key":"109_CR5","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1137\/0806023","volume":"6","author":"PE Gill","year":"1996","unstructured":"Gill, P.E., Leonard, M.W.: Reduced-Hessian quasi-Newton methods for unconstrained optimization. SIAM J. Optim. 6, 418\u2013445 (1996)","journal-title":"SIAM J. Optim."},{"key":"109_CR6","volume-title":"System Modelling and Optimization: Methods, Theory and Applications","author":"NIM Gould","year":"2000","unstructured":"Gould, N.I.M., Toint, P.L.: SQP methods for large-scale nonlinear programming. In: Powell, M.J.D., Scholtes, S. (eds.) System Modelling and Optimization: Methods, Theory and Applications. Kluwer, Dordrecht (2000)"},{"key":"109_CR7","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1017\/S0962492904000248","volume":"14","author":"NIM Gould","year":"2005","unstructured":"Gould, N.I.M., Orban, D., Toint, PhL: Numerical methods for large-scale nonlinear optimization. Acta Numer. 14, 299\u2013361 (2005)","journal-title":"Acta Numer."},{"key":"109_CR8","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, PhL: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput. Optim. Appl. 60, 545\u2013557 (2015)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"109_CR9","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s40305-013-0029-4","volume":"1","author":"GN Grapiglia","year":"2013","unstructured":"Grapiglia, G.N., Yuan, J., Yuan, Y.: A subspace version of the Powell\u2013Yuan trust region algorithm for equality constrained optimization. J. Oper. Res. Soc. China 1(4), 425\u2013451 (2013)","journal-title":"J. Oper. Res. Soc. China"},{"key":"109_CR10","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01588250","volume":"17","author":"S-P Han","year":"1979","unstructured":"Han, S.-P., Mangasarian, O.L.: Exact penalty functions in nonlinear programming. Math. Program. 17, 251\u2013269 (1979)","journal-title":"Math. Program."},{"issue":"151","key":"109_CR11","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.: Updating quasi-Newton matrices with limited storage. Math. Comput. 35(151), 773\u2013782 (1980)","journal-title":"Math. Comput."},{"key":"109_CR12","volume-title":"Numerical Optimization (Springer Series in Operations Research)","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization (Springer Series in Operations Research), 2nd edn. Springer, New York (2006)","edition":"2"},{"key":"109_CR13","first-page":"144","volume-title":"Numerical Analysis Dundee 1977 (Lecture Notes in Mathematics 630)","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 Dundee 1977 (Lecture Notes in Mathematics 630), pp. 144\u2013157. Springer, Berlin (1978)"},{"key":"109_CR14","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-68874-4_12","volume-title":"Mathematical Programming: The State of the Art, Bonn, 1982","author":"MJD Powell","year":"1983","unstructured":"Powell, M.J.D.: Variable metric methods for constrained optimization. In: Bachem, A., Gr\u00f6tschel, M., Korte, B. (eds.) Mathematical Programming: The State of the Art, Bonn, 1982, pp. 288\u2013311. Springer, Berlin (1983)"},{"key":"109_CR15","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/zamm.19950751207","volume":"75","author":"J Stoer","year":"1995","unstructured":"Stoer, J., Yuan, Y.: A subspace study on conjugate gradient algorithms. ZAMM Z. Angew. Math. Mech. 75, 69\u201377 (1995)","journal-title":"ZAMM Z. Angew. Math. Mech."},{"key":"109_CR16","unstructured":"Vl\u010dek, J., Luk\u0161an, L.: New variable metric methods for unconstrained minimization covering the large-scale case. Technical report No. V876, Institute of Computer Science, Academy of Sciences of the Czech Republic (2002)"},{"key":"109_CR17","first-page":"265","volume-title":"Numerical Linear Algebra and Optimization","author":"Z-H Wang","year":"2004","unstructured":"Wang, Z.-H., Wen, Z.-W., Yuan, Y.: A subspace trust region method for large scale unconstrained optimization. In: Yuan, Y. (ed.) Numerical Linear Algebra and Optimization, pp. 265\u2013274. Science Press, Beijing (2004)"},{"key":"109_CR18","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s00211-006-0021-6","volume":"104","author":"Z-H Wang","year":"2006","unstructured":"Wang, Z.-H., Yuan, Y.: A subspace implementation of quasi-Newton trust region methods for unconstrained optimization. Numer. Math. 104, 241\u2013269 (2006)","journal-title":"Numer. Math."},{"key":"109_CR19","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1142\/9789812709356_0012","volume-title":"Some Topics in Industrial and Applied Mathematics (Series in Contemporary Applied Mathematics CAM 8)","author":"Y Yuan","year":"2007","unstructured":"Yuan, Y.: Subspace techniques for nonlinear optimization. In: Jeltsch, R., Li, T., Sloan, I.H. (eds.) Some Topics in Industrial and Applied Mathematics (Series in Contemporary Applied Mathematics CAM 8), pp. 206\u2013218. Higher Education Press, Beijing (2007)"},{"key":"109_CR20","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11081-008-9064-0","volume":"10","author":"Y Yuan","year":"2009","unstructured":"Yuan, Y.: Subspace methods for large scale nonlinear equations and nonlinear least squares. Optim. Eng. 10, 207\u2013218 (2009)","journal-title":"Optim. Eng."},{"key":"109_CR21","unstructured":"Yuan, Y.: A review on subspace methods for nonlinear optimization. In: Proceedings of International Congress of Mathematicians 2014 Seoul, Korea, pp. 807\u2013827 (2014)"},{"key":"109_CR22","doi-asserted-by":"publisher","first-page":"1717","DOI":"10.1007\/s11425-016-0012-1","volume":"60","author":"X Zhao","year":"2017","unstructured":"Zhao, X., Fan, J.: Subspace choices for the Celis\u2013Dennis\u2013Tapia problem. Sci. China Math. 60, 1717\u20131732 (2017)","journal-title":"Sci. China Math."},{"key":"109_CR23","doi-asserted-by":"crossref","first-page":"1625","DOI":"10.3934\/jimo.2017010","volume":"13","author":"X Zhao","year":"2017","unstructured":"Zhao, X., Fan, J.: On subspace properties of the quadratically constrained quadratic program. J. Ind. Manag. Optim. 13, 1625\u20131640 (2017)","journal-title":"J. Ind. Manag. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00109-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00109-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00109-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,18]],"date-time":"2022-09-18T03:14:38Z","timestamp":1663470878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00109-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,16]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["109"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00109-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,16]]},"assertion":[{"value":"18 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}