mlsanityData to 7 Oct 2026

Stochastic Optimization Using a Trust-Region Method and Random Models

arXiv 1504.04231 ↗First posted 16 Apr 2015math.OCcited by 25

Not on the map. Why?

Abstract (arXiv)

In this paper, we propose and analyze a trust-region model-based algorithm for solving unconstrained stochastic optimization problems. Our framework utilizes random models of an objective function f(x), obtained from stochastic observations of the function or its gradient. Our method also utilizes estimates of function values to gauge progress that is being made. The convergence analysis relies on requirements that these models and these estimates are sufficiently accurate with sufficiently high, but fixed, probability. Beyond these conditions, no assumptions are made on how these models and estimates are generated. Under these general conditions we show an almost sure global convergence of the method to a first order stationary point. In the second part of the paper, we present examples of generating sufficiently accurate random models under biased or unbiased noise assumptions. Lastly, we present some computational results showing the benefits of the proposed method compared to existing approaches that are based on sample averaging or stochastic gradients.

Key facts. Cited by 25 papers in the map (data through 7 Oct 2026). First posted on arXiv 16 Apr 2015.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 7; 2022: 6; 2023: 4; 2024: 5; 2025: 1; 2026: 2.

25 papers.

Sort:

  1. 2021TREGO: a Trust-Region Framework for Efficient Global Optimizationcited by 28
  2. 2021An Adaptive Stochastic Sequential Quadratic Programming with Differentiable Exact Augmented Lagrangianscited by 25
  3. 2022Fully Stochastic Trust-Region Sequential Quadratic Programming for Equality-Constrained Optimization Problemscited by 21
  4. 2021Inequality Constrained Stochastic Nonlinear Optimization via Active-Set Sequential Quadratic Programmingcited by 16
  5. 2022Hessian Averaging in Stochastic Newton Methods Achieves Superlinear Convergencecited by 14
  6. 2021Globally Convergent Multilevel Training of Deep Residual Networkscited by 11
  7. 2023A Sequential Quadratic Programming Method with High Probability Complexity Bounds for Nonlinear Equality Constrained Stochastic Optimizationcited by 8
  8. 2021Direct-Search for a Class of Stochastic Min-Max Problemscited by 7
  9. 2023No-Regret Constrained Bayesian Optimization of Noisy and Expensive Hybrid Models using Differentiable Quantile Function Approximationscited by 6
  10. 2022Riemannian Natural Gradient Methodscited by 5
  11. 2024Trust-Region Sequential Quadratic Programming for Stochastic Optimization with Random Modelscited by 5
  12. 2021Adaptive Sampling Quasi-Newton Methods for Zeroth-Order Stochastic Optimizationcited by 4
13 more
  1. 2025High Probability Complexity Bounds of Trust-Region Stochastic Sequential Quadratic Programming with Heavy-Tailed Noisecited by 4
  2. 2024The Stochastic Conjugate Subgradient Algorithm For Kernel Support Vector Machinescited by 3
  3. 2023Stochastic Optimization for Non-convex Problem with Inexact Hessian Matrix, Gradient, and Functioncited by 2
  4. 2021Adaptive First- and Second-Order Algorithms for Large-Scale Machine Learningcited by 1
  5. 2022A Globally Convergent Evolutionary Strategy for Stochastic Constrained Optimization with Applications to Reinforcement Learningcited by 1
  6. 2022A Novel Fast Exact Subproblem Solver for Stochastic Quasi-Newton Cubic Regularized Optimizationcited by 1
  7. 2022On the efficiency of Stochastic Quasi-Newton Methods for Deep Learningcited by 1
  8. 2023A randomized algorithm for nonconvex minimization with inexact evaluations and complexity guaranteescited by 1
  9. 2024Global Optimisation of Black-Box Functions with Generative Models in the Wasserstein Spacecited by 1
  10. 2024A Trust-Region Algorithm for Noisy Equality Constrained Optimizationcited by 1
  11. 2024Probabilistic Iterative Hard Thresholding for Sparse Learningcited by 0
  12. 2026Stochastic Trust-Region Methods for Over-parameterized Modelscited by 0
  13. 2026The cost of useful natural gradient updatescited by 0