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)

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

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)