A nonconvex exact relaxation of the semidefinite matrix rank minimization

zbMATH Open1299.90271MaRDI QIDQ5399554FDOQ5399554

Authors: Linxia Qin, Lingchen Kong, Naihua Xiu 

Publication date: 28 February 2014

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

zbMATH Keywords

exact recovery conditionScatten \(p\)-norm relaxationsemidefinite matrix rank minimizationsemidefinite restricted isometry property

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Minimax problems in mathematical programming (90C47) Numerical methods of relaxation type (49M20)

Cited In (12)

• Title not available (Why is that?)
• \(s\)-semigoodness for low-rank semidefinite matrix recovery
• Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation
• Exact relaxation for the semidefinite matrix rank minimization problem with extended Lyapunov equation constraint
• \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems
• A note on a lower bound on the minimum rank of a positive semidefinite Hankel matrix rank minimization problem
• A convex relaxation to compute the nearest structured rank deficient matrix
• A Unified Theorem on SDP Rank Reduction
• Two relaxation methods for rank minimization problems
• Global solutions of non-Lipschitz \(S_{2}\)-\(S_{p}\) minimization over the positive semidefinite cone
• An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs
• Local minima and convergence in low-rank semidefinite programming

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)