Pages that link to "Item:Q2784442"
From MaRDI portal
The following pages link to Approximation of the Stability Number of a Graph via Copositive Programming (Q2784442):
Displaying 50 items.
- A MAX-CUT formulation of 0/1 programs (Q1785732) (← links)
- A primal barrier function phase I algorithm for nonsymmetric conic optimization problems (Q1926650) (← links)
- Separating doubly nonnegative and completely positive matrices (Q1942269) (← links)
- Separation and relaxation for cones of quadratic forms (Q1942279) (← links)
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision (Q1949258) (← links)
- A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation (Q2023115) (← links)
- Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs (Q2070358) (← links)
- Complexity aspects of local minima and related notions (Q2074805) (← links)
- On the complexity of finding a local minimizer of a quadratic function over a polytope (Q2089789) (← links)
- Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
- A note on completely positive relaxations of quadratic problems in a multiobjective framework (Q2114601) (← links)
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations (Q2133420) (← links)
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials (Q2143214) (← links)
- Bounding the separable rank via polynomial optimization (Q2144234) (← links)
- Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets (Q2144552) (← links)
- Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
- On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices (Q2158273) (← links)
- A factorization method for completely positive matrices (Q2174498) (← links)
- Immobile indices and CQ-free optimality criteria for linear copositive programming problems (Q2174923) (← links)
- Testing copositivity via mixed-integer linear programming (Q2226458) (← links)
- Pólya's theorem with zeros (Q2275902) (← links)
- Alternative SDP and SOCP approximations for polynomial optimization (Q2287850) (← links)
- Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices (Q2301196) (← links)
- On the \(k\)-independence number of graphs (Q2317661) (← links)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
- On upper bounding Shannon capacity of graph through generalized conic programming (Q2329653) (← links)
- On an extension of Pólya's Positivstellensatz (Q2342945) (← links)
- Completely positive reformulations for polynomial optimization (Q2349130) (← links)
- Exploiting symmetry in copositive programs via semidefinite hierarchies (Q2349140) (← links)
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme (Q2355798) (← links)
- On NP-hardness of the clique partition -- independence number gap recognition and related problems (Q2368935) (← links)
- On the copositive representation of binary and continuous nonconvex quadratic programs (Q2391001) (← links)
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
- Approximating the cone of copositive kernels to estimate the stability number of infinite graphs (Q2413190) (← links)
- Copositive programming via semi-infinite optimization (Q2435031) (← links)
- Factorization and cutting planes for completely positive matrices by copositive projection (Q2436642) (← links)
- New approximations for the cone of copositive matrices and its dual (Q2452380) (← links)
- Algorithmic copositivity detection by simplicial partition (Q2477530) (← links)
- Stability of polytopes of matrices via affine parameter-dependent Lyapunov functions: asymptotically exact LMI conditions (Q2484239) (← links)
- D.C. versus copositive bounds for standard QP (Q2583183) (← links)
- Copositivity cuts for improving SDP bounds on the clique number (Q2638373) (← links)
- Extended and discretized formulations for the maximum clique problem (Q2655650) (← links)
- A note on the Lasserre hierarchy for different formulations of the maximum independent set problem (Q2661585) (← links)
- Generating irreducible copositive matrices using the stable set problem (Q2664002) (← links)
- The boosted DC algorithm for linearly constrained DC programming (Q2677660) (← links)
- A characterization of the weighted version of McEliece–Rodemich–Rumsey–Schrijver number based on convex quadratic programming (Q2788727) (← links)
- A Comprehensive Analysis of Polyhedral Lift-and-Project Methods (Q2790405) (← links)
- Copositive Programming (Q2802526) (← links)
- On the accuracy of uniform polyhedral approximations of the copositive cone (Q2885468) (← links)
