Conic approximation to nonconvex quadratic programming with convex quadratic constraints
From MaRDI portal
Publication:2018510
Recommendations
- Conic approximation to quadratic optimization with linear complementarity constraints
- Adaptive computable approximation to cones of nonnegative quadratic functions
- A new algorithm for solving nonconvex quadratic programming over an ice cream cone
- An efficient method for non-convex QCQP problems
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
Cites work
- scientific article; zbMATH DE number 3903874 (Why is no real title available?)
- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- Adaptive computable approximation to cones of nonnegative quadratic functions
- BARON: A general purpose global optimization software package
- Copositive realxation for genera quadratic programming
- KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- New Results on Quadratic Minimization
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- On Cones of Nonnegative Quadratic Functions
- Quadratic programming with one negative eigenvalue is NP-hard
- Second-order-cone constraints for extended trust-region subproblems
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- State Constraints in Convex Control Problems of Bolza
- Trust Region Methods
Cited in
(22)- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- On indefinite quadratic optimization over the intersection of balls and linear constraints
- Further development in convex conic reformulation of geometric nonconvex conic optimization problems
- Conic approximation to quadratic optimization with linear complementarity constraints
- Adaptive computable approximation to cones of nonnegative quadratic functions
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems
- scientific article; zbMATH DE number 6612550 (Why is no real title available?)
- A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints
- Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron
- A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs
- A hybrid method for solving non-convex min-max quadratic fractional problems under quadratic constraints
- Globally solving extended trust region subproblems with two intersecting cuts
- Quadratic optimization over one first-order cone
- On linear conic relaxation of discrete quadratic programs
- Interplay of non-convex quadratically constrained problems with adjustable robust optimization
- On solving quadratically constrained quadratic programming problem with one non-convex constraint
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- Solving a class of two-stage stochastic nonlinear integer programs using value functions
- A new algorithm for solving nonconvex quadratic programming over an ice cream cone
This page was built for publication: Conic approximation to nonconvex quadratic programming with convex quadratic constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018510)
