Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices
- 3 December 2019
- journal article
- research article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 76 (2) , 383-405
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- FundaICcão para a Ciência e a Tecnologia (UID/MAT/00324/2019, SAICTPAC/0011/2015)
- FundaICcão para a Ciência e a Tecnologia (PD/BD/128060/2016)
This publication has 20 references indexed in Scilit:
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite OptimizationSIAM Journal on Applied Algebra and Geometry, 2019
- Optimization over structured subsets of positive semidefinite matrices via column generationDiscrete Optimization, 2017
- Sum of squares basis pursuit with linear and second order cone programming2017
- Copositive Programming2011
- Think co(mpletely)positive ! Matrix properties, examples and a clustered bibliography on copositive optimizationJournal of Global Optimization, 2011
- An Adaptive Linear Approximation Algorithm for Copositive ProgramsSIAM Journal on Optimization, 2009
- On the copositive representation of binary and continuous nonconvex quadratic programsMathematical Programming, 2008
- On factor width and symmetric H-matricesLinear Algebra and its Applications, 2005
- Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive ProgrammingJournal of Global Optimization, 2002
- On Copositive Programming and Standard Quadratic Optimization ProblemsJournal of Global Optimization, 2000