Convergence property of gradient-type methods with non-monotone line search in the presence of perturbations
From MaRDI portal
Publication:2489332
Recommendations
- scientific article; zbMATH DE number 5371452
- Convergence analysis of perturbed gradient methods and hybrid projection methods
- A nonmonotone line search method and its convergence for unconstrained optimization
- New convergence method with nonmonotone line search
- Convergence of nonmonotone line search method
Cites work
- A New Projection Method for Variational Inequality Problems
- A Nonmonotone Line Search Technique for Newton’s Method
- A Truly Globally Convergent Newton-Type Method for the Monotone Nonlinear Complementarity Problem
- A truncated Newton method with non-monotone line search for unconstrained optimization
- An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule
- Convergence analysis of perturbed feasible descent methods
- Descent methods with linesearch in the presence of perturbations
- Gradient Convergence in Gradient methods with Errors
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 1321699 (Why is no real title available?)
- scientific article; zbMATH DE number 735099 (Why is no real title available?)
- Mathematical Programming in Neural Networks
- Pseudogradient adaptation and training algorithms
Cited in
(4)
This page was built for publication: Convergence property of gradient-type methods with non-monotone line search in the presence of perturbations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489332)