Solving nonconvex optimization problems using outer approximations of the set-copositive cone
From MaRDI portal
Cites work
- A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides
- Adjustable robust solutions of uncertain linear programs
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
- An improved characterisation of the interior of the completely positive cone
- BARON: A general purpose global optimization software package
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- Copositive programming
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Geometric algorithms and combinatorial optimization
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- Improved decision rule approximations for multistage robust optimization via copositive programming
- Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices
- Interplay of non-convex quadratically constrained problems with adjustable robust optimization
- Linearized Robust Counterparts of Two-Stage Robust Optimization Problems with Applications in Operations Management
- On duality theory of conic linear problems.
- On the computational complexity of membership problems for the completely positive cone and its dual
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- Optimization under uncertainty and risk: quadratic and copositive approaches
- Separating doubly nonnegative and completely positive matrices
- Symmetric tensor approximation hierarchies for the completely positive cone
- Testing copositivity via mixed-integer linear programming
- Towards a Practical Volumetric Cutting Plane Method for Convex Programming
This page was built for publication: Solving nonconvex optimization problems using outer approximations of the set-copositive cone
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346538)
