Pages that link to "Item:Q3075177"

The following pages link to An improved characterisation of the interior of the completely positive cone (Q3075177):

Displaying 24 items.

• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
• The structure of completely positive matrices according to their CP-rank and CP-plus-rank (Q492774) (← links)
• Geometry of the copositive and completely positive cones (Q534759) (← links)
• Quadratic factorization heuristics for copositive programming (Q542052) (← links)
• Interiors of completely positive cones (Q897047) (← links)
• Building a completely positive factorization (Q1787912) (← links)
• Separation and relaxation for cones of quadratic forms (Q1942279) (← links)
• Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma (Q1987329) (← links)
• Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches (Q2010370) (← links)
• A simplex algorithm for rational cp-factorization (Q2020599) (← links)
• \(l_2\) Induced norm analysis of discrete-time LTI systems for nonnegative input signals and its application to stability analysis of recurrent neural networks (Q2068566) (← links)
• Sign patterns of inverse doubly nonnegative matrices and inverse completely positive matrices (Q2109065) (← links)
• Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
• A factorization method for completely positive matrices (Q2174498) (← links)
• Copositive programming via semi-infinite optimization (Q2435031) (← links)
• Factorization and cutting planes for completely positive matrices by copositive projection (Q2436642) (← links)
• Nearly positive matrices (Q2447983) (← links)
• Irreducible elements of the copositive cone (Q2637144) (← links)
• On the DJL conjecture for order 6 (Q5346603) (← links)
• Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems (Q5501200) (← links)
• On the number of CP factorizations of a completely positive matrix (Q5887654) (← links)
• Completely positive factorization by a Riemannian smoothing method (Q6043135) (← links)
• Optimization under uncertainty and risk: quadratic and copositive approaches (Q6113346) (← links)
• The cone of \(5 \times 5\) completely positive matrices (Q6191441) (← links)