{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:54:54Z","timestamp":1740142494340,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,5,22]],"date-time":"2021-05-22T00:00:00Z","timestamp":1621641600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,22]],"date-time":"2021-05-22T00:00:00Z","timestamp":1621641600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971231","11771210"],"award-info":[{"award-number":["11971231","11771210"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11822103"],"award-info":[{"award-number":["11822103"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Foundation of Beijing Municipality","award":["Z180005"],"award-info":[{"award-number":["Z180005"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s40314-021-01527-1","type":"journal-article","created":{"date-parts":[[2021,5,22]],"date-time":"2021-05-22T12:02:57Z","timestamp":1621684977000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A linear-time algorithm for minimizing the ratio of quadratic functions with a quadratic constraint"],"prefix":"10.1007","volume":"40","author":[{"given":"Liping","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tengfei","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3522-7446","authenticated-orcid":false,"given":"Yong","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,22]]},"reference":[{"issue":"1","key":"1527_CR1","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1137\/050624418","volume":"17","author":"A Beck","year":"2012","unstructured":"Beck A, Ben-Tal A (2012) On the solution of the Tikhonov regularization of the total least squares problem. SIAM J Optim 17(1):98\u2013118","journal-title":"SIAM J Optim"},{"issue":"1","key":"1527_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s10107-007-0181-x","volume":"118","author":"A Beck","year":"2009","unstructured":"Beck A, Teboulle M (2009) A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid. Math Progr 118(1):13\u201335","journal-title":"Math Progr"},{"issue":"2","key":"1527_CR3","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1137\/040616851","volume":"28","author":"A Beck","year":"2006","unstructured":"Beck A, Ben-Tal A, Teboulle M (2006) Finding a global optimal solution for a quadratically constrained fractional quadratic problem with applications to the regularized total least squares. SIAM J Matrix Anal Appl 28(2):425\u2013445","journal-title":"SIAM J Matrix Anal Appl"},{"key":"1527_CR4","volume-title":"Convex optimization","author":"S Boyd","year":"2003","unstructured":"Boyd S, Vandenberghe L (2003) Convex optimization. Cambridge University Press, Cambridge"},{"issue":"1","key":"1527_CR5","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1080\/02331934.2017.1388378","volume":"68","author":"S Fallahi","year":"2018","unstructured":"Fallahi S, Salahi M, Terlaky T (2018) Minimizing an indefinite quadratic function subject to a single indefinite quadratic constraint. Optimization 68(1):55\u201365","journal-title":"Optimization"},{"key":"1527_CR6","volume-title":"Matrix computations","author":"GH Golub","year":"1996","unstructured":"Golub GH, Van Loan CF (1996) Matrix computations, 3rd edn. The Johns Hopkins University Press, Baltimore","edition":"3"},{"key":"1527_CR7","unstructured":"Grant M, Boyd S (2015) CVX: MATLAB software for disciplined convex programming, version 2.1. http:\/\/cvxr.com\/cvx"},{"issue":"1","key":"1527_CR8","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10107-015-0933-y","volume":"158","author":"E Hazan","year":"2016","unstructured":"Hazan E, Koren T (2016) A linear-time algorithm for trust region problems. Math Progr 158(1):363\u2013381","journal-title":"Math Progr"},{"issue":"3","key":"1527_CR9","doi-asserted-by":"publisher","first-page":"1485","DOI":"10.1137\/16M1065197","volume":"27","author":"N Ho-Nguyen","year":"2017","unstructured":"Ho-Nguyen N, K\u0131l\u0131n\u00e7-Karzan F (2017) A second-order cone based approach for solving the trust-region subproblem and its variants. SIAM J Optim 27(3):1485\u20131512","journal-title":"SIAM J Optim"},{"issue":"4","key":"1527_CR10","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1137\/0613066","volume":"13","author":"J Kuczy\u0144ski","year":"1992","unstructured":"Kuczy\u0144ski J, Wo\u017aniakowski H (1992) Estimating the largest eigenvalue by the power and Lanczos algorithms with a random start. SIAM J Matrix Anal Appl 13(4):1094\u20131122","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"3A","key":"1527_CR11","doi-asserted-by":"publisher","first-page":"885","DOI":"10.11650\/twjm\/1500405873","volume":"14","author":"J Lampe","year":"2010","unstructured":"Lampe J, Voss H (2010) Solving regularized total least squares problems based on eigenproblems. Taiwan J Math 14(3A):885\u2013909","journal-title":"Taiwan J Math"},{"key":"1527_CR12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719628","volume-title":"ARPACK users\u2019s guide","author":"RB Lehoucq","year":"1998","unstructured":"Lehoucq RB, Sorenson DC, Yang C (1998) ARPACK users\u2019s guide. SIAM, Philadelphia"},{"issue":"10","key":"1527_CR13","doi-asserted-by":"publisher","first-page":"2283","DOI":"10.1016\/j.sigpro.2007.04.004","volume":"87","author":"I Markovsky","year":"2007","unstructured":"Markovsky I, Van Huffel S (2007) Overview of total least-squares methods. Sig Process 87(10):2283\u20132302","journal-title":"Sig Process"},{"issue":"8","key":"1527_CR14","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1109\/83.403444","volume":"4","author":"VZ Mesarovic","year":"1995","unstructured":"Mesarovic VZ, Galatsanos NP, Katsaggelos AK (1995) Regularized constrained total least squares image restoration. IEEE Trans Image Process 4(8):1096\u20131108","journal-title":"IEEE Trans Image Process"},{"issue":"3","key":"1527_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1080\/10556789308805542","volume":"2","author":"JJ Mor\u00e9","year":"1993","unstructured":"Mor\u00e9 JJ (1993) Generalization of the trust region problem. Optim Methods Softw 2(3):189\u2013209","journal-title":"Optim Methods Softw"},{"issue":"4","key":"1527_CR16","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1080\/10556788.2015.1029575","volume":"31","author":"VB Nguyen","year":"2016","unstructured":"Nguyen VB, Sheu RL, Xia Y (2016) An SDP approach for quadratic fractional problems with a two-sided quadratic constraint. Optim Methods Softw 31(4):701\u2013719","journal-title":"Optim Methods Softw"},{"issue":"3","key":"1527_CR17","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1137\/S003614450444614X","volume":"49","author":"I P\u00f3lik","year":"2007","unstructured":"P\u00f3lik I, Terlaky T (2007) A survey of the S-lemma. SIAM Rev 49(3):371\u2013418","journal-title":"SIAM Rev"},{"issue":"2","key":"1527_CR18","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1137\/S0895479802419889","volume":"26","author":"RA Renaut","year":"2015","unstructured":"Renaut RA, Guo H (2015) Efficient algorithms for solution of regularized total least squares. SIAM J Matrix Anal Appl 26(2):457\u2013476","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"4","key":"1527_CR19","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1007\/s10543-004-6024-8","volume":"44","author":"DM Sima","year":"2004","unstructured":"Sima DM, Van Huffel S, Golub GH (2004) Regularized total least squares based on quadratic eigenvalue problem solvers. BIT Numer Math 44(4):793\u2013812","journal-title":"BIT Numer Math"},{"issue":"1\u20134","key":"1527_CR20","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"JF Sturm","year":"1999","unstructured":"Sturm JF (1999) Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim Methods Softw 11(1\u20134):625\u2013653","journal-title":"Optim Methods Softw"},{"issue":"1","key":"1527_CR21","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10589-019-00105-w","volume":"74","author":"A Taati","year":"2019","unstructured":"Taati A, Salahi M (2019) A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint. Comput Optim Appl 74(1):195\u2013223","journal-title":"Comput Optim Appl"},{"issue":"1\u20134","key":"1527_CR22","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"KC Toh","year":"1999","unstructured":"Toh KC, Todd MJ, T\u00fct\u00fcnc\u00fc RH (1999) SDPT3\u2014a MATLAB software package for semidefinite programming, version 1.3. Optim Methods Softw 11(1\u20134):545\u2013581","journal-title":"Optim Methods Softw"},{"issue":"2","key":"1527_CR23","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"RH T\u00fct\u00fcnc\u00fc","year":"2003","unstructured":"T\u00fct\u00fcnc\u00fc RH, Toh KC, Todd MJ (2003) Solving semidefinite-quadratic-linear programs using SDPT3. Math Progr 95(2):189\u2013217","journal-title":"Math Progr"},{"issue":"8","key":"1527_CR24","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1007\/s11590-016-1070-0","volume":"11","author":"J Wang","year":"2017","unstructured":"Wang J, Xia Y (2017) A linear-time algorithm for the trust region subproblem based on hidden convexity. Optim Lett 11(8):1639\u20131646","journal-title":"Optim Lett"},{"issue":"5","key":"1527_CR25","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1080\/02331934.2013.840623","volume":"64","author":"Y Xia","year":"2015","unstructured":"Xia Y (2015) On minimizing the ratio of quadratic functions over an ellipsoid. Optimization 64(5):1097\u20131106","journal-title":"Optimization"},{"issue":"1","key":"1527_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40305-019-00286-5","volume":"8","author":"Y Xia","year":"2020","unstructured":"Xia Y (2020) A survey of hidden convex optimization. J Oper Res Soc China 8(1):1\u201328","journal-title":"J Oper Res Soc China"},{"key":"1527_CR27","first-page":"73","volume":"4","author":"VA Yakubovich","year":"1977","unstructured":"Yakubovich VA (1977) S-procedure in nonlinear control theory. Vestnik Leningrad Univ 4:73\u201393","journal-title":"Vestnik Leningrad Univ"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01527-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-021-01527-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01527-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,7]],"date-time":"2021-06-07T11:15:08Z","timestamp":1623064508000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-021-01527-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,22]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["1527"],"URL":"https:\/\/doi.org\/10.1007\/s40314-021-01527-1","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2021,5,22]]},"assertion":[{"value":"22 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 May 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"150"}}