Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices
From MaRDI portal
Publication:2301196
Abstract: Motivated by the expressive power of completely positive programming to encode hard optimization problems, many approximation schemes for the completely positive cone have been proposed and successfully used. Most schemes are based on outer approximations, with the only inner approximations available being linear programming based methods proposed by Bundfuss and D"ur and also Y{i}ld{i}r{i}m, and a semidefinite programming based method proposed by Lasserre. In this paper, we propose the use of the cone of nonnegative scaled diagonally dominant matrices as a natural inner approximation to the completely positive cone. Using projections of this cone we derive new graph-based second-order cone approximation schemes for completely positive programming, leading to both uniform and problem-dependent hierarchies. This offers a compromise between the expressive power of semidefinite programming and the speed of linear programming based approaches. Numerical results on random problems, standard quadratic programs and the stable set problem are presented to illustrate the effectiveness of our approach.
Recommendations
- New approximations for the cone of copositive matrices and its dual
- Approximation of copositive programming via linear programming using second order sum of square decomposition
- Optimization over structured subsets of positive semidefinite matrices via column generation
- On the accuracy of uniform polyhedral approximations of the copositive cone
- An adaptive linear approximation algorithm for copositive programs
Cites work
- An adaptive linear approximation algorithm for copositive programs
- Approximation of the stability number of a graph via copositive programming
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- Convex Analysis
- Copositive programming
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- scientific article; zbMATH DE number 1933860 (Why is no real title available?)
- Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis
- Matrix Analysis
- New approximations for the cone of copositive matrices and its dual
- On factor width and symmetric \(H\)-matrices
- On the accuracy of uniform polyhedral approximations of the copositive cone
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Optimization over structured subsets of positive semidefinite matrices via column generation
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Special issue: Selected papers of the international workshop on global optimization, GO '99. Firenze, Italy, 1999
- Sum of squares basis pursuit with linear and second order cone programming
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Variational Analysis
Cited in
(11)- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems
- Symmetric tensor approximation hierarchies for the completely positive cone
- scientific article; zbMATH DE number 7625166 (Why is no real title available?)
- A Sum of Squares Characterization of Perfect Graphs
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Approximation hierarchies for copositive cone over symmetric cone and their comparison
- On the longest chain of faces of the completely positive and copositive cones
- Relaxations of KKT conditions do not strengthen finite RLT and SDP-RLT bounds for nonconvex quadratic programs
- Solving nonconvex optimization problems using outer approximations of the set-copositive cone
This page was built for publication: Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301196)
