A copositive formulation for the stability number of infinite graphs
From MaRDI portal
Publication:344928
DOI10.1007/s10107-015-0974-2zbMath1361.05091arXiv1305.1819OpenAlexW3099124748MaRDI QIDQ344928
Leonhard Frerick, Mirjam Dür, Cristian Dobre, Frank Vallentin
Publication date: 25 November 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.1819
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Infinite graphs (05C63)
Related Items
Approximating the cone of copositive kernels to estimate the stability number of infinite graphs, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017, Complete positivity and distance-avoiding sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scaling relationship between the copositive cone and Parrilo's first level approximation
- Lower bounds for measurable chromatic numbers
- Spherical codes and designs
- On standard quadratic optimization problems
- Semidefinite programming relaxations for semialgebraic problems
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- A semidefinite programming hierarchy for packing problems in discrete geometry
- Improved Delsarte bounds for spherical codes in small dimensions
- Hilbert distances and positive definite functions
- Positive definite functions on spheres
- Global Optimization with Polynomials and the Problem of Moments
- Approximation of the Stability Number of a Graph via Copositive Programming
- Spherical Sets Avoiding a Prescribed Set of Angles
- Upper bounds for packings of spheres of several radii
- Convexity
- On copositive programming and standard quadratic optimization problems
- Lectures on Choquet's theorem
