Computing the distance between the linear matrix pencil and the completely positive cone
DOI10.1007/S10589-016-9825-1zbMATH Open1381.90064OpenAlexW2269892762MaRDI QIDQ301674FDOQ301674
Authors: Anwa Zhou, Jinyan Fan 
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
Recommendations
completely positive matricesCP projectionlinear matrix pencillinear optimization with momentssemidefinite algorithm
Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59) Factorization of matrices (15A23) Nonconvex programming, global optimization (90C26) Semidefinite programming (90C22) Matrix pencils (15A22) Moment problems (44A60)
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Some NP-complete problems in quadratic and nonlinear programming
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Approximation of the stability number of a graph via copositive programming
- GloptiPoly 3: moments, optimization and semidefinite programming
- Sums of squares, moment matrices and optimization over polynomials
- Title not available (Why is that?)
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- Title not available (Why is that?)
- On the complexity of Putinar's Positivstellensatz
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- On the computational complexity of membership problems for the completely positive cone and its dual
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Copositive optimization -- recent developments and applications
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
- A semidefinite approach for truncated \(K\)-moment problems
- New approximations for the cone of copositive matrices and its dual
- Positive polynomials on semi-algebraic sets
- Title not available (Why is that?)
- The truncated moment problem via homogenization and flat extensions
- The \(\mathcal A\)-truncated \(K\)-moment problem
- Algebraic degree of polynomial optimization
- Truncated \(K\)-moment problems in several variables
- Linear optimization with cones of moments and nonnegative polynomials
- Interiors of completely positive cones
Cited In (1)
Uses Software
This page was built for publication: Computing the distance between the linear matrix pencil and the completely positive cone
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q301674)
