Computing the distance between the linear matrix pencil and the completely positive cone

In this paper, we consider the problem of computing the distance between the linear matrix pencil and the completely positive cone. We formulate it as a linear optimization problem with the cone of moments and the second order cone. A semidefinite relaxation algorithm is presented and the convergence is studied. We also propose a new model for checking the membership in the completely positive cone.

[1]  Katta G. Murty,et al.  Some NP-complete problems in quadratic and nonlinear programming , 1987, Math. Program..

[2]  Didier Henrion,et al.  GloptiPoly 3: moments, optimization and semidefinite programming , 2007, Optim. Methods Softw..

[3]  Jinyan Fan,et al.  Interiors of completely positive cones , 2015, J. Glob. Optim..

[4]  Immanuel M. Bomze,et al.  Copositive optimization - Recent developments and applications , 2012, Eur. J. Oper. Res..

[5]  Monique Laurent,et al.  Semidefinite bounds for the stability number of a graph via sums of squares of polynomials , 2005, Math. Program..

[6]  Markus Schweighofer,et al.  On the complexity of Putinar's Positivstellensatz , 2005, J. Complex..

[7]  J. Lasserre.  Moments, Positive Polynomials And Their Applications , 2009 .

[8]  Peter J. C. Dickinson,et al.  On the computational complexity of membership problems for the completely positive cone and its dual , 2014, Comput. Optim. Appl..

[9]  Jiawang Nie,et al.  Linear optimization with cones of moments and nonnegative polynomials , 2013, Math. Program..

[10]  Arkadi Nemirovski,et al.  Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

[11]  P. Parrilo.  Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization , 2000 .

[12]  Jiawang Nie,et al.  The $${\mathcal {A}}$$A-Truncated $$K$$K-Moment Problem , 2012, Found. Comput. Math..

[13]  M. Laurent.  Sums of Squares, Moment Matrices and Optimization Over Polynomials , 2009 .

[14]  Samuel Burer,et al.  On the copositive representation of binary and continuous nonconvex quadratic programs , 2009, Math. Program..

[15]  A. Berman,et al.  Completely Positive Matrices , 2003 .

[16]  Raul E. Curto,et al.  Truncated K-moment problems in several variables , 2005 .

[17]  Jiawang Nie,et al.  The A-Truncated K -Moment Problem , 2012 .

[18]  Mihai Putinar,et al.  Positive polynomials on semi-algebraic sets , 1999 .

[19]  Jiawang Nie,et al.  Algebraic Degree of Polynomial Optimization , 2008, SIAM J. Optim..

[20]  Jos F. Sturm,et al.  A Matlab toolbox for optimization over symmetric cones , 1999 .

[21]  Jean B. Lasserre,et al.  New approximations for the cone of copositive matrices and its dual , 2010, Mathematical Programming.

[22]  Jiawang Nie,et al.  Optimality conditions and finite convergence of Lasserre’s hierarchy , 2012, Math. Program..

[23]  Pablo A. Parrilo,et al.  SOSTOOLS Version 3.00 Sum of Squares Optimization Toolbox for MATLAB , 2013, ArXiv.

[24]  Etienne de Klerk,et al.  Approximation of the Stability Number of a Graph via Copositive Programming , 2002, SIAM J. Optim..

[25]  Mirjam Dür,et al.  Copositive Programming – a Survey , 2010 .

[26]  Peter J. C. Dickinson.  The copositive cone, the completely positive cone and their generalisations , 2013 .

[27]  Jiawang Nie,et al.  The truncated moment problem via homogenization and flat extensions , 2012 .

[28]  J. William Helton,et al.  A Semidefinite Approach for Truncated K-Moment Problems , 2012, Foundations of Computational Mathematics.

[29]  Etienne de Klerk,et al.  Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming , 2002, J. Glob. Optim..

[30]  Charles N. Delzell,et al.  Positive Polynomials on Semialgebraic Sets , 2001 .

[31]  Javier Peña,et al.  Computing the Stability Number of a Graph Via Linear and Semidefinite Programming , 2007, SIAM J. Optim..

[32]  A. Shapiro,et al.  Duality and Optimality Conditions , 2000 .