Pages that link to "Item:Q779740"
From MaRDI portal
The following pages link to Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization (Q779740):
Displaying 5 items.
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach (Q742299) (← links)
- A general self-adaptive relaxed-PPA method for convex programming with linear constraints (Q2015595) (← links)
- Improved Lagrangian-PPA based prediction correction method for linearly constrained convex optimization (Q2083351) (← links)
- On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective (Q2419572) (← links)
- A customized proximal point algorithm for convex minimization with linear constraints (Q2636606) (← links)