Proximal linearization methods for Schatten \(p\)-quasi-norm minimization
From MaRDI portal
Publication:2678970
DOI10.1007/s00211-022-01335-7OpenAlexW4311119322MaRDI QIDQ2678970
Publication date: 18 January 2023
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-022-01335-7
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Uses Software
Cites Work
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Geometric categories and o-minimal structures
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- On the discontinuity of images recovered by noncovex nonsmooth regularized isotropic models with box constraints
- A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization
- Weighted nuclear norm minimization and its applications to low level vision
- Tangent and normal cones for low-rank matrices
- Structured low-rank approximation and its applications
- Nonsmooth analysis of singular values. I: Theory
- Exact matrix completion via convex optimization
- On the Schatten \(p\)-quasi-norm minimization for low-rank matrix recovery
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- Low-Rank Matrix Completion by Riemannian Optimization
- Constrained Total Variation Deblurring Models and Fast Algorithms Based on Alternating Direction Method of Multipliers
- Augmented $\ell_1$ and Nuclear-Norm Models with a Globally Linearly Convergent Algorithm
- Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
- A Singular Value Thresholding Algorithm for Matrix Completion
- Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning
- Matrix completion via an alternating direction method
- Nonconvex-TV Based Image Restoration with Impulse Noise Removal
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- Computational Methods for Linear Matrix Equations
- Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Variational Analysis
- Smoothed Low Rank and Sparse Matrix Recovery by Iteratively Reweighted Least Squares Minimization
- On the Edge Recovery Property of Noncovex Nonsmooth Regularization in Image Restoration
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates
- Krylov Methods for Low-Rank Regularization
- A globally convergent algorithm for a class of gradient compounded non-Lipschitz models applied to non-additive noise removal
- Non-Lipschitz Models for Image Restoration with Impulse Noise Removal
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- A Preconditioned Low-Rank Projection Method with a Rank-Reduction Scheme for Stochastic Partial Differential Equations
- Non-Lipschitz $\ell_{p}$-Regularization and Box Constrained Model for Image Restoration
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized Least-Squares
This page was built for publication: Proximal linearization methods for Schatten \(p\)-quasi-norm minimization
