Pages that link to "Item:Q6484353"
From MaRDI portal
The following pages link to An accelerated proximal algorithm for the difference of convex programming (Q6484353):
Displaying 15 items.
- Global convergence of a proximal linearized algorithm for difference of convex functions (Q331993) (← links)
- Fast proximity-gradient algorithms for structured convex optimization problems (Q739473) (← links)
- A proximal difference-of-convex algorithm with extrapolation (Q1744881) (← links)
- Accelerating the DC algorithm for smooth functions (Q1749446) (← links)
- Split proximal linearized algorithm and convergence theorems for the split DC program (Q2067889) (← links)
- A unified Douglas-Rachford algorithm for generalized DC programming (Q2114583) (← links)
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems (Q2125070) (← links)
- Sequential difference-of-convex programming (Q2198538) (← links)
- The modified second APG method for DC optimization problems (Q2311112) (← links)
- A general double-proximal gradient algorithm for d.c. programming (Q2330650) (← links)
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization (Q2425177) (← links)
- Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity (Q2697002) (← links)
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions (Q5221263) (← links)
- Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming (Q5242930) (← links)
- New Bregman proximal type algoritms for solving DC optimization problems (Q6043133) (← links)