Pages that link to "Item:Q427378"

The following pages link to Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378):

Displaying 40 items.

• Completely positive rooted matrices (Q290670) (← links)
• Copositive matrices with circulant zero support set (Q347484) (← links)
• Minimal zeros of copositive matrices (Q401179) (← links)
• From seven to eleven: completely positive matrices with high cp-rank (Q401186) (← links)
• Copositivity and constrained fractional quadratic problems (Q403649) (← links)
• Copositive optimization -- recent developments and applications (Q421783) (← links)
• On the computational complexity of membership problems for the completely positive cone and its dual (Q461444) (← links)
• Copositivity and sparsity relations using spectral properties (Q504815) (← links)
• Completely positive reformulations of polynomial optimization problems with linear constraints (Q1679621) (← links)
• A fresh CP look at mixed-binary QPs: new formulations and relaxations (Q1683686) (← links)
• Completely positive cones: are they facially exposed? (Q1791696) (← links)
• Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision (Q1949258) (← links)
• Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches (Q2010370) (← links)
• A simplex algorithm for rational cp-factorization (Q2020599) (← links)
• The extreme rays of the \(6\times 6\) copositive cone (Q2022227) (← links)
• Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
• Completely positive factorizations associated with Euclidean distance matrices corresponding to an arithmetic progression (Q2174096) (← links)
• Hermitian completely positive matrices (Q2197205) (← links)
• Testing copositivity via mixed-integer linear programming (Q2226458) (← links)
• On the algebraic structure of the copositive cone (Q2228386) (← links)
• Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices (Q2301196) (← links)
• The integer cp-rank of \(2 \times 2\) matrices (Q2302880) (← links)
• A gentle, geometric introduction to copositive optimization (Q2349118) (← links)
• Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
• A new certificate for copositivity (Q2418975) (← 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)
• Generating irreducible copositive matrices using the stable set problem (Q2664002) (← links)
• Conic formulation of QPCCs applied to truly sparse QPs (Q2696922) (← links)
• New results on the cp-rank and related properties of co(mpletely )positive matrices (Q2938346) (← links)
• Bad Semidefinite Programs: They All Look the Same (Q2967605) (← links)
• On equivalent representations and properties of faces of the cone of copositive matrices (Q5044098) (← links)
• (Q5124683) (← links)
• Optimality conditions for linear copositive programming problems with isolated immobile indices (Q5207739) (← links)
• Copositivity tests based on the linear complementarity problem (Q5963680) (← links)
• Considering copositivity locally (Q5964425) (← links)
• Completely positive factorization by a Riemannian smoothing method (Q6043135) (← links)
• Optimization under uncertainty and risk: quadratic and copositive approaches (Q6113346) (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)