{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T20:56:15Z","timestamp":1777323375090,"version":"3.51.4"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T00:00:00Z","timestamp":1648598400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T00:00:00Z","timestamp":1648598400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004252","name":"Qatar University","doi-asserted-by":"publisher","award":["NCBP-QUCP-CAS-2020-1"],"award-info":[{"award-number":["NCBP-QUCP-CAS-2020-1"]}],"id":[{"id":"10.13039\/501100004252","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we study the minimization of an indefinite quadratic function over the intersection of balls and linear inequality constraints (QOBL). Using the hyperplanes induced by the intersection of each pair of balls, we show that the optimal solution of QOBL can be found by solving several extended trust-region subproblems (e-TRS). To solve e-TRS, we use the alternating direction method of multipliers approach and a branch and bound algorithm. Numerical experiments show the efficiency of the proposed approach compared to the CVX and the extended adaptive ellipsoid-based algorithm.<\/jats:p>","DOI":"10.1007\/s10957-022-02018-x","type":"journal-article","created":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T16:42:59Z","timestamp":1648658579000},"page":"246-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On Indefinite Quadratic Optimization over the Intersection of Balls and Linear Constraints"],"prefix":"10.1007","volume":"194","author":[{"given":"Temadher A.","family":"Almaadeed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saeid","family":"Ansary Karbasy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maziar","family":"Salahi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1950-8907","authenticated-orcid":false,"given":"Abdelouahed","family":"Hamdi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,30]]},"reference":[{"issue":"8","key":"2018_CR1","doi-asserted-by":"publisher","first-page":"1369","DOI":"10.3390\/sym12081369","volume":"12","author":"TA Almaadeed","year":"2020","unstructured":"Almaadeed, T.A., Taati, A., Salahi, M., Hamdi, A.: The generalized trust-region sub-problem with additional linear inequality constraints\u2014two convex quadratic relaxations and strong duality. Symmetry 12(8), 1369 (2020)","journal-title":"Symmetry"},{"key":"2018_CR2","unstructured":"Ansary Karbasy, S., Hamdi, A., Salahi, M., Taati, A.: An efficient algorithm for large-scale extended trust-region subproblems with non-intersecting linear constraints. Optim. Lett. 1\u201322"},{"issue":"3","key":"2018_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40314-019-0864-y","volume":"38","author":"S Ansary Karbasy","year":"2019","unstructured":"Ansary Karbasy, S., Salahi, M.: A hybrid algorithm for the two-trust-region subproblem. Comput. Appl. Math. 38(3), 1\u201319 (2019)","journal-title":"Comput. Appl. Math."},{"issue":"2","key":"2018_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.3934\/naco.2019046","volume":"10","author":"S Ansary Karbasy","year":"2020","unstructured":"Ansary Karbasy, S., Salahi, M.: Quadratic optimization with two ball constraints. Numer. Algebra Control Optim. 10(2), 165 (2020)","journal-title":"Numer. Algebra Control Optim."},{"issue":"2\u20133","key":"2018_CR5","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10898-008-9372-0","volume":"43","author":"KM Anstreicher","year":"2009","unstructured":"Anstreicher, K.M.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Global Optim. 43(2\u20133), 471\u2013484 (2009)","journal-title":"J. Global Optim."},{"key":"2018_CR6","volume-title":"Estimation Techniques for Distributed Parameter Systems","author":"HT Banks","year":"2012","unstructured":"Banks, H.T., Kunisch, K.: Estimation Techniques for Distributed Parameter Systems. Springer, New York (2012)"},{"issue":"2","key":"2018_CR7","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s10898-017-0521-1","volume":"69","author":"A Beck","year":"2017","unstructured":"Beck, A., Pan, D.: A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints. J. Global Optim. 69(2), 309\u2013342 (2017)","journal-title":"J. Global Optim."},{"issue":"5","key":"2018_CR8","doi-asserted-by":"publisher","first-page":"1770","DOI":"10.1109\/TSP.2007.909342","volume":"56","author":"A Beck","year":"2008","unstructured":"Beck, A., Stoica, P., Li, J.: Exact and approximate solutions of source localization problems. IEEE Trans. Signal Process. 56(5), 1770\u20131778 (2008)","journal-title":"IEEE Trans. Signal Process."},{"key":"2018_CR9","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. Society for Industrial and Applied Mathematics (2001)","DOI":"10.1137\/1.9780898718829"},{"issue":"1","key":"2018_CR10","first-page":"1","volume":"3","author":"S Boyd","year":"2010","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Mach. Learn. 3(1), 1\u2013122 (2010)","journal-title":"Mach. Learn."},{"key":"2018_CR11","volume-title":"Convex Optimization","author":"S Boyd","year":"2009","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2009)"},{"issue":"1","key":"2018_CR12","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1137\/110826862","volume":"23","author":"S Burer","year":"2013","unstructured":"Burer, S., Anstreicher, K.M.: Second-order-cone constraints for extended trust-region subproblems. SIAM J. Optim. 23(1), 432\u2013451 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2018_CR13","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10107-014-0749-1","volume":"149","author":"S Burer","year":"2015","unstructured":"Burer, S., Yang, B.: The trust region subproblem with non-intersecting linear constraints. Math. Program. 149(1), 253\u2013264 (2015)","journal-title":"Math. Program."},{"key":"2018_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-019-01367-2","volume":"181","author":"S Burer","year":"2019","unstructured":"Burer, S., Ye, Y.: Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs. Math. Program. 181, 1\u201317 (2019)","journal-title":"Math. Program."},{"key":"2018_CR15","doi-asserted-by":"crossref","unstructured":"Conn, A.R., Gould, N.I., Toint, P.L.: Trust Region Methods. SIAM (2000)","DOI":"10.1137\/1.9780898719857"},{"issue":"3","key":"2018_CR16","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-014-0195-x","volume":"61","author":"Z Deng","year":"2015","unstructured":"Deng, Z., Fang, S.C., Jin, Q., Lu, C.: Conic approximation to nonconvex quadratic programming with convex quadratic constraints. J. Global Optim. 61(3), 459\u2013478 (2015)","journal-title":"J. Global Optim."},{"issue":"2","key":"2018_CR17","first-page":"03","volume":"9","author":"S Fallahi","year":"2018","unstructured":"Fallahi, S., Salahi, M., Karbasy, S.A.: On SOCP\/SDP formulation of the extended trust region subproblem. Iran. J. Oper. Res. 9(2), 03\u201314 (2018)","journal-title":"Iran. J. Oper. Res."},{"key":"2018_CR18","unstructured":"Grant, M., Boyd, S.: CVX: MATLAB software for disciplined convex programming, version 2.1 (2014)"},{"issue":"1","key":"2018_CR19","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10898-017-0594-x","volume":"70","author":"D Hajinezhad","year":"2018","unstructured":"Hajinezhad, D., Shi, Q.: Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications. J. Global Optim. 70(1), 261\u2013288 (2018)","journal-title":"J. Global Optim."},{"issue":"1","key":"2018_CR20","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1137\/140990309","volume":"26","author":"M Hong","year":"2016","unstructured":"Hong, M., Luo, Z.Q., Razaviyayn, M.: Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems. SIAM J. Optim. 26(1), 337\u2013364 (2016)","journal-title":"SIAM J. Optim."},{"key":"2018_CR21","unstructured":"Hsia, Y., Sheu, R.L.: Trust region subproblem with a fixed number of additional linear inequality constraints has polynomial complexity. arXiv preprint arXiv:1312.1398 (2013)"},{"issue":"1","key":"2018_CR22","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10107-013-0716-2","volume":"147","author":"V Jeyakumar","year":"2014","unstructured":"Jeyakumar, V., Li, G.: Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization. Math. Program. 147(1), 171\u2013206 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"2018_CR23","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/s12597-018-0334-0","volume":"55","author":"M Keyanpour","year":"2018","unstructured":"Keyanpour, M., Osmanpour, N.: On solving quadratically constrained quadratic programming problem with one non-convex constraint. Opsearch 55(2), 320\u2013336 (2018)","journal-title":"Opsearch"},{"issue":"2","key":"2018_CR24","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s11081-015-9294-x","volume":"17","author":"T Lipp","year":"2016","unstructured":"Lipp, T., Boyd, S.: Variations and extension of the convex-concave procedure. Optim. Eng. 17(2), 263\u2013287 (2016)","journal-title":"Optim. Eng."},{"issue":"6","key":"2018_CR25","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1007\/s11590-016-1001-0","volume":"10","author":"M Locatelli","year":"2016","unstructured":"Locatelli, M.: Exactness conditions for an SDP relaxation of the extended trust region problem. Optim. Lett. 10(6), 1141\u20131151 (2016)","journal-title":"Optim. Lett."},{"key":"2018_CR26","series-title":"Handbook of Semidefinite Programming","first-page":"361","volume-title":"Semidefinite Programming Relaxations of Nonconvex Quadratic Optimization","author":"Y Nesterov","year":"2000","unstructured":"Nesterov, Y., Wolkowicz, H., Ye, Y.: Semidefinite Programming Relaxations of Nonconvex Quadratic Optimization. Handbook of Semidefinite Programming, pp. 361\u2013419. Springer, Boston (2000)"},{"key":"2018_CR27","unstructured":"Park, J., Boyd S.: General heuristics for nonconvex quadratically constrained quadratic programming. arXiv preprint arXiv:1703.07870 (2017)"},{"issue":"4","key":"2018_CR28","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1007\/s11590-015-0957-5","volume":"10","author":"M Salahi","year":"2016","unstructured":"Salahi, M., Fallahi, S.: Trust region subproblem with an additional linear inequality constraint. Optim. Lett. 10(4), 821\u2013832 (2016)","journal-title":"Optim. Lett."},{"issue":"1","key":"2018_CR29","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s40314-016-0347-3","volume":"37","author":"M Salahi","year":"2018","unstructured":"Salahi, M., Taati, A.: A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality. Comput. Appl. Math. 37(1), 329\u2013347 (2018)","journal-title":"Comput. Appl. Math."},{"issue":"1","key":"2018_CR30","first-page":"107","volume":"7","author":"M Salahi","year":"2017","unstructured":"Salahi, M., Taati, A.: Alternating direction method of multipliers for the extended trust region subproblem. Iran. J. Numer. Anal. Optim. 7(1), 107\u2013117 (2017)","journal-title":"Iran. J. Numer. Anal. Optim."},{"issue":"2","key":"2018_CR31","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10589-016-9867-4","volume":"66","author":"M Salahi","year":"2017","unstructured":"Salahi, M., Taati, A., Wolkowicz, H.: Local nonglobal minima for solving large-scale extended trust-region subproblems. Comput. Optim. Appl. 66(2), 223\u2013244 (2017)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"2018_CR32","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s10589-017-9913-x","volume":"68","author":"L Xu","year":"2017","unstructured":"Xu, L., Yu, B., Zhang, Y.: An alternating direction and projection algorithm for structure-enforced matrix factorization. Comput. Optim. Appl. 68(2), 333\u2013362 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"2018_CR33","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s10898-010-9630-9","volume":"50","author":"XJ Zheng","year":"2011","unstructured":"Zheng, X.J., Sun, X.L., Li, D.: Nonconvex quadratically constrained quadratic programming: best D.C. decomposition and their SDP represetations. J. Global Optim. 50, 695\u2013712 (2011)","journal-title":"J. Global Optim."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02018-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-022-02018-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02018-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T02:05:04Z","timestamp":1654049104000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-022-02018-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,30]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["2018"],"URL":"https:\/\/doi.org\/10.1007\/s10957-022-02018-x","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,30]]},"assertion":[{"value":"5 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}