Approximation of the stability number of a graph via copositive programming
From MaRDI portal
Recommendations
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- Copositive programming motivated bounds on the stability and the chromatic numbers
- On LP-based approximation for copositive formulation of stable set problem
- A copositive formulation for the stability number of infinite graphs
- On the accuracy of uniform polyhedral approximations of the copositive cone
Cited in
(only showing first 100 items - show all)- Simple ingredients leading to very efficient heuristics for the maximum clique problem
- On the polyhedral lift-and-project methods and the fractional stable set polytope
- Searching for critical angles in a convex cone
- A quantitative Pólya's theorem with zeros
- LP-oriented upper bounds for the weighted stability number of a graph
- LP-based tractable subcones of the semidefinite plus nonnegative cone
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
- Optimization over structured subsets of positive semidefinite matrices via column generation
- On the Lovász theta function and some variants
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
- A MAX-CUT formulation of 0/1 programs
- A primal barrier function phase I algorithm for nonsymmetric conic optimization problems
- Separating doubly nonnegative and completely positive matrices
- Separation and relaxation for cones of quadratic forms
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation
- Polyhedral approximations of the semidefinite cone and their application
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
- Complexity aspects of local minima and related notions
- On the complexity of finding a local minimizer of a quadratic function over a polytope
- Continuous cubic formulations for cluster detection problems in networks
- A note on completely positive relaxations of quadratic problems in a multiobjective framework
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials
- Bounding the separable rank via polynomial optimization
- Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets
- Certifying the global optimality of quartic minimization over the sphere
- On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices
- A factorization method for completely positive matrices
- Immobile indices and CQ-free optimality criteria for linear copositive programming problems
- Testing copositivity via mixed-integer linear programming
- Pólya's theorem with zeros
- Alternative SDP and SOCP approximations for polynomial optimization
- Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices
- On the \(k\)-independence number of graphs
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
- On upper bounding Shannon capacity of graph through generalized conic programming
- On an extension of Pólya's Positivstellensatz
- Completely positive reformulations for polynomial optimization
- Exploiting symmetry in copositive programs via semidefinite hierarchies
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
- On NP-hardness of the clique partition -- independence number gap recognition and related problems
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
- Approximating the cone of copositive kernels to estimate the stability number of infinite graphs
- 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
- Algorithmic copositivity detection by simplicial partition
- Stability of polytopes of matrices via affine parameter-dependent Lyapunov functions: asymptotically exact LMI conditions
- D.C. versus copositive bounds for standard QP
- A dynamic inequality generation scheme for polynomial programming
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- Copositivity cuts for improving SDP bounds on the clique number
- Extended and discretized formulations for the maximum clique problem
- A note on the Lasserre hierarchy for different formulations of the maximum independent set problem
- Generating irreducible copositive matrices using the stable set problem
- The boosted DC algorithm for linearly constrained DC programming
- A characterization of the weighted version of McEliece-Rodemich-Rumsey-Schrijver number based on convex quadratic programming
- A comprehensive analysis of polyhedral lift-and-project methods
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs
- Copositive programming
- Symmetric tensor approximation hierarchies for the completely positive cone
- On the accuracy of uniform polyhedral approximations of the copositive cone
- Matrix relaxations in combinatorial optimization
- Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology
- Least squares approximation to the distribution of project completion times with Gaussian uncertainty
- Conic formulations of graph homomorphisms
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
- An iterative scheme for valid polynomial inequality generation in binary polynomial programming
- Computing the distance between the linear matrix pencil and the completely positive cone
- Gap, cosum and product properties of the \(\theta ^{\prime}\) bound on the clique number
- Depth-first simplicial partition for copositivity detection, with an application to MaxClique
- On LP-based approximation for copositive formulation of stable set problem
- On conic QPCCs, conic QCQPs and completely positive programs
- Robust quadratic programming with mixed-integer uncertainty
- Matrices with high completely positive semidefinite rank
- A copositive formulation for the stability number of infinite graphs
- Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone
- Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- Sparse solutions to random standard quadratic optimization problems
- scientific article; zbMATH DE number 4076980 (Why is no real title available?)
- Moment approximations for set-semidefinite polynomials
- A note on set-semidefinite relaxations of nonconvex quadratic programs
- Scaling relationship between the copositive cone and Parrilo's first level approximation
- Copositive optimization -- recent developments and applications
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- An improved algorithm to test copositivity
- Improved Conic Reformulations for $K$-means Clustering
- Characterization of polynomials whose large powers have all positive coefficients
- On the computational complexity of membership problems for the completely positive cone and its dual
- A new branch-and-bound algorithm for standard quadratic programming problems
- A complete semidefinite algorithm for detecting copositive matrices and tensors
- Handelman's hierarchy for the maximum stable set problem
- The \(\mathcal A\)-truncated \(K\)-moment problem
- Contribution of copositive formulations to the graph partitioning problem
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
- Conic programming reformulations of two-stage distributionally robust linear programs over Wasserstein balls
This page was built for publication: Approximation of the stability number of a graph via copositive programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784442)
