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

Recommendations

On Conic Relaxations of Generalization of the Extended Trust Region Subproblem
A second-order cone based approach for solving the trust-region subproblem and its variants
A two-variable approach to the two-trust-region subproblem
The trust region subproblem with non-intersecting linear constraints
A necessary and sufficient condition of convexity for SOC reformulation of trust-region subproblem with two intersecting cuts

Cited in

(83)

On the tightness of an SDP relaxation for homogeneous QCQP with three real or four complex homogeneous constraints
Convex hull results on quadratic programs with non-intersecting constraints
Two-stage stochastic standard quadratic optimization
Semidefinite representable reformulations for two variants of the trust-region subproblem
A hybrid algorithm for the two-trust-region subproblem
Exact second-order cone programming relaxations for some nonconvex minimax quadratic optimization problems
On the complexity of quadratic programming with two quadratic constraints
On box-constrained total least squares problem
Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
The generalized trust region subproblem
Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues
Trust region subproblem with an additional linear inequality constraint
Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
Solving generalized CDT problems via two-parameter eigenvalues
An efficient algorithm for the extended trust-region subproblem with two linear constraints
Globally solving extended trust region subproblems with two intersecting cuts
Quadratic optimization over one first-order cone
Conic approximation to nonconvex quadratic programming with convex quadratic constraints
On convergence of the block Lanczos method for the CDT subproblem
A slightly lifted convex relaxation for nonconvex quadratic programming with ball constraints
Solving the trust-region subproblem by a generalized eigenvalue problem
Interplay of non-convex quadratically constrained problems with adjustable robust optimization
A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
Exact dual bounds for some nonconvex minimax quadratic optimization problems
Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem
The convex hull of a quadratic constraint over a polytope
Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
Convergence to a second-order point of a trust-region algorithm with a nonmonotonic penalty parameter for constrained optimization
A necessary and sufficient condition of convexity for SOC reformulation of trust-region subproblem with two intersecting cuts
Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
On obtaining the convex hull of quadratic inequalities via aggregations
Convex envelopes of separable functions over regions defined by separable functions of the same type
On the tightness of SDP relaxations of QCQPs
Solving two-trust-region subproblems using semidefinite optimization with eigenvector branching
A survey of hidden convex optimization
A second-order cone based approach for solving the trust-region subproblem and its variants
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
Exactness conditions for an SDP relaxation of the extended trust region problem
A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints
Representing quadratically constrained quadratic programs as generalized copositive programs
How to convexify the intersection of a second order cone and a nonconvex quadratic
Accelerating the branch and bound algorithm for solving the extended trust-region subproblems
Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
Quadratic programs with hollows
A linear-time algorithm for generalized trust region subproblems
A block Lanczos method for the extended trust-region subproblem
An iterative algorithm for the conic trust region subproblem
A computational study of global optimization solvers on two trust region subproblems
Finding minimum volume circumscribing ellipsoids using generalized copositive programming
On indefinite quadratic optimization over the intersection of balls and linear constraints
Parametric approach for solving quadratic fractional optimization with a linear and a quadratic constraint
Kronecker product constraints with an application to the two-trust-region subproblem
New results on narrowing the duality gap of the extended Celis-Dennis-Tapia problem
The trust region subproblem with non-intersecting linear constraints
New results on eliminating the duality gap of the second-order-cone reformulation for extended trust-region subproblem with two intersecting cuts
Quadratic optimization with two ball constraints
scientific article; zbMATH DE number 6961226 (Why is no real title available?)
On Conic Relaxations of Generalization of the Extended Trust Region Subproblem
Quadratic optimization over a second-order cone with linear equality constraints
On Convex Hulls of Epigraphs of QCQPs
Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem
Some results for quadratic problems with one or two quadratic constraints
A note on polynomial solvability of the CDT problem
A two-variable approach to the two-trust-region subproblem
Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow
KKT-based primal-dual exactness conditions for the Shor relaxation
On globally solving the extended trust-region subproblems
Optimization under uncertainty and risk: quadratic and copositive approaches
On Chebyshev center of the intersection of two ellipsoids
(Global) optimization: historical notes and recent developments
A gentle, geometric introduction to copositive optimization
Local nonglobal minima for solving large-scale extended trust-region subproblems
scientific article; zbMATH DE number 5232303 (Why is no real title available?)
Coderivatives related to parametric extended trust region subproblem and their applications
Exact computable representation of some second-order cone constrained quadratic programming problems
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
Exactness Conditions for Semidefinite Programming Relaxations of Generalization of the Extended Trust Region Subproblem
Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization

This page was built for publication: Second-order-cone constraints for extended trust-region subproblems

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