A robust algorithm for quadratic optimization under quadratic constraints

Authors: Tuy, Hoang¹; Hoai-Phuong, N.²

Source: Journal of Global Optimization, Volume 37, Number 4, April 2007 , pp. 557-569(13)

Publisher: Springer

Buy & download fulltext article:

Price: $47.00 plus tax (Refund Policy)

Abstract:

Most existing methods of quadratically constrained quadratic optimization actually solve a refined linear or convex relaxation of the original problem. It turned out, however, that such an approach may sometimes provide an infeasible solution which cannot be accepted as an approximate optimal solution in any reasonable sense. To overcome these limitations a new approach is proposed that guarantees a more appropriate approximate optimal solution which is also stable under small perturbations of the constraints.

Keywords: Nonconvex global optimization; Quadratic optimization under quadratic constraints; Branch-reduce-and-bound successive incumbent trans; Essential optimal solution; Robust solution

Document Type: Research article

DOI: http://dx.doi.org/10.1007/s10898-006-9063-7

Affiliations: 1: Email: htuy@math.ac.vn 2: Email: htphuong@math.ac.vn

Publication date: 2007-04-01