An accelerated double-proximal gradient algorithm for DC programming
From MaRDI portal
Cites work
- A duality principle for non-convex optimisation and the calculus of variations
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A general double-proximal gradient algorithm for d.c. programming
- A proximal difference-of-convex algorithm with extrapolation
- A weighted difference of anisotropic and isotropic total variation model for image processing
- Adaptive restart for accelerated gradient schemes
- An algorithm for total variation minimization and applications
- An efficient DCA based algorithm for power control in large scale wireless networks
- Convergence analysis for a primal-dual monotone + skew splitting algorithm with applications to total variation minimization
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DCA based algorithms for feature selection in multi-class support vector machine
- Duality in nonconvex optimization
- General Inexact Primal-Dual Hybrid Gradient Methods for Saddle-Point Problems and Convergence Analysis
- scientific article; zbMATH DE number 2076851 (Why is no real title available?)
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Some methods of speeding up the convergence of iteration methods
- Variational Analysis
This page was built for publication: An accelerated double-proximal gradient algorithm for DC programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6968688)
