Pages that link to "Item:Q1742669"
From MaRDI portal
The following pages link to On the optimal linear convergence rate of a generalized proximal point algorithm (Q1742669):
Displaying 13 items.
- The generalized proximal point algorithm with step size 2 is not necessarily convergent (Q721955) (← links)
- Convergence results of two-step inertial proximal point algorithm (Q2085649) (← links)
- Iteration-complexity analysis of a generalized alternating direction method of multipliers (Q2633539) (← links)
- A generalized forward-backward splitting operator: degenerate analysis and applications (Q2685263) (← links)
- A unified and tight linear convergence analysis of the relaxed proximal point algorithm (Q2691350) (← links)
- Weak and strong convergence of generalized proximal point algorithms with relaxed parameters (Q2694524) (← links)
- Partial Error Bound Conditions and the Linear Convergence Rate of the Alternating Direction Method of Multipliers (Q3174821) (← links)
- An alternating direction method of multipliers with a worst-case $O(1/n^2)$ convergence rate (Q4629373) (← links)
- Weak and linear convergence of a generalized proximal point algorithm with alternating inertial steps for a monotone inclusion problem (Q5089998) (← links)
- A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming (Q5886869) (← links)
- Strongly convergent inertial proximal point algorithm without on-line rule (Q6191112) (← links)
- Generalized proximal point algorithms with correction terms and extrapolation (Q6536963) (← links)
- Equivalent resolvents of Douglas-Rachford splitting and other operator splitting algorithms: a unified degenerate proximal point analysis (Q6606317) (← links)
