A semismooth Newton stochastic proximal point algorithm with variance reduction
From MaRDI portal
Recommendations
- A stochastic variance reduced gradient method with adaptive step for stochastic optimization
- Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems
- On the local convergence of a stochastic semismooth Newton method for nonsmooth nonconvex optimization
- New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization
- A stochastic semismooth Newton method for nonsmooth nonconvex optimization
Cites work
- A Class of Inexact Variable Metric Proximal Point Algorithms
- A family of variable metric proximal methods
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A nonsmooth version of Newton's method
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
- A proximal stochastic gradient method with progressive variance reduction
- A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
- A Stochastic Approximation Method
- A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization
- A stochastic semismooth Newton method for nonsmooth nonconvex optimization
- Adaptive subgradient methods for online learning and stochastic optimization
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
- An interior-point method for large-scale l₁-regularized logistic regression
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Convex analysis and monotone operator theory in Hilbert spaces
- Error bounds, quadratic growth, and linear convergence of proximal methods
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- First-order methods in optimization
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- Gradient methods for minimizing composite functions
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 5937962 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- scientific article; zbMATH DE number 3359250 (Why is no real title available?)
- Incremental proximal methods for large scale convex optimization
- Large-scale machine learning with stochastic gradient descent
- Local strong convexity and local Lipschitz continuity of the gradient of convex functions
- Local uniqueness and convergence of iterative methods for nonsmooth variational inequalities
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
- Minimization of \(SC^ 1\) functions and the Maratos effect
- Monotone Operators and the Proximal Point Algorithm
- Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization
- On concepts of directional differentiability
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Probability
- Proximité et dualité dans un espace hilbertien
- Robust inversion, dimensionality reduction, and randomized sampling
- Robust Statistics
- Sampling: design and analysis
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- Solving nuclear norm regularized and semidefinite matrix least squares problems with linear equality constraints
- Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity
- Stochastic dual coordinate ascent methods for regularized loss minimization
- Stochastic Estimation of the Maximum of a Regression Function
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Stochastic model-based minimization of weakly convex functions
- Tame functions are semismooth
- The Elements of Statistical Learning
- The importance of better models in stochastic optimization
- Variational Analysis
Cited in
(2)
This page was built for publication: A semismooth Newton stochastic proximal point algorithm with variance reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6490309)
