Finding low-rank solutions of sparse linear matrix inequalities using convex optimization
From MaRDI portal
Publication:5737726
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)
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
Cites work
- scientific article; zbMATH DE number 4158856 (Why is no real title available?)
- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1757962 (Why is no real title available?)
- A Generalization of the Schur Complement by Means of the Moore–Penrose Inverse
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A new graph parameter related to bounded rank positive semidefinite matrix completions
- A remark on the convexity and positive definiteness concerning Hermitian matrices
- A remark on the rank of positive semidefinite matrices subject to affine constraints
- Algorithms finding tree-decompositions of graphs
- Complexity of Finding Embeddings in a k-Tree
- Computing the Grothendieck constant of some graph classes
- Convex Relaxation for Optimal Distributed Control Problems
- Exact matrix completion via convex optimization
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Exactness of semidefinite relaxations for nonlinear optimization problems with underlying graph structure
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Graphs whose minimal rank is two
- Grothendieck inequalities for semidefinite programs with rank constraint
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Linearly independent vertices and minimum semidefinite rank
- Lower bounds in minimum rank problems
- Matrix Completion From a Few Entries
- Null space conditions and thresholds for rank minimization
- On convex relaxations for quadratically constrained quadratic programming
- On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
- On the low rank solutions for linear matrix inequalities
- Parameters related to tree-width, zero forcing, and maximum nullity of a graph
- Positive definite completions of partial Hermitian matrices
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Quadratic forms on graphs
- Semidefinite Programming
- Solving Large-Scale Hybrid Circuit-Antenna Problems
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- The minimum rank of symmetric matrices described by a graph: a survey
- The minimum semidefinite rank of the complement of partial \(k\)-trees
- Treewidth computations. I: Upper bounds
- Treewidth computations. II. Lower bounds
- Zero forcing parameters and minimum rank 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
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
- scientific article; zbMATH DE number 7306888 (Why is no real title available?)
- On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem
- Finding the strongly rank-minimizing solution to the linear matrix inequality
- A new global algorithm for max-cut problem with chordal sparsity
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)
