A Three-Operator Splitting Algorithm for Nonconvex Sparsity Regularization
From MaRDI portal
Publication:5005209
DOI10.1137/20M1326775zbMath1473.90126arXiv2006.08951OpenAlexW3192362104MaRDI QIDQ5005209
Publication date: 9 August 2021
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.08951
nonconvex optimizationsparsity regularizationsparse signal recoverylow rank matrix completionthree-operator splitting method
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Matrix completion problems (15A83)
Related Items
Proximal variable smoothing method for three-composite nonconvex nonsmooth minimization with a linear operator ⋮ A three-operator splitting algorithm with deviations for generalized DC programming
Uses Software
Cites Work
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)
- A three-operator splitting scheme and its optimization applications
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Peaceman-Rachford splitting for a class of nonconvex optimization problems
- Global convergence of ADMM in nonconvex nonsmooth optimization
- A proximal difference-of-convex algorithm with extrapolation
- DC formulations and algorithms for sparse optimization problems
- 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
- Guarantees of Riemannian optimization for low rank matrix completion
- A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization
- Fixed-rank matrix factorizations and Riemannian low-rank optimization
- PhaseLiftOff: an accurate and stable phase retrieval method based on difference of trace and Frobenius norms
- An envelope for Davis-Yin splitting and strict saddle-point avoidance
- Exact matrix completion via convex optimization
- Guarantees of Riemannian Optimization for Low Rank Matrix Recovery
- Image restoration by minimizing zero norm of wavelet frame coefficients
- A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications
- Coherence Pattern–Guided Compressive Sensing with Unresolved Grids
- A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
- A Singular Value Thresholding Algorithm for Matrix Completion
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- The Split Bregman Method for L1-Regularized Problems
- A Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Clarke Subgradients of Stratifiable Functions
- Superresolution via Sparsity Constraints
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
- Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming
- Regularization and Variable Selection Via the Elastic Net
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
