Pages that link to "Item:Q5088831"

The following pages link to On the linear convergence of a Bregman proximal point algorithm (Q5088831):

Displaying 8 items.

• Linear convergence rate for the MDM algorithm for the nearest point problem (Q1678696) (← links)
• Accelerated Bregman proximal gradient methods for relatively smooth convex optimization (Q2044481) (← links)
• A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption (Q2322358) (← links)
• A simple convergence analysis of Bregman proximal gradient algorithm (Q2419573) (← links)
• On dual convergence of the generalized proximal point method with Bregman distances (Q2757655) (← links)
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions (Q3140001) (← links)
• Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit (Q3450036) (← links)
• Bregman-Golden ratio algorithms for variational inequalities (Q6145051) (← links)