{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:10:02Z","timestamp":1766067002068,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T00:00:00Z","timestamp":1557360000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003968","name":"Iran National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003968","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":[[2019,9]]},"DOI":"10.1007\/s10589-019-00105-w","type":"journal-article","created":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T10:47:00Z","timestamp":1557485220000},"page":"195-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint"],"prefix":"10.1007","volume":"74","author":[{"given":"A.","family":"Taati","sequence":"first","affiliation":[]},{"given":"M.","family":"Salahi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,9]]},"reference":[{"issue":"1","key":"105_CR1","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1137\/16M1058200","volume":"27","author":"S Adachi","year":"2017","unstructured":"Adachi, S., Iwata, S., Nakatsukasa, Y., Takeda, A.: Solving the trust region subproblem by a generalized eigenvalue problem. SIAM J. Optim. 27(1), 269\u2013291 (2017)","journal-title":"SIAM J. Optim."},{"key":"105_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-017-1206-8","author":"S Adachi","year":"2017","unstructured":"Adachi, S., Nakatsukasa, Y.: Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint. Math. Program. (2017). \n                    https:\/\/doi.org\/10.1007\/s10107-017-1206-8","journal-title":"Math. Program."},{"issue":"1\u20132","key":"105_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-013-0710-8","volume":"143","author":"A Ben-Tal","year":"2014","unstructured":"Ben-Tal, A., den Hertog, D.: Hidden conic quadratic representation of some nonconvex quadratic optimization problems. Math. Program. 143(1\u20132), 1\u201329 (2014)","journal-title":"Math. Program."},{"key":"105_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0024-3795(83)90148-9","volume":"51","author":"CR Crawford","year":"1983","unstructured":"Crawford, C.R., Moon, Y.S.: Finding a positive definite linear combination of two Hermitian matrices. Linear Algebra Appl. 51, 37\u201348 (1983)","journal-title":"Linear Algebra Appl."},{"key":"105_CR5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857","volume-title":"Trust Region Methods","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust Region Methods. SIAM, Philadelphia (2000)"},{"issue":"1","key":"105_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1080\/10556780410001647186","volume":"19","author":"C Fortin","year":"2004","unstructured":"Fortin, C., Wolkowicz, H.: The trust region subproblem and semidefinite programming. Optim. Methods Softw. 19(1), 41\u201367 (2004)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"105_CR7","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s10898-010-9625-6","volume":"54","author":"J-M Feng","year":"2012","unstructured":"Feng, J.-M., Lin, G.-X., Heu, R.-L., Xia, Y.: Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint. J. Glob. Optim. 54(2), 275\u2013293 (2012)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"105_CR8","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1137\/S1052623497322735","volume":"9","author":"NI Gould","year":"1999","unstructured":"Gould, N.I., Lucidi, S., Roma, M., Toint, P.L.: Solving the trust-region subproblem using the Lanczos method. SIAM J. Optim. 9(2), 504\u2013525 (1999)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"105_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s12532-010-0011-7","volume":"2","author":"NI Gould","year":"2010","unstructured":"Gould, N.I., Robinson, D.P., Thorne, H.S.: On solving trust-region and other regularised subproblems in optimization. Math. Program. Comput. 2(1), 21\u201357 (2010)","journal-title":"Math. Program. Comput."},{"issue":"3","key":"105_CR10","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1137\/08074218X","volume":"31","author":"C-H Guo","year":"2009","unstructured":"Guo, C.-H., Higham, N.J., Tisseur, F.: An improved arc algorithm for detecting definite Hermitian pairs. SIAM J. Matrix Anal. Appl. 31(3), 1131\u20131151 (2009)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"105_CR11","unstructured":"Jegelka, S.: Private communication (2015)"},{"key":"105_CR12","unstructured":"Jian, R., Li, D.: Novel reformulations and efficient algorithms for the generalized trust region subproblem. \n                    arXiv:1707.08706\n                    \n                   (2017)"},{"issue":"2","key":"105_CR13","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s10107-017-1145-4","volume":"169","author":"R Jiang","year":"2018","unstructured":"Jiang, R., Li, D., Wu, B.: SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices. Math. Program. 169(2), 531\u2013563 (2018)","journal-title":"Math. Program."},{"issue":"3","key":"105_CR14","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1137\/S003614450444556X","volume":"47","author":"P Lancaster","year":"2005","unstructured":"Lancaster, P., Rodman, L.: Canonical forms for Hermitian matrix pairs under strict equivalence and congruence. SIAM Rev. 47(3), 407\u2013443 (2005)","journal-title":"SIAM Rev."},{"key":"105_CR15","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"JJ Mor\u00e9","year":"1983","unstructured":"Mor\u00e9, J.J., Sorensen, D.C.: Computing a trust region step. SIAM J. Sci. Stat. Comput. 4, 553\u2013572 (1983)","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"3\u20134","key":"105_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1080\/10556789308805542","volume":"2","author":"JJ Mor\u00e9","year":"1993","unstructured":"Mor\u00e9, J.J.: Generalizations of the trust region problem. Optim. Methods Softw. 2(3\u20134), 189\u2013209 (1993)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"105_CR17","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10589-013-9635-7","volume":"58","author":"TK Pong","year":"2014","unstructured":"Pong, T.K., Wolkowicz, H.: The generalized trust region subproblem. Comput. Optim. Appl. 58(2), 273\u2013322 (2014)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"105_CR18","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF02614438","volume":"77","author":"F Rendl","year":"1997","unstructured":"Rendl, F., Wolkowicz, H.: A semidefinite framework for trust region subproblems with applications to large scale minimization. Math. Program. 77(1), 273\u2013299 (1997)","journal-title":"Math. Program."},{"issue":"3","key":"105_CR19","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1137\/S105262349928887X","volume":"11","author":"M Rojas","year":"2001","unstructured":"Rojas, M., Santos, S.A., Sorensen, D.C.: A new matrix-free algorithm for the large-scale trust-region subproblem. SIAM J. Optim. 11(3), 611\u2013646 (2001)","journal-title":"SIAM J. Optim."},{"key":"105_CR20","volume-title":"Numerical Methods for Large Eigenvalue Problems","author":"Y Saad","year":"1992","unstructured":"Saad, Y.: Numerical Methods for Large Eigenvalue Problems. Manchester University Press, Manchester (1992)"},{"issue":"3","key":"105_CR21","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1137\/0720042","volume":"20","author":"T Steihaug","year":"1983","unstructured":"Steihaug, T.: The conjugate gradient method and trust regions in large scale optimization. SIAM J. Numer. Anal. 20(3), 626\u2013637 (1983)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"105_CR22","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s40314-016-0349-1","volume":"37","author":"M Salahi","year":"2018","unstructured":"Salahi, M., Taati, A.: An efficient algorithm for solving the generalized trust region subproblem. Comput. Appl. Math. 37(1), 395\u2013413 (2018)","journal-title":"Comput. Appl. Math."},{"key":"105_CR23","first-page":"57","volume-title":"Sparse Matrices and Their Uses","author":"PL Toint","year":"1981","unstructured":"Toint, P.L.: Towards an efficient sparsity exploiting Newton method for minimization. In: Duff, I.S. (ed.) Sparse Matrices and Their Uses, pp. 57\u201388. Academic Press, London (1981)"},{"issue":"1","key":"105_CR24","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1137\/S105262340139001X","volume":"14","author":"Y Ye","year":"2003","unstructured":"Ye, Y., Zhang, S.: New results on quadratic minimization. SIAM J. Optim. 14(1), 245\u2013267 (2003)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"105_CR25","doi-asserted-by":"publisher","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(1), 249\u2013281 (2015)","journal-title":"Math. Program."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00105-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00105-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00105-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T23:05:27Z","timestamp":1588892727000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00105-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,9]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["105"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00105-w","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2019,5,9]]},"assertion":[{"value":"14 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}