Abstract
AbstractIn 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.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization
Reference33 articles.
1. Almaadeed, T.A., Taati, A., Salahi, M., Hamdi, A.: The generalized trust-region sub-problem with additional linear inequality constraints—two convex quadratic relaxations and strong duality. Symmetry 12(8), 1369 (2020)
2. 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–22
3. Ansary Karbasy, S., Salahi, M.: A hybrid algorithm for the two-trust-region subproblem. Comput. Appl. Math. 38(3), 1–19 (2019)
4. Ansary Karbasy, S., Salahi, M.: Quadratic optimization with two ball constraints. Numer. Algebra Control Optim. 10(2), 165 (2020)
5. Anstreicher, K.M.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Global Optim. 43(2–3), 471–484 (2009)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献