Pages that link to "Item:Q2330650"
From MaRDI portal
The following pages link to A general double-proximal gradient algorithm for d.c. programming (Q2330650):
Displaying 9 items.
- The ABC of DC programming (Q829493) (← links)
- A proximal difference-of-convex algorithm with extrapolation (Q1744881) (← links)
- A bundle method for nonsmooth DC programming with application to chance-constrained problems (Q2028493) (← links)
- An extension of the proximal point algorithm beyond convexity (Q2114582) (← links)
- Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems (Q2141356) (← links)
- Variational models for color image correction inspired by visual perception and neuroscience (Q2217382) (← links)
- A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems (Q2307744) (← links)
- The Exact Modulus of the Generalized Concave Kurdyka-Łojasiewicz Property (Q5870355) (← links)
- Calculus rules of the generalized concave Kurdyka-Łojasiewicz property (Q6167075) (← links)