Difference-of-convex algorithm with extrapolation for nonconvex, nonsmooth optimization problems
From MaRDI portal
Recommendations
- A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
- An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems
- An inexact regularized proximal Newton-type method for nonconvex composite optimization problems
- Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems
- Stochastic difference-of-convex-functions algorithms for nonconvex programming
Cited in
(7)- A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
- A multi-step inertial Bregman proximal DC algorithm and its application to solving some inverse problems
- An inexact Bregman proximal difference-of-convex algorithm with two types of relative stopping criteria
- An inertial Bregman proximal DC algorithm for generalized DC programming with application to data completion
- An extragradient method for generalized DC programming
- Inexact proximal linearized algorithm for difference of convex composite functions
- Inertial proximal difference-of-convex algorithm with convergent Bregman plug-and-play for nonconvex imaging
This page was built for publication: Difference-of-convex algorithm with extrapolation for nonconvex, nonsmooth optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6634262)
