A nonconvex exact relaxation of the semidefinite matrix rank minimization
From MaRDI portal
Publication:5399554
Recommendations
- A \(p\)-spherical section property for matrix Schatten-\(p\) quasi-norm minimization
- Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization
- Exact relaxation for the semidefinite matrix rank minimization problem with extended Lyapunov equation constraint
- Exact minimum rank approximation via Schatten p-norm minimization
- Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery
Cited in
(12)- Exact relaxation for the semidefinite matrix rank minimization problem with extended Lyapunov equation constraint
- \(s\)-semigoodness for low-rank semidefinite matrix recovery
- A note on a lower bound on the minimum rank of a positive semidefinite Hankel matrix rank minimization problem
- An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs
- A convex relaxation to compute the nearest structured rank deficient matrix
- Two relaxation methods for rank minimization problems
- A Unified Theorem on SDP Rank Reduction
- Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation
- Local minima and convergence in low-rank semidefinite programming
- \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems
- Global solutions of non-Lipschitz \(S_{2}\)-\(S_{p}\) minimization over the positive semidefinite cone
- scientific article; zbMATH DE number 7125122 (Why is no real title available?)
This page was built for publication: A nonconvex exact relaxation of the semidefinite matrix rank minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5399554)
