A three-operator splitting algorithm for nonconvex sparsity regularization
From MaRDI portal
Abstract: Sparsity regularization has been largely applied in many fields, such as signal and image processing and machine learning. In this paper, we mainly consider nonconvex minimization problems involving three terms, for the applications such as: sparse signal recovery and low rank matrix recovery. We employ a three-operator splitting proposed by Davis and Yin (called DYS) to solve the resulting possibly nonconvex problems and develop the convergence theory for this three-operator splitting algorithm in the nonconvex case. We show that if the step size is chosen less than a computable threshold, then the whole sequence converges to a stationary point. By defining a new decreasing energy function associated with the DYS method, we establish the global convergence of the whole sequence and a local convergence rate under an additional assumption that this energy function is a Kurdyka-ojasiewicz function. We also provide sufficient conditions for the boundedness of the generated sequence. Finally, some numerical experiments are conducted to compare the DYS algorithm with some classical efficient algorithms for sparse signal recovery and low rank matrix completion. The numerical results indicate that DYS method outperforms the exsiting methods for these specific applications.
Recommendations
- Nonconvex sparse regularization and splitting algorithms
- A dynamical splitting method for minimizing the sum of three convex functions
- A splitting algorithm for three-block convex minimization problems
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization
Cites work
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation
- A method for finding structured sparse solutions to nonnegative least squares problems with applications
- A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization
- A proximal difference-of-convex algorithm with extrapolation
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
- A Singular Value Thresholding Algorithm for Matrix Completion
- A three-operator splitting scheme and its optimization applications
- A weighted difference of anisotropic and isotropic total variation model for image processing
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Alternating direction method of multipliers for a class of nonconvex and nonsmooth problems with applications to background/foreground extraction
- An envelope for Davis-Yin splitting and strict saddle-point avoidance
- Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
- Clarke Subgradients of Stratifiable Functions
- Coherence pattern-guided compressive sensing with unresolved grids
- Computing sparse representation in a highly coherent dictionary based on difference of L₁ and L₂
- Convergence analysis of Douglas-Rachford splitting method for ``strongly + weakly convex programming
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC formulations and algorithms for sparse optimization problems
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Exact matrix completion via convex optimization
- Fixed-rank matrix factorizations and Riemannian low-rank optimization
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Global convergence of splitting methods for nonconvex composite optimization
- Guarantees of Riemannian optimization for low rank matrix completion
- Guarantees of Riemannian optimization for low rank matrix recovery
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Image restoration by minimizing zero norm of wavelet frame coefficients
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Peaceman-Rachford splitting for a class of nonconvex optimization problems
- PhaseLiftOff: an accurate and stable phase retrieval method based on difference of trace and Frobenius norms
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Regularization and Variable Selection Via the Elastic Net
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Superresolution via Sparsity Constraints
- The Split Bregman Method for L1-Regularized Problems
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
Cited in
(11)- Nonconvex sparse regularization and splitting algorithms
- 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
- A parameterized three-operator splitting algorithm for non-convex minimization problems with applications
- Extrapolated plug-and-play three-operator splitting methods for nonconvex optimization with applications to image restoration
- A preconditioned Riemannian gradient descent algorithm for low-rank matrix recovery
- A four-operator splitting algorithm for nonconvex and nonsmooth optimization
- Doubly relaxed forward-Douglas-Rachford splitting for the sum of two nonconvex and a DC function
- New Douglas-Rashford splitting algorithms for generalized DC programming with applications in machine learning
- The variable metric three-operator algorithms for solving monotone inclusions
- Flash proton radiation therapy via a stochastic three-operator splitting method
This page was built for publication: A three-operator splitting algorithm for nonconvex sparsity regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5005209)
