Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Vaidya's method for convex stochastic optimization problems in small dimension

From MaRDI portal
Publication:2170511
Jump to:navigation, search

DOI10.1134/S0001434622070227zbMath1500.90034MaRDI QIDQ2170511

E. S. Ermakova, Alexander V. Gasnikov, E. Gladin

Publication date: 6 September 2022

Published in: Mathematical Notes (Search for Journal in Brave)


zbMATH Keywords

stochastic optimizationconvex optimizationcutting plane methodmini-batching


Mathematics Subject Classification ID

Convex programming (90C25) Stochastic programming (90C15)





Cites Work

  • Geometric algorithms and combinatorial optimization.
  • Accelerated and unaccelerated stochastic gradient descent in model generality
  • Lower Bounds for Parallel and Randomized Convex Optimization
  • Optimal Distributed Online Prediction using Mini-Batches
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Vaidya's method for convex stochastic optimization problems in small dimension

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2170511&oldid=14697827"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 2 February 2024, at 01:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki