Pages that link to "Item:Q6483801"

The following pages link to Convergence rate analysis of the proximal difference of the convex algorithm (Q6483801):

Displaying 9 items.

• Global convergence of a proximal linearized algorithm for difference of convex functions (Q331993) (← links)
• Convergence analysis of difference-of-convex algorithm with subanalytic data (Q1730802) (← links)
• A convergence analysis for a convex version of Dikin's algorithm (Q1915918) (← links)
• The elicited progressive decoupling algorithm: a note on the rate of convergence and a preliminary numerical experiment on the choice of parameters (Q2070411) (← links)
• Convergence rate of a proximal multiplier algorithm for separable convex minimization (Q2970394) (← links)
• Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization (Q4979868) (← links)
• Convergence rate analysis of proximal gradient methods with applications to composite minimization problems (Q5151529) (← links)
• Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm (Q6138297) (← links)
• An accelerated proximal algorithm for the difference of convex programming (Q6484353) (← links)