A nonmonotone line search method for noisy minimization
DOI10.1007/S11590-015-0848-9zbMATH Open1327.90396OpenAlexW2079413259WikidataQ105583481 ScholiaQ105583481MaRDI QIDQ499697FDOQ499697
Irena Stojkovska, Nataลกa Krejiฤ, Zorana Luzanin, Filip Nikolovski
Publication date: 6 October 2015
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0848-9
Numerical mathematical programming methods (65K05) Derivative-free methods and methods using generalized derivatives (90C56)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Testing Unconstrained Optimization Software
- A derivative-free algorithm for bound constrained optimization
- Benchmarking optimization software with performance profiles.
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Introduction to Stochastic Search and Optimization
- A Nonmonotone Line Search Technique for Newtonโs Method
- Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
- Globally convergent inexact quasi-Newton methods for solving nonlinear systems
- A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
- Derivative-Free Optimization of Expensive Functions with Computational Error Using Weighted Regression
- A derivative-free nonmonotone line search and its application to the spectral residual method
- A new nonmonotone line search technique for unconstrained optimization
- A derivative-free nonmonotone line-search technique for unconstrained optimization
- A Scaled Stochastic Approximation Algorithm
- New stochastic approximation algorithms with adaptive step sizes
- Globally convergent Jacobian smoothing inexact Newton methods for NCP
- Nonmonotone line search methods with variable sample size
- A gradient method for unconstrained optimization in noisy environment
- A new second order fully-discrete scheme for sine-Gordon equations with \(EQ^{\text{rot}_1}\) nonconforming finite element
Cited In (4)
- Improved variance reduction extragradient method with line search for stochastic variational inequalities
- Complex-step derivative approximation in noisy environment
- Variance-Based Extragradient Methods with Line Search for Stochastic Variational Inequalities
- On the accuracy of the complex-step-finite-difference method
Uses Software
Recommendations
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization ๐ ๐
- A non-monotone line search algorithm for unconstrained optimization ๐ ๐
- Linesearch Newton-CG methods for convex optimization with noise ๐ ๐
- A class of line search-type methods for nonsmooth convex regularized minimization ๐ ๐
- A subgradient method with non-monotone line search ๐ ๐
- A nonmonotone line search method and its convergence for unconstrained optimization ๐ ๐
- A matrix-free line-search algorithm for nonconvex optimization ๐ ๐
- A nonmonotone line search method for stochastic optimization problems ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
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)