Stochastic trust-region and direct-search methods: a weak tail bound condition and reduced sample sizing
From MaRDI portal
Publication:6561380
Recommendations
- Stochastic derivative-free optimization using a trust region framework
- Expected complexity analysis of stochastic direct-search
- Convergence of trust-region methods based on probabilistic models
- Stochastic optimization using a trust-region method and random models
- Stochastic trust-region algorithm in random subspaces with convergence and expected complexity analyses
Cites work
- A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
- A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
- A stochastic line search method with expected complexity analysis
- ASTRO-DF: a class of adaptive sampling trust-region algorithms for derivative-free stochastic optimization
- Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives
- An introduction to measure theory
- Benchmarking Derivative-Free Optimization Algorithms
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
- Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates
- Convergence of trust-region methods based on probabilistic models
- Derivative-free and blackbox optimization
- Expected complexity analysis of stochastic direct-search
- First-order and stochastic optimization methods for machine learning
- Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
- Inequalities for the $r$th Absolute Moment of a Sum of Random Variables, $1 \leqq r \leqq 2$
- Introduction to Derivative-Free Optimization
- On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
- Probability
- Random gradient-free minimization of convex functions
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Stochastic Zeroth-Order Riemannian Derivative Estimation and Optimization
- Stochastic analysis of an adaptive cubic regularization method under inexact gradient evaluations and dynamic Hessian accuracy
- Stochastic derivative-free optimization using a trust region framework
- Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates
- Stochastic optimization using a trust-region method and random models
- The Exact Constant in the Rosenthal Inequality for Random Variables with Mean Zero
- Trust-region methods for the derivative-free optimization of nonsmooth black-box functions
- Worst case complexity of direct search
This page was built for publication: Stochastic trust-region and direct-search methods: a weak tail bound condition and reduced sample sizing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561380)