A stochastic algorithm using one sample point per iteration and diminishing step-sizes
From MaRDI portal
(Redirected from Publication:1102867)
Recommendations
Cites work
- scientific article; zbMATH DE number 3493681 (Why is no real title available?)
- scientific article; zbMATH DE number 3638844 (Why is no real title available?)
- scientific article; zbMATH DE number 3310599 (Why is no real title available?)
- scientific article; zbMATH DE number 3407464 (Why is no real title available?)
- A Stochastic Approximation Method
- A stochastic algorithm for optimization problems with continua of inequalities
- A stochastic steepest-descent algorithm
- Minimization of functions having Lipschitz continuous first partial derivatives
- Stochastic Estimation of the Maximum of a Regression Function
- Stochastic approximation algorithms for constrained optimization problems
- Stochastic approximation algorithms for the local optimization of functions with nonunique stationary points
- Stochastic approximation type methods for constrained systems: Algorithms and numerical results
Cited in
(7)- scientific article; zbMATH DE number 18485 (Why is no real title available?)
- Stochastic algorithms with Armijo stepsizes for minimization of functions
- scientific article; zbMATH DE number 926779 (Why is no real title available?)
- On a proof of Robbins-Monro algorithm
- A stochastic steepest-descent algorithm
- scientific article; zbMATH DE number 4091202 (Why is no real title available?)
- Stochastic proximal gradient methods for nonconvex problems in Hilbert spaces
This page was built for publication: A stochastic algorithm using one sample point per iteration and diminishing step-sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102867)