Pages that link to "Item:Q2070400"
From MaRDI portal
The following pages link to Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems (Q2070400):
Displayed 13 items.
- A fast stochastic approximation-based subgradient extragradient algorithm with variance reduction for solving stochastic variational inequality problems (Q2087495) (← links)
- Linear convergence of prox-SVRG method for separable non-smooth convex optimization problems under bounded metric subregularity (Q2115253) (← links)
- Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis (Q2116020) (← links)
- Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry (Q2149561) (← links)
- An investigation on semismooth Newton based augmented Lagrangian method for image restoration (Q2162237) (← links)
- Two fast variance-reduced proximal gradient algorithms for SMVIPs -- stochastic mixed variational inequality problems with suitable applications to stochastic network games and traffic assignment problems (Q2668043) (← links)
- The equivalence of three types of error bounds for weakly and approximately convex functions (Q2671442) (← links)
- A globally convergent proximal Newton-type method in nonsmooth convex optimization (Q2687066) (← links)
- An efficient augmented Lagrangian method with semismooth Newton solver for total generalized variation (Q2697370) (← links)
- An Inexact Uzawa Algorithmic Framework for Nonlinear Saddle Point Problems with Applications to Elliptic Optimal Control Problem (Q5244393) (← links)
- A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods (Q5883316) (← links)
- A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems (Q6051310) (← links)
- (Q6137253) (← links)
