Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
From MaRDI portal
Publication:717129
DOI10.1007/s10107-010-0402-6zbMath1229.90116OpenAlexW2030686911MaRDI QIDQ717129
Makoto Yamashita, Martin Mevissen, Sunyoung Kim, Kojima, Masakazu
Publication date: 27 September 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0402-6
matrix inequalitieschordal graphsparsitypolynomial optimizationsemidefinite programpositive semidefinite matrix completion
Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Related Items
Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches, Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems, Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets, Exploiting sparsity for the min \(k\)-partition problem, Distributed consensus-based solver for semi-definite programming: an optimization viewpoint, A preconditioned iterative interior point approach to the conic bundle subproblem, A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem, Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization, Decomposition of arrow type positive semidefinite matrices with application to topology optimization, An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming, A dual spectral projected gradient method for log-determinant semidefinite problems, On the Fukaya category of a Fano hypersurface in projective space, Power transmission network expansion planning: a semidefinite programming branch-and-bound approach, Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization, On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems, A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices, A survey on conic relaxations of optimal power flow problem, Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems, Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion, Chordal decomposition in operator-splitting methods for sparse semidefinite programs, Unnamed Item, Bounds on heat transfer for Bénard–Marangoni convection at infinite Prandtl number, Bregman primal-dual first-order method and application to sparse semidefinite programming, Exact SDP relaxations of quadratically constrained quadratic programs with forest structures, Sparse PSD approximation of the PSD cone
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Positive definite completions of partial Hermitian matrices
- An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones
- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
- Positive semidefinite matrices with a given sparsity pattern
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- Global Optimization with Polynomials and the Problem of Moments
- Algorithm 920
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
