Polynomial Solvability of Variants of the Trust-Region Subproblem

Recommendations

The trust region subproblem and semidefinite programming*
On solving trust-region and other regularised subproblems in optimization
scientific article; zbMATH DE number 1861590
On Lagrange multipliers of trust-region subproblems
On Lagrange multipliers of trust-region subproblems
Solving polynomial optimization problems via the truncated tangency variety and sums of squares
The trust region subproblem with non-intersecting linear constraints
An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints
scientific article; zbMATH DE number 1399524
The generalized trust region subproblem

Cited in

(28)

Some results for quadratic problems with one or two quadratic constraints
Chebyshev center of the intersection of balls: complexity, relaxation and approximation
An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem
Lower bounds for cubic optimization over the sphere
Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension
On the tightness of SDP relaxations of QCQPs
Refined bounds on the convergence of block Lanczos method for extended trust-region subproblem
A survey of hidden convex optimization
Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
Finding second-order stationary points in constrained minimization: a feasible direction approach
A note on polynomial solvability of the CDT problem
A block Lanczos method for the extended trust-region subproblem
A trust-region algorithm for heterogeneous multiobjective optimization
On Convex Hulls of Epigraphs of QCQPs
Closing the gap between necessary and sufficient conditions for local nonglobal minimizer of trust region subproblem
The convex hull of a quadratic constraint over a polytope
On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints
On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem
KKT-based primal-dual exactness conditions for the Shor relaxation
(Global) optimization: historical notes and recent developments
Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity
Semidefinite representable reformulations for two variants of the trust-region subproblem
Non-convex optimization problems with linear KKT subsystem
Norm-induced cuts: outer approximation for Lipschitzian constraint functions
The mixed integer trust region problem
New notions of simultaneous diagonalizability of quadratic forms with applications to QCQPs
A slightly lifted convex relaxation for nonconvex quadratic programming with ball constraints
On box-constrained total least squares problem

This page was built for publication: Polynomial Solvability of Variants of the Trust-Region Subproblem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5383987)