Convergence property of gradient-type methods with non-monotone line search in the presence of perturbations

DOI10.1016/j.amc.2005.05.030zbMath1147.65044OpenAlexW1985354717MaRDI QIDQ2489332

Meixia Li, Chang-Yu Wang

Publication date: 16 May 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.05.030

zbMATH Keywords

global convergenceperturbationnumerical exampleshybrid projection methodnon-monotone line searchgradient-type method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

Hybrid nonmonotone spectral gradient method for the unconstrained minimization problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A truncated Newton method with non-monotone line search for unconstrained optimization
• Descent methods with linesearch in the presence of perturbations
• Convergence analysis of perturbed feasible descent methods
• Pseudogradient adaptation and training algorithms
• A New Projection Method for Variational Inequality Problems
• Mathematical Programming in Neural Networks
• An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule
• Gradient Convergence in Gradient methods with Errors
• A Nonmonotone Line Search Technique for Newton’s Method
• A Truly Globally Convergent Newton-Type Method for the Monotone Nonlinear Complementarity Problem