The following pages link to (Q4906152):
Displaying 11 items.
- On the convergence rate of a class of proximal-based decomposition methods for monotone variational inequalities (Q888313) (← links)
- An improved proximal-based decomposition method for structured monotone variational inequalities (Q940504) (← links)
- Sensitivity analysis of the proximal-based parallel decomposition methods (Q1719313) (← links)
- An implementable first-order primal-dual algorithm for structured convex optimization (Q1724030) (← links)
- A unified convergence framework for nonmonotone inexact decomposition methods (Q2301131) (← links)
- A new implementable prediction-correction method for monotone variational inequalities with separable structure (Q2319291) (← links)
- Inexact decomposition methods for solving variational inequalities with linear equality constraint (Q2511020) (← links)
- A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework (Q4657707) (← links)
- A separable surrogate function method for sparse and low-rank matrices decomposition (Q5110318) (← links)
- Entropic proximal decomposition methods for convex programs and variational inequalities (Q5955559) (← links)
- A revisit of Chen-Teboulle's proximal-based decomposition method (Q6149299) (← links)
