Truncated Cauchy random perturbations for smoothed functional-based stochastic optimization
From MaRDI portal
Publication:6491100
DOI10.1016/J.AUTOMATICA.2024.111528WikidataQ129437719 ScholiaQ129437719MaRDI QIDQ6491100
Unnamed Author, Shalabh Bhatnagar, Akash Mondal
Publication date: 24 April 2024
Published in: Automatica (Search for Journal in Brave)
smoothed functional (SF) algorithmsstochastic non-convex optimizationtruncated Cauchy perturbationszeroth-order gradient estimation
Cites Work
- Unnamed Item
- Unnamed Item
- First-order methods of smooth convex optimization with inexact oracle
- Stochastic recursive algorithms for optimization. Simultaneous perturbation methods
- Nonconvergence to unstable points in urn models and stochastic approximations
- Stochastic approximation methods for constrained and unconstrained systems
- Random gradient-free minimization of convex functions
- Convergence of a class of random search algorithms
- Zeroth-order nonconvex stochastic optimization: handling constraints, high dimensionality, and saddle points
- Smoothed Functionals and Constrained Stochastic Approximation
- Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
- Convergence rate of moments in stochastic approximation with simultaneous perturbation gradient approximation and resetting
- Adaptive Newton-based multivariate smoothed functional algorithms for simulation optimization
- A Dynamical System Approach to Stochastic Approximations
- Adaptive System Optimization Using Random Directions Stochastic Approximation
- Stochastic Estimation of the Maximum of a Regression Function
- A Stochastic Approximation Method
- Stochastic approximation. A dynamical systems viewpoint
This page was built for publication: Truncated Cauchy random perturbations for smoothed functional-based stochastic optimization
