Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices
type: Item
instance of: scholarly article
title: Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices
zbMATH Open document ID: 1435.90114
author: João Gouveia
author: Ting Kei Pong
author: Mina Saee
published in: Journal of Global Optimization
publication date: 2020-02-28T00:00:00Z
full work available at URL: https://arxiv.org/abs/1807.00379
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7175979
zbMATH Keywords: completely positive cones
zbMATH Keywords: inner approximations
zbMATH Keywords: scaled diagonal dominant matrices
describes a project that uses: DIMACS
describes a project that uses: CVX
describes a project that uses: OEIS
describes a project that uses: SPOTless
describes a project that uses: frlib
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2992111132
arXiv ID: 1807.00379
cites work: Q4405832
cites work: Optimization over structured subsets of positive semidefinite matrices via column generation
cites work: Sum of squares basis pursuit with linear and second order cone programming
cites work: DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
cites work: On factor width and symmetric \(H\)-matrices
cites work: Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
cites work: Special issue: Selected papers of the international workshop on global optimization, GO '99. Firenze, Italy, 1999
cites work: Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
cites work: An Adaptive Linear Approximation Algorithm for Copositive Programs
cites work: On the copositive representation of binary and continuous nonconvex quadratic programs
cites work: Copositive Programming
cites work: Approximation of the stability number of a graph via copositive programming
cites work: Matrix Analysis
cites work: New approximations for the cone of copositive matrices and its dual
cites work: Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
cites work: Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
cites work: Convex Analysis
cites work: Variational Analysis
cites work: On the accuracy of uniform polyhedral approximations of the copositive cone
cites work: Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis
DOI: 10.1007/S10898-019-00861-3
description: scientific article