Efficent line search algorithm for unconstrained optimization

DOI10.1007/BF02193062zbMath0831.90106OpenAlexW2091683542MaRDI QIDQ1896577

Yixun Shi, Florian A. Potra

Publication date: 4 September 1995

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02193062

zbMATH Keywords

smooth unconstrained optimizationline search algorithm

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

Convergence of line search methods for unconstrained optimization, Solving linear systems involved in constrained optimization, The convergence of subspace trust region methods, The application of gradient-only optimization methods for problems discretized using non-constant methods, Real-time motion planning for multibody systems, Nonmonotone adaptive trust region method, An accelerated double step size model in unconstrained optimization, Accelerated double direction method for solving unconstrained optimization problems, Hybridization of accelerated gradient descent method, New BFGS method for unconstrained optimization problem based on modified Armijo line search, An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion, Adaptive fault-tolerant position control of a hexacopter subject to an unknown motor failure, Accelerated gradient descent methods with line search, A multi-local optimization algorithm, Computer Algebra and Line Search, A globalization procedure for solving nonlinear systems of equations, Acceleration of conjugate gradient algorithms for unconstrained optimization, A new trust region method with adaptive radius, Stochastic iterative dynamic programming: a Monte Carlo approach to dual control

Uses Software

• minpack
• BRENT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimization of functions having Lipschitz continuous first partial derivatives
• Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
• Testing Unconstrained Optimization Software
• A note on a sufficient-decrease criterion for a non-derivative step-length procedure
• Convergence Conditions for Ascent Methods
• On Steepest Descent