Finding low-rank solutions of sparse linear matrix inequalities using convex optimization
DOI10.1137/14099379XzbMATH Open1365.90185MaRDI QIDQ5737726FDOQ5737726
Authors: Ramtin Madani, Somayeh Sojoudi, Ghazal Fazelnia, Javad Lavaei 
Publication date: 30 May 2017
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Recommendations
- On the low rank solutions for linear matrix inequalities
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Low-rank exploitation in semidefinite programming for control
- Lowest-rank solutions of continuous and discrete Lyapunov equations over symmetric cone
- Exact relaxation for the semidefinite matrix rank minimization problem with extended Lyapunov equation constraint
matrix completionpolynomial optimizationsemidefinite programminglinear matrix inequalitytree decompositionoptimal power flowlow-rank optimization
Quadratic programming (90C20) Convex programming (90C25) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Semidefinite programming (90C22) Convex functions and convex programs in convex geometry (52A41)
Cites Work
- Title not available (Why is that?)
- Exact matrix completion via convex optimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Semidefinite Programming
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Matrix Completion From a Few Entries
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Complexity of Finding Embeddings in a k-Tree
- Title not available (Why is that?)
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Quadratic forms on graphs
- Positive definite completions of partial Hermitian matrices
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Title not available (Why is that?)
- Parameters related to tree-width, zero forcing, and maximum nullity of a graph
- Treewidth computations. I: Upper bounds
- Zero forcing parameters and minimum rank problems
- On convex relaxations for quadratically constrained quadratic programming
- On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
- A Generalization of the Schur Complement by Means of the Moore–Penrose Inverse
- The minimum rank of symmetric matrices described by a graph: a survey
- A new graph parameter related to bounded rank positive semidefinite matrix completions
- Convex Relaxation for Optimal Distributed Control Problems
- Graphs whose minimal rank is two
- Null space conditions and thresholds for rank minimization
- Title not available (Why is that?)
- Lower bounds in minimum rank problems
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Linearly independent vertices and minimum semidefinite rank
- Grothendieck inequalities for semidefinite programs with rank constraint
- Computing the Grothendieck constant of some graph classes
- Treewidth computations. II. Lower bounds
- The minimum semidefinite rank of the complement of partial \(k\)-trees
- A remark on the convexity and positive definiteness concerning Hermitian matrices
- A remark on the rank of positive semidefinite matrices subject to affine constraints
- On the low rank solutions for linear matrix inequalities
- Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Algorithms finding tree-decompositions of graphs
- Solving Large-Scale Hybrid Circuit-Antenna Problems
Cited In (11)
- On the low rank solutions for linear matrix inequalities
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
- A Low-Rank Matrix Equation Method for Solving PDE-Constrained Optimization Problems
- Penalized semidefinite programming for quadratically-constrained quadratic optimization
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- Convexification of generalized network flow problem
- Title not available (Why is that?)
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
- On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem
- A new global algorithm for max-cut problem with chordal sparsity
- Finding the strongly rank-minimizing solution to the linear matrix inequality
Uses Software
This page was built for publication: Finding low-rank solutions of sparse linear matrix inequalities using convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5737726)
