Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm
From MaRDI portal
Publication:6138297
DOI10.1007/s12190-022-01797-wzbMath1518.65066MaRDI QIDQ6138297
Publication date: 5 September 2023
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
convergence analysisKurdyka-Łojasiewicz inequalitydifference-of-convex optimizationextrapolation parametes
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- DC approximation approaches for sparse optimization
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- DCA based algorithms for feature selection in multi-class support vector machine
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- An algorithm for total variation minimization and applications
- A proximal difference-of-convex algorithm with extrapolation
- DC programming and DCA: thirty years of developments
- DC formulations and algorithms for sparse optimization problems
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Adaptive restart for accelerated gradient schemes
- Further properties of the forward-backward envelope with applications to difference-of-convex programming
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
- Computing B-Stationary Points of Nonsmooth DC Programs
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- A Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing
- Variational Analysis
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Optimal Joint Base Station Assignment and Beamforming for Heterogeneous Networks
- A New Decomposition Method for Multiuser DC-Programming and Its Applications
- Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming
- Minimization of $\ell_{1-2}$ for Compressed Sensing