Tuesday, 15:15 - 15:40 h, Room: MA 005


Kurt Anstreicher
Second-order-cone constraints for extended trust-region subproblems

Coauthor: Sam Burer


The classical trust-region subproblem (TRS) minimizes a nonconvex quadratic objective over the unit ball. We consider extensions of TRS having additional constraints. It is known that TRS, and the extension of TRS that adds a single linear inequality, both admit convex programming representations. We show that when two parallel linear inequalities are added to
TRS, the resulting nonconvex problem has an exact convex representation as a semidefinite programming (SDP) problem with additional linear and second-order-cone constraints. For the case where an additional ellipsoidal constraint is added to TRS, resulting in the well-known "two trust-region
subproblem'' (TTRS), we describe a new relaxation including second-order-cone constraints that significantly strengthens the usual SDP relaxation. Numerical experiments show that the strengthened relaxation provides an exact solution of TTRS in most instances, although the theoretical complexity of TTRS
remains an open problem.


Talk 1 of the invited session Tue.3.MA 005
"Convex relaxations for nonconvex optimization problems" [...]
Cluster 14
"Mixed-integer nonlinear programming" [...]


  There are three major facts that should be watched out for in all payday loans in the United States. But at the same time, it acts only with sexual arousal. Viagra has a number of advantages in comparison with injections in the sexual organ or other procedures aimed at treatment of impotency.