Pages that link to "Item:Q2419572"
From MaRDI portal
The following pages link to On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective (Q2419572):
Displaying 7 items.
- PPA-like contraction methods for convex optimization: a framework using variational inequality approach (Q259109) (← links)
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach (Q742299) (← links)
- Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization (Q779740) (← links)
- A general self-adaptive relaxed-PPA method for convex programming with linear constraints (Q2015595) (← links)
- Convergence study on the proximal alternating direction method with larger step size (Q2200786) (← links)
- A customized proximal point algorithm for convex minimization with linear constraints (Q2636606) (← links)
- A revisit of Chen-Teboulle's proximal-based decomposition method (Q6149299) (← links)