{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:05:30Z","timestamp":1750694730485,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2016,8,20]],"date-time":"2016-08-20T00:00:00Z","timestamp":1471651200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11471325","11571029"],"award-info":[{"award-number":["11471325","11571029"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s11590-016-1070-0","type":"journal-article","created":{"date-parts":[[2016,8,20]],"date-time":"2016-08-20T08:17:03Z","timestamp":1471681023000},"page":"1639-1646","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["A linear-time algorithm for the trust region subproblem based on hidden convexity"],"prefix":"10.1007","volume":"11","author":[{"given":"Jiulin","family":"Wang","sequence":"first","affiliation":[]},{"given":"Yong","family":"Xia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,20]]},"reference":[{"key":"1070_CR1","first-page":"51","volume":"72","author":"A Ben-Tal","year":"1996","unstructured":"Ben-Tal, A., Teboulle, M.: Hidden convexity in some nonconvex quadratically constrained quadratic programming. Math. Program. 72, 51\u201363 (1996)","journal-title":"Math. Program."},{"key":"1070_CR2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719857","volume-title":"Trust Region Methods","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I., Toint, P.L.: Trust Region Methods. Society for Industrial and Applied Mathematics, Philadelphia (2000)"},{"key":"1070_CR3","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0377-2217(95)00199-9","volume":"94","author":"OE Flippo","year":"1996","unstructured":"Flippo, O.E., Jansen, B.: Duality and sensitivity in nonconvex quadratic optimization over an ellipsoid. Eur. J. Oper. Res. 94, 167\u2013178 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"1070_CR4","volume-title":"Matrix Computations","author":"GH Golub","year":"1989","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins University Press, Baltimore (1989)"},{"issue":"2","key":"1070_CR5","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1137\/S1052623497322735","volume":"9","author":"NIM Gould","year":"1999","unstructured":"Gould, N.I.M., 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":"1070_CR6","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s10107-015-0933-y","volume":"158","author":"E Hazan","year":"2016","unstructured":"Hazan, E., Koren, T.: A linear-time algorithm for trust region problems. Math. Program. 158(1), 363\u2013381 (2016)","journal-title":"Math. Program."},{"issue":"4","key":"1070_CR7","doi-asserted-by":"crossref","first-page":"1094","DOI":"10.1137\/0613066","volume":"13","author":"J Kuczynski","year":"1992","unstructured":"Kuczynski, J., Wozniakowski, H.: Estimating the largest eigenvalue by the power and Lanczos algorithms with a random start. SIAM J. Matrix Anal. Appl. 13(4), 1094\u20131122 (1992)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"1070_CR8","first-page":"553","volume":"4","author":"JJ Mor\u00e9","year":"1983","unstructured":"Mor\u00e9, J.J., Sorensen, D.C.: SIAM J. Sci. Statist. Comput. Computing a trust region step 4(3), 553\u2013572 (1983)","journal-title":"Computing a trust region step"},{"issue":"2","key":"1070_CR9","first-page":"372","volume":"27","author":"YuE Nesterov","year":"1983","unstructured":"Nesterov, YuE: A method for unconstrained convex minimization problem with the rate of convergence \n                        $$ O(1\/k^2)$$\n                        \n                            \n                                            \n                                \n                                    O\n                                    (\n                                    1\n                                    \/\n                                    \n                                        k\n                                        2\n                                    \n                                    )\n                                \n                            \n                        \n                    . Soviet Math. Dokl. 27(2), 372\u2013376 (1983)","journal-title":"Soviet Math. Dokl."},{"issue":"2","key":"1070_CR10","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s10589-013-9635-7","volume":"58","author":"TK Pong","year":"2014","unstructured":"Pong, T.K., Wolkowicz, H.: Generalizations of the trust region subproblem. Comput. Optim. Appl. 58(2), 273\u2013322 (2014)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1070_CR11","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1137\/0805016","volume":"5","author":"R Stern","year":"1995","unstructured":"Stern, R., Wolkowicz, H.: Indefinite trust region subproblems and nonsymmetric eigenvalue perturbations. SIAM J. Optim. 5(2), 286\u2013313 (1995)","journal-title":"SIAM J. Optim."},{"key":"1070_CR12","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex\u2013concave optimization (unpublished manuscript) (2008)"},{"issue":"6","key":"1070_CR13","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1007\/s11590-014-0812-0","volume":"9","author":"S Wang","year":"2015","unstructured":"Wang, S., Xia, Y.: Strong duality for generalized trust region subproblem: S-lemma with interval bounds. Optim. Lett. 9(6), 1063\u20131073 (2015)","journal-title":"Optim. Lett."},{"issue":"1","key":"1070_CR14","doi-asserted-by":"crossref","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":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1070-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1070-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1070-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1070-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,10]],"date-time":"2017-11-10T01:30:51Z","timestamp":1510277451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1070-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,20]]},"references-count":14,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["1070"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1070-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2016,8,20]]}}}