Informational inequalities in the problem of gradient stochastic optimization and optimal realizable algorithms

MaRDI QIDQ583114zbMATH OpenFDO

Authors Alexander Nazin

Publication date 1989

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

Asymptotic lower boundsrandom noiseunknown objective function

Mathematics Subject Classification ID

Stochastic programming (90C15)

Recommendations

• scientific article; zbMATH DE number 3936292
• scientific article; zbMATH DE number 1045614
• Optimality in problems and optimization algorithms under indeterminacy
• The exact information-based complexity of smooth convex minimization
• Asymptotic optimality in stochastic optimization

Cited in

(5)

• Optimality in problems and optimization algorithms under indeterminacy
• Minimax efficient finite-difference stochastic gradient estimators using black-box function evaluations
• scientific article; zbMATH DE number 3936292 (Why is no real title available?)
• scientific article; zbMATH DE number 1045614 (Why is no real title available?)
• The exact information-based complexity of smooth convex minimization

This page was built for publication: Informational inequalities in the problem of gradient stochastic optimization and optimal realizable algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q583114)