A novel nonconvex relaxation approach to low-rank matrix completion of inexact observed data

DOI10.1137/22M1543653MaRDI QIDQ6573016FDOQ6573016

Authors: Yan Li, Liping Zhang 

Publication date: 16 July 2024

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Recommendations

• Matrix completion via minimizing an approximate rank
• A new nonconvex approach to low-rank matrix completion with application to image inpainting
• A nonconvex approach to low-rank matrix completion using convex optimization.
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• The application of non-convex rank approximation based on TV and gamma norm in matrix completion

zbMATH Keywords

matrix completionproximal gradient methodrank minimizationnonconvex relaxation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical methods of relaxation type (49M20)

Cites Work

• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Nearly unbiased variable selection under minimax concave penalty
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Analysis of multi-stage convex relaxation for sparse regularization
• A Singular Value Thresholding Algorithm for Matrix Completion
• Title not available (Why is that?)
• Rank-Deficient and Discrete Ill-Posed Problems
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• An alternating direction method with continuation for nonconvex low rank minimization
• Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
• Clarke Subgradients of Stratifiable Functions
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Nonsmooth analysis of singular values. I: Theory
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Calmness of partial perturbation to composite rank constraint systems and its applications
• Title not available (Why is that?)
• Minimization of \(\ell_{1-2}\) for compressed sensing
• Weighted nuclear norm minimization and its applications to low level vision
• Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
• Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
• A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
• Fast L1-L2 minimization via a proximal operator
• A Truncated Nuclear Norm Regularization Method Based on Weighted Residual Error for Matrix Completion
• Kurdyka-Łojasiewicz exponent via inf-projection

This page was built for publication: A novel nonconvex relaxation approach to low-rank matrix completion of inexact observed data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6573016)