{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:24:19Z","timestamp":1740108259504,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T00:00:00Z","timestamp":1689206400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T00:00:00Z","timestamp":1689206400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Beijing Natural Science Foundation","award":["Z180005"],"award-info":[{"award-number":["Z180005"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11822103","12171021"],"award-info":[{"award-number":["11822103","12171021"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Scientific Project of Capital University of Economics and Businiess","award":["XRZ2022068"],"award-info":[{"award-number":["XRZ2022068"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s00186-023-00827-y","type":"journal-article","created":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T18:02:10Z","timestamp":1689271330000},"page":"93-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints"],"prefix":"10.1007","volume":"98","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9531-9791","authenticated-orcid":false,"given":"Zhuoyi","family":"Xu","sequence":"first","affiliation":[]},{"given":"Linbin","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3522-7446","authenticated-orcid":false,"given":"Yong","family":"Xia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,13]]},"reference":[{"key":"827_CR1","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1137\/07070601X","volume":"19","author":"W Ai","year":"2009","unstructured":"Ai W, Zhang S (2009) Strong duality for the CDT subproblem: a necessary and sufficient condition. SIAM J Optim 19:1735\u20131756","journal-title":"SIAM J Optim"},{"issue":"2","key":"827_CR2","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1137\/S1052623401392354","volume":"13","author":"A Ben-Tal","year":"2002","unstructured":"Ben-Tal A, Nemirovski A, Roos C (2002) Robust solutions of uncertain quadratic and conic quadratic problems. SIAM J Optim 13(2):535\u2013560","journal-title":"SIAM J Optim"},{"key":"827_CR3","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1137\/15M1009871","volume":"26","author":"D Bienstock","year":"2016","unstructured":"Bienstock D (2016) A note on polynomial solvability of the CDT problem. SIAM J Optim 26:488\u2013498","journal-title":"SIAM J Optim"},{"key":"827_CR4","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0024-3795(93)90465-Z","volume":"188","author":"S Boyd","year":"1993","unstructured":"Boyd S, El Ghaoui L (1993) Method of centers for minimizing generalized eigenvalues. Linear Algorithm Appl 188:63\u2013111","journal-title":"Linear Algorithm Appl"},{"key":"827_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge"},{"issue":"1","key":"827_CR6","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1137\/110826862","volume":"23","author":"SK Burer","year":"2013","unstructured":"Burer SK (2013) Second-order-cone constraints for extended trust-region subproblems. SIAM J Optim 23(1):432\u2013451","journal-title":"SIAM J Optim"},{"key":"827_CR7","first-page":"71","volume-title":"Numerical optimization","author":"M Celis","year":"1985","unstructured":"Celis M, Dennis J, Tapia R (1985) A trust region strategy for nonlinear equality constrained optimization. In: Boggs P, Byrd R, Schnabel R (eds) Numerical optimization. SIAM, Philadelphia, pp 71\u201382"},{"key":"827_CR8","doi-asserted-by":"crossref","unstructured":"Cen X, Xia Y, Gao R, Yang T (2020) On Chebyshev center of the intersection of two ellipsoids. In: Le Thi H, Le H, Pham Dinh T (eds) Optimization of complex systems: theory, models, algorithms and applications, advances in intelligent systems and computing, vol 991. Springer, Cham, pp 135\u2013144","DOI":"10.1007\/978-3-030-21803-4_14"},{"key":"827_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1023\/A:1009739827008","volume":"2","author":"M Fu","year":"1998","unstructured":"Fu M, Luo Z, Ye Y (1998) Approximation algorithms for quadratic programming. J Comb Optim 2:29\u201350","journal-title":"J Comb Optim"},{"issue":"6","key":"827_CR10","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M Goemans","year":"1995","unstructured":"Goemans M, Williamson D (1995) Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J ACM 42(6):1115\u20131145","journal-title":"J ACM"},{"key":"827_CR11","unstructured":"Grant M, Boyd S (2013) CVX: Matlab software for disciplined convex programming, version 2.0 beta. http:\/\/cvxr.com\/cvx"},{"issue":"1","key":"827_CR12","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 Program 158(1):363\u2013381","journal-title":"Math Program"},{"issue":"2","key":"827_CR13","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1137\/070679041","volume":"19","author":"S He","year":"2008","unstructured":"He S, Luo Z, Nie J, Zhang S (2008) Semidefnite relaxation bounds for indefinite homogeneous quadratic optimization. SIAM J Optim 19(2):503\u2013523","journal-title":"SIAM J Optim"},{"issue":"1","key":"827_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1026454804250","volume":"108","author":"D Henrion","year":"2001","unstructured":"Henrion D, Tarbouriech S, Arzelier D (2001) LMI approximations for the radius of the intersection of ellipsoids: survey. J Optim Theory Appl 108(1):1\u201328","journal-title":"J Optim Theory Appl"},{"key":"827_CR15","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:1485\u20131512","journal-title":"SIAM J Optim"},{"key":"827_CR16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970203","volume-title":"An algorithmic theory of number, graphs and convexity","author":"L Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz L (1986) An algorithmic theory of number, graphs and convexity. SIAM, Philadelphia"},{"issue":"1","key":"827_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/050642691","volume":"18","author":"Z Luo","year":"2007","unstructured":"Luo Z, Sidiropoulos N, Tseng P, Zhang S (2007) Approximation bounds for quadratic optimization with homogeneous quadratic constraints. SIAM J Optim 18(1):1\u201328","journal-title":"SIAM J Optim"},{"key":"827_CR18","volume-title":"Informational complexity and efficient methods for solution of convex extremal problems","author":"A Nemirovski","year":"1983","unstructured":"Nemirovski A, Yudin D (1983) Informational complexity and efficient methods for solution of convex extremal problems. Wiley, New York"},{"key":"827_CR19","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s101070050100","volume":"86","author":"A Nemirovski","year":"1999","unstructured":"Nemirovski A, Roos C, Terlaky T (1999) On maximization of quadratic form over intersection of ellipsoids with common center. Math Program 86:463\u2013473","journal-title":"Math Program"},{"key":"827_CR20","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1080\/10556789808805690","volume":"9","author":"Y Nesterov","year":"1998","unstructured":"Nesterov Y (1998) Semidefinite relaxation and nonconvex quadratic optimization. Optim Method Softw 9:141\u2013160","journal-title":"Optim Method Softw"},{"key":"827_CR21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-point polynomial methods in convex programming","author":"Y Nesterov","year":"1994","unstructured":"Nesterov Y, Nemirovski A (1994) Interior-point polynomial methods in convex programming. SIAM, Philadelphia"},{"key":"827_CR22","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1137\/S1052623494261520","volume":"7","author":"J Peng","year":"1997","unstructured":"Peng J, Yuan Y (1997) Optimality conditions for the minimization of a quadratic with two quadratic constraints. SIAM J Optim 7:579\u2013594","journal-title":"SIAM J Optim"},{"issue":"3","key":"827_CR23","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1023\/A:1021798932766","volume":"99","author":"B Polyak","year":"1998","unstructured":"Polyak B (1998) Convexity of quadratic transformations and its use in control and optimization. J Optim Theory Appl 99(3):553\u2013583","journal-title":"J Optim Theory Appl"},{"issue":"3","key":"827_CR24","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1137\/15100624X","volume":"26","author":"S Sakaue","year":"2016","unstructured":"Sakaue S, Nakatsukasa Y, Takeda A, Iwata S (2016) Solving generalized CDT problems via two-parameter eigenvalues. SIAM J Optim 26(3):1669\u20131694","journal-title":"SIAM J Optim"},{"key":"827_CR25","volume-title":"Theory of linear and integer programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver A (1986) Theory of linear and integer programming. Wiley, New York"},{"issue":"1","key":"827_CR26","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/21M1416746","volume":"33","author":"M Song","year":"2023","unstructured":"Song M, Liu H, Wang J, Yong Xia (2023) On local minimizers of quadratically constrained nonconvex homogeneous quadratic optimization with at most two constraints. SIAM J Optim 33(1):267\u2013293","journal-title":"SIAM J Optim"},{"key":"827_CR27","first-page":"226","volume":"37","author":"S Tarasov","year":"1988","unstructured":"Tarasov S, Khachiyan L, Erlikh I (1988) The method of inscribed ellipsoids. Soviet Math Dokl 37:226\u2013230","journal-title":"Soviet Math Dokl"},{"key":"827_CR28","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-020-01589-9","volume":"193","author":"A Wang","year":"2022","unstructured":"Wang A, K\u0131l\u0131n\u00e7-Karzan F (2022) On the tightness of SDP relaxations of QCQPs. Math Program 193:33\u201373","journal-title":"Math Program"},{"key":"827_CR29","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:1639\u20131646","journal-title":"Optim Lett"},{"key":"827_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4381-7","volume-title":"Handbook of semidefinite programming: theory, algorithms, and applications","author":"H Wolkowicz","year":"2000","unstructured":"Wolkowicz H, Saigal R, Vandenberghe L (2000) Handbook of semidefinite programming: theory, algorithms, and applications. Springer, Boston"},{"key":"827_CR31","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1007\/s11590-017-1177-y","volume":"12","author":"Z Wu","year":"2018","unstructured":"Wu Z, Xia Y, Wang S (2018) Approximating the weighted maximin dispersion problem over an $$\\ell _p$$-ball: SDP relaxation is misleading. Optim Lett 12:875\u2013883","journal-title":"Optim Lett"},{"key":"827_CR32","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\u201328","journal-title":"J Oper Res Soc China"},{"key":"827_CR33","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10107980012a","volume":"84","author":"Y Ye","year":"1999","unstructured":"Ye Y (1999) Approximating quadratic programming with bound and quadratic constraints. Math Program 84:219\u2013226","journal-title":"Math Program"},{"key":"827_CR34","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1137\/S105262340139001X","volume":"14","author":"Y Ye","year":"2003","unstructured":"Ye Y, Zhang S (2003) New results on quadratic minimization. SIAM J Optim 14:245\u2013267","journal-title":"SIAM J Optim"},{"key":"827_CR35","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10107-015-0893-2","volume":"151","author":"Y Yuan","year":"2015","unstructured":"Yuan Y (2015) Recent advances in trust region algorithms. Math Program 151:249\u2013281","journal-title":"Math Program"},{"issue":"2","key":"827_CR36","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1007\/s10878-022-00881-y","volume":"44","author":"T Zhang","year":"2022","unstructured":"Zhang T, Xia Y (2022) Comment on \u201cApproximation algorithms for quadratic programming\u2019\u2019. J Comb Optim 44(2):1099\u20131103","journal-title":"J Comb Optim"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-023-00827-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00186-023-00827-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-023-00827-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T14:03:16Z","timestamp":1692712996000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00186-023-00827-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,13]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["827"],"URL":"https:\/\/doi.org\/10.1007\/s00186-023-00827-y","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"type":"print","value":"1432-2994"},{"type":"electronic","value":"1432-5217"}],"subject":[],"published":{"date-parts":[[2023,7,13]]},"assertion":[{"value":"21 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}