On the computational complexity of membership problems for the completely positive cone and its dual
From MaRDI portal
Publication:461444
DOI10.1007/S10589-013-9594-ZzbMATH Open1330.90103OpenAlexW2126138717MaRDI QIDQ461444FDOQ461444
Authors: Peter J. C. Dickinson, Luuk Gijben 
Publication date: 10 October 2014
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-013-9594-z
Recommendations
- Copositive matrices, copositive programming, and applications
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Copositive programming
- Some NP-complete problems in quadratic and nonlinear programming
- Geometry of the copositive and completely positive cones
Cites Work
- Title not available (Why is that?)
- Some NP-complete problems in quadratic and nonlinear programming
- Geometric algorithms and combinatorial optimization
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Approximation of the stability number of a graph via copositive programming
- Graph theory with applications
- An adaptive linear approximation algorithm for copositive programs
- A variational approach to copositive matrices
- Title not available (Why is that?)
- The Operator $\Psi$ for the Chromatic Number of a Graph
- On nonnegative factorization of matrices
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Copositive optimization -- recent developments and applications
- Copositive programming
- On the computation of \(C^*\) certificates
- Linear-time complete positivity detection and decomposition of sparse matrices
- Quadratic factorization heuristics for copositive programming
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey
- Title not available (Why is that?)
Cited In (81)
- Pairwise completely positive matrices and conjugate local diagonal unitary invariant quantum states
- A simplex algorithm for rational cp-factorization
- Lower bounds for maximal cp-ranks of completely positive matrices and tensors
- The complete positivity of symmetric tridiagonal and pentadiagonal matrices
- Convex and concave envelopes: revisited and new perspectives
- Testing copositivity via mixed-integer linear programming
- A Positivstellensatz for sums of nonnegative circuit polynomials
- A note on completely positive relaxations of quadratic problems in a multiobjective framework
- Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem
- Tensors in computations
- Unbounded convex sets for non-convex mixed-integer quadratic programming
- Polyhedral approximations of the semidefinite cone and their application
- A complete semidefinite algorithm for detecting copositive matrices and tensors
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs
- On conic QPCCs, conic QCQPs and completely positive programs
- Approximation hierarchies for the cone of flow matrices
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations
- Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches
- Linear mappings preserving the completely positive rank
- Copositivity detection of tensors: theory and algorithm
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
- A semidefinite relaxation algorithm for checking completely positive separable matrices
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
- Membership in moment polytopes is in NP and coNP
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Computing the distance between the linear matrix pencil and the completely positive cone
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank
- Completely positive tensor recovery with minimal nuclear value
- The computational complexity of duality
- The \(\mathcal A\)-truncated \(K\)-moment problem
- Off-diagonal symmetric nonnegative matrix factorization
- Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
- A factorization method for completely positive matrices
- Interiors of completely positive cones
- LP-based tractable subcones of the semidefinite plus nonnegative cone
- Copositivity and constrained fractional quadratic problems
- Partially positive matrices
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- Hermitian completely positive matrices
- The Complexity of Membership Problems for Circuits over Sets of Positive Numbers
- Linear mappings preserving the copositive cone
- A polynomial-time algorithm for computing low CP-rank decompositions
- Factorization and cutting planes for completely positive matrices by copositive projection
- A fresh CP look at mixed-binary QPs: new formulations and relaxations
- Lower bounds for polynomials with simplex Newton polytopes based on geometric programming
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
- Sum of squares basis pursuit with linear and second order cone programming
- Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems
- Best nonnegative rank-one approximations of tensors
- On the number of CP factorizations of a completely positive matrix
- Optimization under uncertainty and risk: quadratic and copositive approaches
- Copositive tensor detection and its applications in physics and hypergraphs
- On reduced semidefinite programs for second order moment bounds with applications
- Semidefinite approximations of conical hulls of measured sets
- Moment approximations for set-semidefinite polynomials
- A semidefinite algorithm for completely positive tensor decomposition
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming
- On cones of nonnegative quartic forms
- The infinite extendibility problem for exchangeable real-valued random vectors
- Lifting for simplicity: concise descriptions of convex sets
- Dehomogenization for completely positive tensors
- Exploiting partial correlations in distributionally robust optimization
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Completely positive factorization by a Riemannian smoothing method
- A random copositive matrix is completely positive with positive probability
- Perfect copositive matrices
- A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection
- Duality of sum of nonnegative circuit polynomials and optimal SONC bounds
- On degenerate doubly nonnegative projection problems
- Completely positive binary tensors
- A hierarchy of semidefinite relaxations for completely positive tensor optimization problems
- Completely positive completely positive maps (and a resource theory for non-negativity of quantum amplitudes)
- The CP-matrix approximation problem
- Completely positive tensors in the complex field
- Generating extreme copositive matrices near matrices obtained from COP-irreducible graphs
- Approximation hierarchies for copositive cone over symmetric cone and their comparison
- Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks
This page was built for publication: On the computational complexity of membership problems for the completely positive cone and its dual
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q461444)
