The following pages link to (Q5402636):
Displaying 6 items.
- PPA-like contraction methods for convex optimization: a framework using variational inequality approach (Q259109) (← links)
- A class of customized proximal point algorithms for linearly constrained convex optimization (Q725706) (← links)
- A general self-adaptive relaxed-PPA method for convex programming with linear constraints (Q2015595) (← links)
- The strong convergence of prediction-correction and relaxed hybrid steepest-descent method for variational inequalities (Q2015692) (← links)
- Improved Lagrangian-PPA based prediction correction method for linearly constrained convex optimization (Q2083351) (← links)
- Two convergent primal-dual hybrid gradient type methods for convex programming with linear constraints (Q6100752) (← links)
