A new nonconvex approach to low-rank matrix completion with application to image inpainting
type: Item
instance of: scholarly article
title: A new nonconvex approach to low-rank matrix completion with application to image inpainting
zbMATH Open document ID: 1435.94051
author: Yongchao Yu
author: Ji-Gen Peng
author: Shigang Yue
published in: Multidimensional Systems and Signal Processing
publication date: 2019-01-24T00:00:00Z
Mathematics Subject Classification ID: 94A08
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7006044
zbMATH Keywords: low-rank matrix completion
zbMATH Keywords: Moreau envelope
zbMATH Keywords: proximal alternating minimization
zbMATH Keywords: image inpainting
describes a project that uses: SDPT3
MaRDI profile type: Publication
full work available at URL: s11045-018-0549-5
OpenAlex ID: W2782668701
cites work: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
cites work: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
cites work: Asymptotic properties of the Fenchel dual functional and applications to decomposition problems
cites work: Convex analysis and monotone operator theory in Hilbert spaces
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Proximal alternating linearized minimization for nonconvex and nonsmooth problems
cites work: A Singular Value Thresholding Algorithm for Matrix Completion
cites work: Exact matrix completion via convex optimization
cites work: Stable signal recovery from incomplete and inaccurate measurements
cites work: The Power of Convex Relaxation: Near-Optimal Matrix Completion
cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
cites work: A non-convex algorithm framework based on DC programming and DCA for matrix completion
cites work: An alternating direction method with continuation for nonconvex low rank minimization
cites work: An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
cites work: Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
cites work: New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
cites work: Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
cites work: Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
cites work: Fixed point and Bregman iterative methods for matrix rank minimization
cites work: Recovery of Low-Rank Matrices Under Affine Constraints via a Smoothed Rank Function
cites work: A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
cites work: Convex Analysis
cites work: A remark on global positioning from local distances
cites work: Q3161693
cites work: Convergence of a block coordinate descent method for nondifferentiable minimization
cites work: Solving semidefinite-quadratic-linear programs using SDPT3
cites work: Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
cites work: Nearly unbiased variable selection under minimax concave penalty
cites work: Analysis of multi-stage convex relaxation for sparse regularization
cites work: An approximation theory of matrix rank minimization and its application to quadratic equations
DOI: 10.1007/S11045-018-0549-5
description: scientific article; zbMATH DE number 7006044