Pages that link to "Item:Q2330650"

The following pages link to A general double-proximal gradient algorithm for d.c. programming (Q2330650):

Displaying 18 items.

• The ABC of DC programming (Q829493) (← links)
• A proximal difference-of-convex algorithm with extrapolation (Q1744881) (← links)
• Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels (Q1784885) (← links)
• A bundle method for nonsmooth DC programming with application to chance-constrained problems (Q2028493) (← links)
• Split proximal linearized algorithm and convergence theorems for the split DC program (Q2067889) (← links)
• An extension of the proximal point algorithm beyond convexity (Q2114582) (← links)
• A unified Douglas-Rachford algorithm for generalized DC programming (Q2114583) (← 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)
• Improving ADMMs for solving doubly nonnegative programs through dual factorization (Q2240675) (← links)
• An inertial algorithm for DC programming (Q2281267) (← links)
• A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems (Q2307744) (← links)
• A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection (Q2419541) (← links)
• The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions (Q5221263) (← links)
• The Exact Modulus of the Generalized Concave Kurdyka-Łojasiewicz Property (Q5870355) (← links)
• A refined inertial DC algorithm for DC programming (Q6159465) (← links)
• Calculus rules of the generalized concave Kurdyka-Łojasiewicz property (Q6167075) (← links)
• A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging (Q6639517) (← links)