Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
From MaRDI portal
Publication:1411643
DOI10.1007/S10107-002-0351-9zbMath1030.90081OpenAlexW2146826069MaRDI QIDQ1411643
Kazuhide Nakata, Mituhiro Fukuda, Katsuki Fujisawa, Kazuo Murota, Kojima, Masakazu
Publication date: 29 October 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-002-0351-9
Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Interior-point methods (90C51) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (45)
Exploiting low-rank structure in semidefinite programming by approximate operator splitting ⋮ 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 ⋮ Matrix Relaxations in Combinatorial Optimization ⋮ Sparse noncommutative polynomial optimization ⋮ Logarithmic barriers for sparse matrix cones ⋮ Fast implementation for semidefinite programs with positive matrix completion ⋮ GMRES-Accelerated ADMM for Quadratic Objectives ⋮ A conversion of an SDP having free variables into the standard form SDP ⋮ Solving large-scale semidefinite programs in parallel ⋮ Exploiting sparsity for the min \(k\)-partition problem ⋮ Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones ⋮ Cardinality-constrained distributionally robust portfolio optimization ⋮ Strong SOCP Relaxations for the Optimal Power Flow Problem ⋮ Block-sparse recovery of semidefinite systems and generalized null space conditions ⋮ A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem ⋮ Sum-of-squares chordal decomposition of polynomial matrix inequalities ⋮ Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization ⋮ An efficient algorithm for maximum entropy extension of block-circulant covariance matrices ⋮ $LDL^T$ Direction Interior Point Method for Semidefinite Programming ⋮ COSMO: a conic operator splitting method for convex conic problems ⋮ TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity ⋮ Decomposition of arrow type positive semidefinite matrices with application to topology optimization ⋮ Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem ⋮ Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization ⋮ A parallel interior point decomposition algorithm for block angular semidefinite programs ⋮ An improved semidefinite programming relaxation for the satisfiability problem ⋮ Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion ⋮ A survey on conic relaxations of optimal power flow problem ⋮ Positive polynomials on projective limits of real algebraic varieties ⋮ Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems ⋮ Latest Developments in the SDPA Family for Solving Large-Scale SDPs ⋮ Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion ⋮ Learning chordal extensions ⋮ Faster, but weaker, relaxations for quadratically constrained quadratic programs ⋮ Preprocessing sparse semidefinite programs via matrix completion ⋮ Unnamed Item ⋮ Bounds on heat transfer for Bénard–Marangoni convection at infinite Prandtl number ⋮ Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP ⋮ Bregman primal-dual first-order method and application to sparse semidefinite programming ⋮ Exploiting special structure in semidefinite programming: a survey of theory and applications ⋮ Unnamed Item ⋮ A semidefinite optimization approach for the single-row layout problem with unequal dimensions ⋮ Bounds for Deterministic and Stochastic Dynamical Systems using Sum-of-Squares Optimization ⋮ Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
Uses Software
This page was built for publication: Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
