Pages that link to "Item:Q2977635"

The following pages link to Convergence analysis of a proximal point algorithm for minimizing differences of functions (Q2977635):

Displaying 16 items.

• DC programming and DCA: thirty years of developments (Q1749443) (← links)
• Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems (Q1987437) (← links)
• A bundle method for nonsmooth DC programming with application to chance-constrained problems (Q2028493) (← links)
• Strong convergence of inertial projection and contraction methods for pseudomonotone variational inequalities with applications to optimal control problems (Q2114596) (← links)
• Separating variables to accelerate non-convex regularized optimization (Q2181546) (← links)
• A general double-proximal gradient algorithm for d.c. programming (Q2330650) (← links)
• Sequence Convergence of Inexact Nonconvex and Nonsmooth Algorithms with More Realistic Assumptions (Q4985183) (← links)
• Solving a continuous multifacility location problem by DC algorithms (Q5038184) (← links)
• A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions (Q5099775) (← links)
• Convergence guarantees for a class of non-convex and non-smooth optimization problems (Q5214248) (← links)
• The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions (Q5221263) (← links)
• A forward-backward algorithm for the DC programming in Hilbert spaces (Q5244142) (← links)
• On Algorithms for Difference of Monotone Operators (Q5896074) (← links)
• On Algorithms for Difference of Monotone Operators (Q5896140) (← links)
• A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems (Q6141533) (← links)
• Bregman proximal linearized ADMM for minimizing separable sums coupled by a difference of functions (Q6644253) (← links)