Pages that link to "Item:Q1069674"
From MaRDI portal
The following pages link to Two general methods for computing saddle points with applications for decomposing convex programming problems (Q1069674):
Displaying 3 items.
- Penalization in non-classical convex programming via variational convergence (Q1181900) (← links)
- A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework (Q4657707) (← links)
- On the convergence of the proximal algorithm for saddle-point problems (Q4836766) (← links)
