Swarming for Faster Convergence in Stochastic Optimization
From MaRDI portal
Publication:4582016
DOI10.1137/17M1111085zbMath1401.90138arXiv1806.04207OpenAlexW2964263318MaRDI QIDQ4582016
Publication date: 22 August 2018
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.04207
Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Stochastic programming (90C15)
Related Items (3)
Erratum: Swarming for Faster Convergence in Stochastic Optimization ⋮ Distributed stochastic gradient tracking methods ⋮ Fast Decentralized Nonconvex Finite-Sum Optimization with Recursive Variance Reduction
Uses Software
Cites Work
- Unnamed Item
- Noise Reduction by Swarming in Social Foraging
- Swarm Stability and Optimization
- A Model Reference Adaptive Search Method for Global Optimization
- Robust Stochastic Approximation Approach to Stochastic Programming
- Adaptive Penalty-Based Distributed Stochastic Convex Optimization
- A class of attractions/repulsion functions for stable swarm aggregations
- A Flocking-Based Approach for Distributed Stochastic Optimization
- Distributed Subgradient Methods for Convex Optimization Over Random Networks
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Stochastic Estimation of the Maximum of a Regression Function
- A Stochastic Approximation Method
- Design and analysis of simulation experiments
This page was built for publication: Swarming for Faster Convergence in Stochastic Optimization