A nonmonotone line search method for noisy minimization
From MaRDI portal
Publication:499697
Recommendations
- A nonmonotone line search method for stochastic optimization problems
- A non-monotone line search algorithm for unconstrained optimization
- A nonmonotone line search method and its convergence for unconstrained optimization
- A subgradient method with non-monotone line search
- A nonmonotone line search algorithm for nonsmooth discrete minimax problem
- Linesearch Newton-CG methods for convex optimization with noise
- scientific article; zbMATH DE number 5926088
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A class of line search-type methods for nonsmooth convex regularized minimization
- A matrix-free line-search algorithm for nonconvex optimization
Cites work
- scientific article; zbMATH DE number 1274356 (Why is no real title available?)
- scientific article; zbMATH DE number 852532 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A Scaled Stochastic Approximation Algorithm
- A derivative-free algorithm for bound constrained optimization
- A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
- A derivative-free nonmonotone line search and its application to the spectral residual method
- A derivative-free nonmonotone line-search technique for unconstrained optimization
- A gradient method for unconstrained optimization in noisy environment
- A new nonmonotone line search technique for unconstrained optimization
- A new second order fully-discrete scheme for sine-Gordon equations with \(EQ^{\text{rot}_1}\) nonconforming finite element
- Benchmarking optimization software with performance profiles.
- Derivative-free optimization of expensive functions with computational error using weighted regression
- Globally convergent Jacobian smoothing inexact Newton methods for NCP
- Globally convergent inexact quasi-Newton methods for solving nonlinear systems
- Introduction to Stochastic Search and Optimization
- New stochastic approximation algorithms with adaptive step sizes
- Nonmonotone line search methods with variable sample size
- Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
- Testing Unconstrained Optimization Software
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The NEWUOA software for unconstrained optimization without derivatives
- Two-Point Step Size Gradient Methods
Cited in
(9)
- Variance-based extragradient methods with line search for stochastic variational inequalities
- Nonmonotone line search methods with variable sample size
- A gradient method for unconstrained optimization in noisy environment
- Improved variance reduction extragradient method with line search for stochastic variational inequalities
- Complex-step derivative approximation in noisy environment
- Descent direction method with line search for unconstrained optimization in noisy environment
- A nonmonotone line search method for stochastic optimization problems
- On the accuracy of the complex-step-finite-difference method
- Title not available (Why is no real title available?)
This page was built for publication: A nonmonotone line search method for noisy minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499697)