Pages that link to "Item:Q5444282"

The following pages link to Computing the Stability Number of a Graph Via Linear and Semidefinite Programming (Q5444282):

Displaying 50 items.

• A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
• Cutting planes for semidefinite relaxations based on triangle-free subgraphs (Q279802) (← 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)
• Scaling relationship between the copositive cone and Parrilo's first level approximation (Q395830) (← links)
• Copositivity and constrained fractional quadratic problems (Q403649) (← 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)
• Handelman's hierarchy for the maximum stable set problem (Q480821) (← links)
• A refined error analysis for fixed-degree polynomial optimization over the simplex (Q489141) (← 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)
• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
• Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← 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)
• On the polyhedral lift-and-project methods and the fractional stable set polytope (Q1015326) (← links)
• Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
• Separating doubly nonnegative and completely positive matrices (Q1942269) (← links)
• An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs (Q2070358) (← links)
• On standard quadratic programs with exact and inexact doubly nonnegative relaxations (Q2133420) (← links)
• On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices (Q2158273) (← links)
• Testing copositivity via mixed-integer linear programming (Q2226458) (← links)
• Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations (Q2274881) (← links)
• Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices (Q2301196) (← links)
• Completely positive reformulations for polynomial optimization (Q2349130) (← links)
• Exploiting symmetry in copositive programs via semidefinite hierarchies (Q2349140) (← 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)
• A new certificate for copositivity (Q2418975) (← links)
• A new approximation hierarchy for polynomial conic optimization (Q2419540) (← 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)
• Copositivity cuts for improving SDP bounds on the clique number (Q2638373) (← links)
• Extended and discretized formulations for the maximum clique problem (Q2655650) (← links)
• Generating irreducible copositive matrices using the stable set problem (Q2664002) (← links)
• A Comprehensive Analysis of Polyhedral Lift-and-Project Methods (Q2790405) (← links)
• Copositive Programming (Q2802526) (← links)
• SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY (Q2931718) (← links)
• Gap, cosum and product properties of the θ′ bound on the clique number (Q3066919) (← links)
• On LP-based approximation for copositive formulation of stable set problem (Q3121395) (← links)
• A new branch-and-bound algorithm for standard quadratic programming problems (Q4646674) (← links)
• Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph (Q5072588) (← links)
• An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix (Q5086010) (← links)
• A Sum of Squares Characterization of Perfect Graphs (Q6087752) (← links)
• Optimization under uncertainty and risk: quadratic and copositive approaches (Q6113346) (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)