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 dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189) (← links)
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs (Q279802) (← links)
- Conic formulations of graph homomorphisms (Q295829) (← links)
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- Computing the distance between the linear matrix pencil and the completely positive cone (Q301674) (← links)
- On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
- Matrices with high completely positive semidefinite rank (Q344893) (← links)
- A copositive formulation for the stability number of infinite graphs (Q344928) (← links)
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets (Q360522) (← links)
- Sparse solutions to random standard quadratic optimization problems (Q378104) (← links)
- Moment approximations for set-semidefinite polynomials (Q382904) (← links)
- A note on set-semidefinite relaxations of nonconvex quadratic programs (Q386483) (← links)
- Scaling relationship between the copositive cone and Parrilo's first level approximation (Q395830) (← links)
- Copositive optimization -- recent developments and applications (Q421783) (← links)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
- An improved algorithm to test copositivity (Q427387) (← links)
- On the computational complexity of membership problems for the completely positive cone and its dual (Q461444) (← links)
- Handelman's hierarchy for the maximum stable set problem (Q480821) (← links)
- The \(\mathcal A\)-truncated \(K\)-moment problem (Q486690) (← links)
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization (Q496589) (← links)
- Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs (Q517302) (← links)
- An axiomatic duality framework for the theta body and related convex corners (Q517307) (← links)
- Linear conic formulations for two-party correlations and values of nonlocal games (Q517312) (← links)
- A robust Lagrangian-DNN method for a class of quadratic optimization problems (Q523570) (← links)
- Quadratic factorization heuristics for copositive programming (Q542052) (← links)
- Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
- An algorithm for determining copositive matrices (Q636239) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Lower bounds on nonnegative rank via nonnegative nuclear norms (Q745679) (← links)
- Copositive and semidefinite relaxations of the quadratic assignment problem (Q834180) (← links)
- The difference between \(5\times 5\) doubly nonnegative and completely positive matrices (Q840651) (← links)
- Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
- A linear programming reformulation of the standard quadratic optimization problem (Q868634) (← links)
- A characterization of Delsarte's linear programming bound as a ratio bound (Q876308) (← links)
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials (Q877197) (← links)
- Interiors of completely positive cones (Q897047) (← links)
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) (← links)
- Exploiting equalities in polynomial programming (Q935230) (← links)
- Effective Pólya semi-positivity for non-negative polynomials on the simplex (Q945921) (← links)
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
- Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196) (← links)
- On the polyhedral lift-and-project methods and the fractional stable set polytope (Q1015326) (← links)
- Searching for critical angles in a convex cone (Q1016350) (← links)
- A quantitative Pólya's theorem with zeros (Q1030259) (← links)
- LP-based tractable subcones of the semidefinite plus nonnegative cone (Q1657406) (← links)
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- Optimization over structured subsets of positive semidefinite matrices via column generation (Q1751222) (← links)
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793) (← links)
