A Stochastic Line Search Method with Expected Complexity Analysis
From MaRDI portal
Publication:5215517
DOI10.1137/18M1216250zbMath1431.90153arXiv1807.07994OpenAlexW3005484777MaRDI QIDQ5215517
Katya Scheinberg, Courtney Paquette
Publication date: 12 February 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.07994
Related Items (35)
Stochastic analysis of an adaptive cubic regularization method under inexact gradient evaluations and dynamic Hessian accuracy ⋮ A discussion on variational analysis in derivative-free optimization ⋮ A theoretical and empirical comparison of gradient approximations in derivative-free optimization ⋮ A Variable Sample-Size Stochastic Quasi-Newton Method for Smooth and Nonsmooth Stochastic Convex Optimization ⋮ Stochastic Trust-Region Methods with Trust-Region Radius Depending on Probabilistic Models ⋮ Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions ⋮ Parameter calibration in wake effect simulation model with stochastic gradient descent and stratified sampling ⋮ An adaptive stochastic sequential quadratic programming with differentiable exact augmented Lagrangians ⋮ Zeroth-order optimization with orthogonal random directions ⋮ A stochastic gradient method for a class of nonlinear PDE-constrained optimal control problems under uncertainty ⋮ Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programming ⋮ A trust region method for noisy unconstrained optimization ⋮ Direct Search Based on Probabilistic Descent in Reduced Spaces ⋮ A simplified convergence theory for Byzantine resilient stochastic gradient descent ⋮ Adaptive step size rules for stochastic optimization in large-scale learning ⋮ Stochastic regularized Newton methods for nonlinear equations ⋮ A line search based proximal stochastic gradient algorithm with dynamical variance reduction ⋮ Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates ⋮ Trust-region algorithms: probabilistic complexity and intrinsic noise with applications to subsampling techniques ⋮ Discriminative Bayesian filtering lends momentum to the stochastic Newton method for minimizing log-convex functions ⋮ The impact of noise on evaluation complexity: the deterministic trust-region case ⋮ Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates ⋮ Analysis of the BFGS Method with Errors ⋮ A stochastic subspace approach to gradient-free optimization in high dimensions ⋮ Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives ⋮ Derivative-free optimization methods ⋮ Expected complexity analysis of stochastic direct-search ⋮ Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise ⋮ Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization ⋮ Linesearch Newton-CG methods for convex optimization with noise ⋮ Inexact SARAH algorithm for stochastic optimization ⋮ Optimization of Stochastic Blackboxes with Adaptive Precision ⋮ A stochastic first-order trust-region method with inexact restoration for finite-sum minimization ⋮ An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems ⋮ LSOS: Line-search second-order stochastic optimization methods for nonconvex finite sums
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Sample size selection in optimization methods for machine learning
- Adaptive stepsizes for recursive estimation with applications in approximate dynamic programming
- Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
- Stochastic optimization using a trust-region method and random models
- Minimization of functions having Lipschitz continuous first partial derivatives
- Hybrid Deterministic-Stochastic Methods for Data Fitting
- Convergence of Trust-Region Methods Based on Probabilistic Models
- Adaptive Sampling Strategies for Stochastic Optimization
- Probabilistic Line Searches for Stochastic Optimization
- An Introduction to Matrix Concentration Inequalities
- A Stochastic Approximation Method
This page was built for publication: A Stochastic Line Search Method with Expected Complexity Analysis
