Convergence of descent method with new line search
From MaRDI portal
Publication:815995
DOI10.1007/BF02831936zbMath1137.90674OpenAlexW1991034003MaRDI QIDQ815995
Publication date: 20 February 2006
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02831936
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items
Real-time motion planning for multibody systems, Convergence rate of descent method with new inexact line-search on Riemannian manifolds
Uses Software
Cites Work
- Global convergence of nonmonotone descent methods for unconstrained optimization problems
- 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
- Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
- Convergence of line search methods for unconstrained optimization
- Weak sufficient convergence conditions and applications for Newton methods
- A new unconstrained optimization method for imprecise function and gradient values
- A class of gradient unconstrained minimization algorithms with adaptive stepsize
- Minimization of functions having Lipschitz continuous first partial derivatives
- An adaptive approach of conic trust-region method for unconstrained optimization problems
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- Testing Unconstrained Optimization Software
- On Convergence Properties of Algorithms for Unconstrained Minimization
- Numerical Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- On the Barzilai and Borwein choice of steplength for the gradient method
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- On Steepest Descent