The following pages link to (Q4405832):
Displayed 50 items.
- Partially positive matrices (Q892772) (← links)
- Interiors of completely positive cones (Q897047) (← links)
- Structured nonnegative matrix factorization with applications to hidden Markov realization and clustering (Q947603) (← links)
- An alternative proof of the Barker, Berman, Plemmons (BBP) result on diagonal stability and extensions (Q957992) (← links)
- A note on ``\(5\times 5\) completely positive matrices'' (Q984866) (← links)
- On the computation of \(C^*\) certificates (Q1037359) (← links)
- A note on upper bounds on the cp-rank (Q1039748) (← links)
- Completely positive tensor recovery with minimal nuclear value (Q1639713) (← links)
- LP-based tractable subcones of the semidefinite plus nonnegative cone (Q1657406) (← links)
- Quadratic programs with hollows (Q1659682) (← links)
- A fresh CP look at mixed-binary QPs: new formulations and relaxations (Q1683686) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- On the geometric interpretation of the nonnegative rank (Q1758469) (← links)
- \(\{0,1\}\) completely positive matrices (Q1772719) (← links)
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone (Q1785193) (← links)
- Completely positive semidefinite rank (Q1785204) (← links)
- Building a completely positive factorization (Q1787912) (← links)
- On \(\{0,1\}\) CP tensors and CP pseudographs (Q1790471) (← links)
- Algorithms for positive semidefinite factorization (Q1790680) (← links)
- Completely positive cones: are they facially exposed? (Q1791696) (← links)
- Tridiagonal doubly stochastic matrices (Q1886535) (← links)
- Separating doubly nonnegative and completely positive matrices (Q1942269) (← links)
- Separation and relaxation for cones of quadratic forms (Q1942279) (← links)
- A note on Burer's copositive representation of mixed-binary QPs (Q1958650) (← links)
- Completely positive matrices: real, rational, and integral (Q1994053) (← 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)
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs (Q2070358) (← links)
- Two-stage stochastic standard quadratic optimization (Q2077956) (← links)
- The complete positivity of symmetric tridiagonal and pentadiagonal matrices (Q2105347) (← links)
- A note on completely positive relaxations of quadratic problems in a multiobjective framework (Q2114601) (← links)
- Packing under convex quadratic constraints (Q2118134) (← links)
- Bounding the separable rank via polynomial optimization (Q2144234) (← links)
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
- On strong duality in linear copositive programming (Q2149604) (← links)
- Triangle-free graphs and completely positive matrices (Q2155141) (← links)
- The \(\mathrm{PPT}^2\) conjecture holds for all Choi-type maps (Q2165072) (← links)
- Completely positive factorizations associated with Euclidean distance matrices corresponding to an arithmetic progression (Q2174096) (← links)
- A factorization method for completely positive matrices (Q2174498) (← links)
- Immobile indices and CQ-free optimality criteria for linear copositive programming problems (Q2174923) (← links)
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures (Q2182857) (← links)
- Hermitian completely positive matrices (Q2197205) (← links)
- Completely positive tensors in the complex field (Q2197844) (← links)
- Inequalities for doubly nonnegative functions (Q2227828) (← links)
- A graphical calculus for integration over random diagonal unitary matrices (Q2229450) (← links)
- Positively factorizable maps (Q2238874) (← links)
- Nonnegative rank factorization -- a heuristic approach via rank reduction (Q2248962) (← links)
- A hierarchy of semidefinite relaxations for completely positive tensor optimization problems (Q2274887) (← 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 semidefinite relaxation algorithm for checking completely positive separable matrices (Q2313773) (← links)