Computing the distance between the linear matrix pencil and the completely positive cone
DOI10.1007/s10589-016-9825-1zbMath1381.90064OpenAlexW2269892762MaRDI QIDQ301674
Publication date: 1 July 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-016-9825-1
completely positive matricesCP projectionlinear matrix pencillinear optimization with momentssemidefinite algorithm
Factorization of matrices (15A23) Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Moment problems (44A60) Matrix pencils (15A22)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Copositive optimization -- recent developments and applications
- The truncated moment problem via homogenization and flat extensions
- On the computational complexity of membership problems for the completely positive cone and its dual
- The \(\mathcal A\)-truncated \(K\)-moment problem
- Linear optimization with cones of moments and nonnegative polynomials
- On the complexity of Putinar's Positivstellensatz
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
- Interiors of completely positive cones
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- A semidefinite approach for truncated \(K\)-moment problems
- On the copositive representation of binary and continuous nonconvex quadratic programs
- New approximations for the cone of copositive matrices and its dual
- Lectures on Modern Convex Optimization
- Approximation of the Stability Number of a Graph via Copositive Programming
- GloptiPoly 3: moments, optimization and semidefinite programming
- Some NP-complete problems in quadratic and nonlinear programming
- Positive polynomials on semi-algebraic sets
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Algebraic Degree of Polynomial Optimization
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
This page was built for publication: Computing the distance between the linear matrix pencil and the completely positive cone
