Pages that link to "Item:Q1594877"
From MaRDI portal
The following pages link to Nonlinear proximal decomposition method for convex programming (Q1594877):
Displaying 10 items.
- Modified Lagrangian methods for separable optimization problems (Q437562) (← links)
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization (Q604261) (← links)
- An improved proximal-based decomposition method for structured monotone variational inequalities (Q940504) (← links)
- Approximate proximal methods in vector optimization (Q2370322) (← links)
- Approximate proximal algorithms for generalized variational inequalities with pseudomonotone multifunctions (Q2479349) (← links)
- A proximal multiplier method for separable convex minimization (Q2790892) (← links)
- Decomposition Methods Based on Augmented Lagrangians: A Survey (Q2912155) (← links)
- Convergence rate of a proximal multiplier algorithm for separable convex minimization (Q2970394) (← links)
- A class of nonlinear proximal point algorithms for variational inequality problems (Q5266138) (← links)
- A new accuracy criterion for approximate proximal point algorithms (Q5955039) (← links)
