Pages that link to "Item:Q461444"
From MaRDI portal
The following pages link to On the computational complexity of membership problems for the completely positive cone and its dual (Q461444):
Displaying 50 items.
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs (Q279802) (← links)
- Computing the distance between the linear matrix pencil and the completely positive cone (Q301674) (← links)
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank (Q304255) (← links)
- On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
- A polynomial-time algorithm for computing low CP-rank decompositions (Q344517) (← links)
- Moment approximations for set-semidefinite polynomials (Q382904) (← links)
- Copositivity and constrained fractional quadratic problems (Q403649) (← links)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
- The \(\mathcal A\)-truncated \(K\)-moment problem (Q486690) (← links)
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization (Q496589) (← links)
- On reduced semidefinite programs for second order moment bounds with applications (Q507337) (← links)
- Semidefinite approximations of conical hulls of measured sets (Q512256) (← links)
- A semidefinite algorithm for completely positive tensor decomposition (Q513715) (← links)
- On cones of nonnegative quartic forms (Q525602) (← links)
- Copositive tensor detection and its applications in physics and hypergraphs (Q683337) (← links)
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations (Q721169) (← links)
- Off-diagonal symmetric nonnegative matrix factorization (Q820738) (← links)
- Partially positive matrices (Q892772) (← links)
- Interiors of completely positive cones (Q897047) (← links)
- Completely positive tensor recovery with minimal nuclear value (Q1639713) (← links)
- LP-based tractable subcones of the semidefinite plus nonnegative cone (Q1657406) (← links)
- Copositivity detection of tensors: theory and algorithm (Q1673917) (← links)
- A fresh CP look at mixed-binary QPs: new formulations and relaxations (Q1683686) (← links)
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (Q1716972) (← links)
- Convex and concave envelopes: revisited and new perspectives (Q1728297) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- Approximation hierarchies for the cone of flow matrices (Q1742241) (← links)
- Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches (Q2010370) (← links)
- A simplex algorithm for rational cp-factorization (Q2020599) (← links)
- Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
- The complete positivity of symmetric tridiagonal and pentadiagonal matrices (Q2105347) (← links)
- Linear mappings preserving the completely positive rank (Q2111187) (← links)
- Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem (Q2114581) (← links)
- A note on completely positive relaxations of quadratic problems in a multiobjective framework (Q2114601) (← links)
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations (Q2133420) (← links)
- Duality of sum of nonnegative circuit polynomials and optimal SONC bounds (Q2156369) (← links)
- A factorization method for completely positive matrices (Q2174498) (← links)
- Hermitian completely positive matrices (Q2197205) (← links)
- Completely positive tensors in the complex field (Q2197844) (← links)
- A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection (Q2200085) (← links)
- The infinite extendibility problem for exchangeable real-valued random vectors (Q2208476) (← links)
- Testing copositivity via mixed-integer linear programming (Q2226458) (← links)
- Exploiting partial correlations in distributionally robust optimization (Q2227536) (← links)
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations (Q2231320) (← links)
- Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations (Q2274881) (← links)
- A hierarchy of semidefinite relaxations for completely positive tensor optimization problems (Q2274887) (← links)
- A semidefinite relaxation algorithm for checking completely positive separable matrices (Q2313773) (← links)
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem (Q2349132) (← links)
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291) (← links)
- Factorization and cutting planes for completely positive matrices by copositive projection (Q2436642) (← links)
