Stochastic trust-region algorithm in random subspaces with convergence and expected complexity analyses

Cites Work

ASTRO-DF: a class of adaptive sampling trust-region algorithms for derivative-free stochastic optimization
Extensions of Lipschitz mappings into a Hilbert space
A basic course in probability theory
Title not available (Why is that?)
Adaptive estimation of a quadratic functional by model selection.
Sharp nonasymptotic bounds on the norm of random matrices with independent entries
Title not available (Why is that?)
The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
Introduction to Derivative-Free Optimization
Benchmarking Derivative-Free Optimization Algorithms
Stochastic optimization using a trust-region method and random models
Estimating derivatives of noisy simulations
Stochastic Nelder-Mead simplex method -- a new globally convergent direct search method for simulation optimization
Sparser Johnson-Lindenstrauss transforms
A Stochastic Line Search Method with Expected Complexity Analysis
Derivative-free and blackbox optimization
The random matrix theory of the classical compact groups
Sketching as a tool for numerical linear algebra
Derivative-free optimization methods
Stochastic Trust-Region Methods with Trust-Region Radius Depending on Probabilistic Models
Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates
Scalable subspace methods for derivative-free nonlinear least-squares optimization
Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise
Expected complexity analysis of stochastic direct-search
Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates
A Stochastic Levenberg--Marquardt Method Using Random Models with Complexity Results
Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization
Optimization by moving ridge functions: derivative-free optimization for computationally intensive functions
Direct Search Based on Probabilistic Descent in Reduced Spaces

Cited In (1)

Expected decrease for derivative-free algorithms using random subspaces

This page was built for publication: Stochastic trust-region algorithm in random subspaces with convergence and expected complexity analyses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580002)