A new nonconvex approach to low-rank matrix completion with application to image inpainting
From MaRDI portal
Publication:1710943
DOI10.1007/s11045-018-0549-5zbMath1435.94051OpenAlexW2782668701MaRDI QIDQ1710943
Yongchao Yu, Shi-Gang Yue, Ji-Gen Peng
Publication date: 24 January 2019
Published in: Multidimensional Systems and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11045-018-0549-5
Nonconvex programming, global optimization (90C26) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- Solving semidefinite-quadratic-linear programs using SDPT3
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An alternating direction method with continuation for nonconvex low rank minimization
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- An approximation theory of matrix rank minimization and its application to quadratic equations
- Fixed point and Bregman iterative methods for matrix rank minimization
- New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Asymptotic properties of the Fenchel dual functional and applications to decomposition problems
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- A non-convex algorithm framework based on DC programming and DCA for matrix completion
- Exact matrix completion via convex optimization
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- A Singular Value Thresholding Algorithm for Matrix Completion
- A remark on global positioning from local distances
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
- Recovery of Low-Rank Matrices Under Affine Constraints via a Smoothed Rank Function
- Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Stable signal recovery from incomplete and inaccurate measurements
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Convergence of a block coordinate descent method for nondifferentiable minimization
This page was built for publication: A new nonconvex approach to low-rank matrix completion with application to image inpainting
