Two-step inertial proximal difference-of-convex algorithm
From MaRDI portal
Cites work
- A general double-proximal gradient algorithm for d.c. programming
- 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
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
- A three-operator splitting algorithm with deviations for generalized DC programming
- Adaptive restart for accelerated gradient schemes
- An inertial algorithm for DC programming
- An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming
- Contractive difference-of-convex algorithms
- Convergence results of two-step inertial proximal point algorithm
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC formulations and algorithms for sparse optimization problems
- DC programming and DCA: thirty years of developments
- Difference of convex algorithms for bilevel programs with applications in hyperparameter selection
- Fast L1-L2 minimization via a proximal operator
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 4041643 (Why is no real title available?)
- Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
- MiKM: multi-step inertial Krasnosel'skiǐ-Mann algorithm and its applications
- Multi-step inertial Krasnosel'skiǐ-Mann iteration with new inertial parameters arrays
- On gradients of functions definable in o-minimal structures
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- 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
- Some methods of speeding up the convergence of iteration methods
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems
This page was built for publication: Two-step inertial proximal difference-of-convex algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7255784)
