zbMATH — the first resource for mathematics

Second-order-cone constraints for extended trust-region subproblems. (English) Zbl 1298.90062
The classical trust-region subproblem (TRS) minimizes a nonconvex quadratic objective over the unit ball. In this paper, the authors consider extensions of TRS having extra constraints. When two parallel cuts are added to TRS, they show that the resulting nonconvex problem has an exact representation as a semidefinite program with additional linear and second-order-cone (SOC) constraints. For the case where an additional ellipsoidal constraint is added to TRS, resulting in the “two trust-region subproblem” (TTRS), they provide a new relaxation including SOC constraints that strengthens the usual semidefinite programming (SDP) relaxation.

90C20 Quadratic programming
90C22 Semidefinite programming
90C26 Nonconvex programming, global optimization
90C30 Nonlinear programming
PDF BibTeX Cite
Full Text: DOI