Convergence of nonmonotone line search method
From MaRDI portal
Publication:2493941
DOI10.1016/j.cam.2005.06.033zbMath1136.90477OpenAlexW2005635176MaRDI QIDQ2493941
Publication date: 16 June 2006
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2005.06.033
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items (18)
A class of nonmonotone Armijo-type line search method for unconstrained optimization ⋮ A nonmonotone line search slackness technique for unconstrained optimization ⋮ The convergence of conjugate gradient method with nonmonotone line search ⋮ A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in \(m \times n\) real matrix space with application in image clustering ⋮ Nonmonotone adaptive trust region method ⋮ On the Hybridization of the Double Step Length Method for Solving System of Nonlinear Equations ⋮ An inexact line search approach using modified nonmonotone strategy for unconstrained optimization ⋮ Multivariate spectral gradient method for unconstrained optimization ⋮ A nonmonotone Jacobian smoothing inexact Newton method for NCP ⋮ An inexact and nonmonotone proximal method for smooth unconstrained minimization ⋮ A nonmonotone PSB algorithm for solving unconstrained optimization ⋮ Modified nonmonotone Armijo line search for descent method ⋮ Sufficient descent directions in unconstrained optimization ⋮ An ODE-based nonmonotone method for unconstrained optimization problems ⋮ A new family of conjugate gradient methods ⋮ A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations ⋮ A nonmonotone line search method and its convergence for unconstrained optimization ⋮ Assessing the potential of interior point barrier filter line search methods: nonmonotoneversusmonotone approach
Uses Software
Cites Work
- Unnamed Item
- New inexact line search method for unconstrained optimization
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Optimization. Algorithms and consistent approximations
- Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- Convergence of line search methods for unconstrained optimization
- A class of gradient unconstrained minimization algorithms with adaptive stepsize
- Minimization of functions having Lipschitz continuous first partial derivatives
- Testing Unconstrained Optimization Software
- On Convergence Properties of Algorithms for Unconstrained Minimization
- Numerical Optimization
- CUTE
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- On Steepest Descent
- On the nonmonotone line search
This page was built for publication: Convergence of nonmonotone line search method