A preconditioned difference of convex functions algorithm with extrapolation and line search
From MaRDI portal
Cites work
- _1-_2 minimization methods for signal and image reconstruction with impulsive noise removal
- A boosted DC algorithm for non-differentiable DC components with non-monotone line search
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A preconditioned difference of convex algorithm for truncated quadratic regularization with application to imaging
- A proximal difference-of-convex algorithm with extrapolation
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
- Accelerating the DC algorithm for smooth functions
- Adaptive restart for accelerated gradient schemes
- Adaptive restart of accelerated gradient methods under local quadratic growth condition
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC programming and DCA: thirty years of developments
- Difference-of-convex learning: directional stationarity, optimality, and sparsity
- Diffuse interface models on graphs for classification of high dimensional data
- Modern nonconvex nondifferentiable optimization
- Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On the nonmonotone line search
- Open issues and recent advances in DC programming and DCA
- Parameter-free FISTA by adaptive restart and backtracking
- Preconditioned Algorithm for Difference of Convex Functions with Applications to Graph Ginzburg–Landau Model
- Preconditioned Douglas--Rachford Splitting Methods for Convex-concave Saddle-point Problems
- Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- Variational Analysis
This page was built for publication: A preconditioned difference of convex functions algorithm with extrapolation and line search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7255599)
