A Convex Relaxation to Compute the Nearest Structured Rank Deficient Matrix
From MaRDI portal
Publication:4994436
DOI10.1137/19M1257640zbMath1466.15031arXiv1904.09661OpenAlexW3159716506MaRDI QIDQ4994436
Publication date: 18 June 2021
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.09661
Semidefinite programming (90C22) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Matrix completion problems (15A83)
Related Items (3)
On the local stability of semidefinite relaxations ⋮ Exact solutions in low-rank approximation with zeros ⋮ An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Overview of total least-squares methods
- A quadratically convergent algorithm for structured low-rank approximation
- Alternating projections on nontangential manifolds
- Practical global optimization for multiview geometry
- Structured total least squares and \(L_ 2\) approximation problems
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Probably certifiably correct \(k\)-means clustering
- Low-rank approximation. Algorithms, implementation, applications
- Structured low rank approximation
- Convex low rank approximation
- On convex envelopes and regularization of non-convex functionals without moving global minima
- Software for weighted structured low-rank approximation
- Structured low-rank approximation and its applications
- Globally optimal estimates for geometric reconstruction problems
- Exact matrix completion via convex optimization
- Lectures on Modern Convex Optimization
- Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Sampling Algebraic Varieties for Sum of Squares Programs
- Sum-of-Squares Optimization without Semidefinite Programming
- Total Least Norm Formulation and Solution for Structured Problems
- Semidefinite Optimization and Convex Algebraic Geometry
- Scalable Semidefinite Programming
- Exact Solutions in Structured Low-Rank Approximation
- Nonlinear Programming
- Analysis of the structured total least squares problem for Hankel/Toeplitz matrices
This page was built for publication: A Convex Relaxation to Compute the Nearest Structured Rank Deficient Matrix
