Exact computable representation of some second-order cone constrained quadratic programming problems
From MaRDI portal
Recommendations
- The convex hull of a quadratic constraint over a polytope
- Representing quadratically constrained quadratic programs as generalized copositive programs
- Quadratic optimization over a second-order cone with linear equality constraints
- On the complexity of quadratic programming with two quadratic constraints
- Computable representation of the cone of nonnegative quadratic forms over a general second-order cone and its application to completely positive programming
Cites work
- A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems
- New Results on Quadratic Minimization
- On Cones of Nonnegative Quadratic Functions
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- On the set-semidefinite representation of nonconvex quadratic programs with cone constraints
- Quadratic programming with one negative eigenvalue is NP-hard
- Representing quadratically constrained quadratic programs as generalized copositive programs
- Second-order-cone constraints for extended trust-region subproblems
- State Constraints in Convex Control Problems of Bolza
Cited in
(10)- Semidefinite representable reformulations for two variants of the trust-region subproblem
- On subspace properties of the quadratically constrained quadratic program
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
- Globally solving extended trust region subproblems with two intersecting cuts
- Quadratic optimization over one first-order cone
- The \(Q\) method for second order cone programming
- Quadratic optimization over a polyhedral cone
- The convex hull of a quadratic constraint over a polytope
- Cardinality constrained portfolio selection problem: a completely positive programming approach
- Quadratic optimization over a second-order cone with linear equality constraints
This page was built for publication: Exact computable representation of some second-order cone constrained quadratic programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q384217)
