A nonmonotone line search method for stochastic optimization problems

DOI10.2298/FIL1819799KMaRDI QIDQ5086883zbMATH OpenFDO

Authors Nataša Krejić, Sanja Lončar

Publication date 7 July 2022

Published in Filomat (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/FIL1819799K

zbMATH Keywords

sample average approximationunconstrained stochastic problemzero upper density convergence

Mathematics Subject Classification ID

Stochastic programming (90C15) Nonlinear programming (90C30)

Recommendations

• Nonmonotone line search methods with variable sample size
• Line search methods with variable sample size for unconstrained optimization
• A nonmonotone line search method for noisy minimization
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• Nonmonotone line searches for optimization algorithms

Cites work

• A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
• A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
• A stochastic steepest-descent algorithm
• Benchmarking optimization software with performance profiles.
• Introduction to Stochastic Search and Optimization
• Nonmonotone line search methods with variable sample size
• On efficiency of nonmonotone Armijo-type line searches
• On the use of stochastic Hessian information in optimization methods for machine learning
• Optimization algorithm with probabilistic estimation
• Sample size selection in optimization methods for machine learning
• Stochastic algorithms with Armijo stepsizes for minimization of functions

Cited in

(12)

• Line search methods with variable sample size for unconstrained optimization
• Adaptive sampling line search for local stochastic optimization with integer variables
• Iteratively sampling scheme for stochastic optimization with variable number sample path
• Nonmonotone line search methods with variable sample size
• A gradient method for unconstrained optimization in noisy environment
• Probabilistic line searches for stochastic optimization
• A nonmonotone line search method for noisy minimization
• A stochastic line search method with expected complexity analysis
• LSOS: Line-search second-order stochastic optimization methods for nonconvex finite sums
• Probabilistic nonconvex constrained optimization with fixed number of function evaluations
• AN-SPS: adaptive sample size nonmonotone line search spectral projected subgradient method for convex constrained optimization problems
• Spectral projected gradient method for stochastic optimization

This page was built for publication: A nonmonotone line search method for stochastic optimization problems

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