Building a completely positive factorization
type: Item
instance of: scholarly article
title: Building a completely positive factorization
zbMATH Open document ID: 1397.90288
author: Immanuel M. Bomze
published in: CEJOR. Central European Journal of Operations Research
publication date: 2018-10-05T00:00:00Z
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 6948075
zbMATH Keywords: copositive optimization
zbMATH Keywords: cp-rank
zbMATH Keywords: Schur complement
MaRDI profile type: Publication
full work available at URL: s10100-017-0499-2
OpenAlex ID: W2771012806
Wikidata QID: Q55472788
cites work: Q2941667
cites work: Copositivity and constrained fractional quadratic problems
cites work: Computable representations for convex hulls of low-dimensional quadratic forms
cites work: The maximal cp-rank of rank \(k\) completely positive matrices
cites work: Open problems in the theory of completely positive and copositive matrices
cites work: Combinatorial results on completely positive matrices
cites work: A note on the computation of the CP-rank
cites work: Q4405832
cites work: \(5 \times 5\) completely positive matrices
cites work: Copositive optimization -- recent developments and applications
cites work: A note on Burer's copositive representation of mixed-binary QPs
cites work: Special issue: Selected papers of the international workshop on global optimization, GO '99. Firenze, Italy, 1999
cites work: From seven to eleven: completely positive matrices with high cp-rank
cites work: New Lower Bounds and Asymptotics for the cp-Rank
cites work: The Complexity of Simple Models—A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem
cites work: Factorization of cp-rank-3 completely positive matrices
cites work: On the copositive representation of binary and continuous nonconvex quadratic programs
cites work: Copositive Programming
cites work: The difference between \(5\times 5\) doubly nonnegative and completely positive matrices
cites work: New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions
cites work: Sparse solutions to random standard quadratic optimization problems
cites work: Q3843714
cites work: An improved characterisation of the interior of the completely positive cone
cites work: Linear-Time Complete Positivity Detection and Decomposition of Sparse Matrices
cites work: A note on ``\(5\times 5\) completely positive matrices''
cites work: Completely positive matrices associated withM-matrices
cites work: Q3497912
cites work: Nonnegative factorization of positive semidefinite nonnegative matrices
cites work: Q5328177
cites work: On the computation of \(C^*\) certificates
cites work: Computing symmetric nonnegative rank factorizations
cites work: On nonnegative factorization of matrices
cites work: A Test of the Markovian Model of DNA Evolution
cites work: On the support size of stable strategies in random games
cites work: Well supported approximate equilibria in bimatrix games
cites work: Algorithms and Computation
cites work: CP rank of completely positive matrices of order 5
cites work: On reduced semidefinite programs for second order moment bounds with applications
cites work: Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
cites work: Copositive realxation for genera quadratic programming
cites work: Completely positive matrices and positivity of least squares solutions
cites work: A note on upper bounds on the cp-rank
cites work: Matrices attaining the minimum semidefinite rank of a chordal graph
cites work: New results on the cp-rank and related properties of co(mpletely )positive matrices
cites work: On the cp-rank and minimal cp factorizations of a completely positive matrix
cites work: Factorization and cutting planes for completely positive matrices by copositive projection
cites work: Interiors of completely positive cones
DBLP publication ID: journals/cejor/Bomze18
DOI: 10.1007/S10100-017-0499-2
description: scientific article; zbMATH DE number 6948075