High probability complexity bounds for adaptive step search based on stochastic oracles
type: Item
instance of: scholarly article
title: High probability complexity bounds for adaptive step search based on stochastic oracles
author: Billy Jin
author: Katya Scheinberg
author: Miaolan Xie
published in: SIAM Journal on Optimization
publication date: 2024-07-16T00:00:00Z
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7881527
zbMATH Keywords: nonlinear optimization
zbMATH Keywords: stochastic optimization
zbMATH Keywords: line search
zbMATH Keywords: step search
zbMATH Keywords: high probability
zbMATH Keywords: complexity bound
zbMATH Keywords: stochastic oracles
MaRDI profile type: Publication
cites work: Weighted sums of certain dependent random variables
cites work: A theoretical and empirical comparison of gradient approximations in derivative-free optimization
cites work: Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise
cites work: Optimization Methods for Large-Scale Machine Learning
cites work: Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
cites work: Complexity and global rates of trust-region methods based on probabilistic models
cites work: Random gradient-free minimization of convex functions
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Q5491447
cites work: A Stochastic Line Search Method with Expected Complexity Analysis
cites work: Q5593503
cites work: High-Dimensional Probability
DOI: 10.1137/22M1512764
description: scientific article; zbMATH DE number 7881527