On the accuracy of uniform polyhedral approximations of the copositive cone
From MaRDI portal
Publication:2885468
DOI10.1080/10556788.2010.540014zbMath1247.90215OpenAlexW2018913147MaRDI QIDQ2885468
Publication date: 23 May 2012
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/21605
Convex programming (90C25) Quadratic programming (90C20) Linear programming (90C05) Positive matrices and their generalizations; cones of matrices (15B48) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
On standard quadratic programs with exact and inexact doubly nonnegative relaxations ⋮ On conic QPCCs, conic QCQPs and completely positive programs ⋮ An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix ⋮ Improved approximation results on standard quartic polynomial optimization ⋮ Copositivity and constrained fractional quadratic problems ⋮ Optimization under uncertainty and risk: quadratic and copositive approaches ⋮ 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 ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ Copositive programming via semi-infinite optimization ⋮ Factorization and cutting planes for completely positive matrices by copositive projection ⋮ New approximations for the cone of copositive matrices and its dual ⋮ A refined error analysis for fixed-degree polynomial optimization over the simplex ⋮ Analysis of copositive optimization based linear programming bounds on standard quadratic optimization ⋮ A new branch-and-bound algorithm for standard quadratic programming problems ⋮ A simplex algorithm for rational cp-factorization ⋮ Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices ⋮ An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs ⋮ An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution ⋮ An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex ⋮ Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
Uses Software
Cites Work
- On standard quadratic optimization problems
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- On the copositive representation of binary and continuous nonconvex quadratic programs
- A PTAS for the minimization of polynomials of fixed degree over the simplex
- Approximation of the Stability Number of a Graph via Copositive Programming
- Some NP-complete problems in quadratic and nonlinear programming
- An Adaptive Linear Approximation Algorithm for Copositive Programs
- Maxima for Graphs and a New Proof of a Theorem of Turán
This page was built for publication: On the accuracy of uniform polyhedral approximations of the copositive cone
