Pages that link to "Item:Q6043133"
From MaRDI portal
The following pages link to New Bregman proximal type algoritms for solving DC optimization problems (Q6043133):
Displaying 14 items.
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems (Q2125070) (← links)
- A revision of the rectangular algorithm for a class of DC optimization problems (Q2141721) (← links)
- On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression (Q2230800) (← links)
- A general double-proximal gradient algorithm for d.c. programming (Q2330650) (← links)
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection (Q2419541) (← links)
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization (Q2425177) (← links)
- A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning (Q2633537) (← links)
- Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints (Q2692792) (← links)
- Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming (Q5242930) (← links)
- A refined inertial DC algorithm for DC programming (Q6159465) (← links)
- An accelerated proximal algorithm for the difference of convex programming (Q6484353) (← links)
- A proximal alternating direction method of multipliers for DC programming with structured constraints (Q6536834) (← links)
- A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging (Q6639517) (← links)
- Approximate Bregman proximal gradient algorithm for relatively smooth nonconvex optimization (Q6667696) (← links)
