Convergence and stability of line search methods for unconstrained optimization
From MaRDI portal
The authors explore the stability of general line search methods in the sense of Lyapunov, for minimizing a smooth nonlinear function. The given analysis suggests that the proposed sufficient conditions for asymptotical stability is equivalent to the Zoutendijk-type conditions in conventional global convergence analysis.
Recommendations
- Convergence of line search methods for unconstrained optimization
- scientific article; zbMATH DE number 2238084
- Global convergence and stabilization of unconstrained minimization methods without derivatives
- scientific article; zbMATH DE number 853073
- A nonmonotone line search method and its convergence for unconstrained optimization
Cites work
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- Convergence of algorithms in optimization and solutions of nonlinear equations
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global attractivity and stability of a scalar nonlinear difference equation
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Global convergence result for conjugate gradient methods
- Greatest descent algorithms in unconstrained optimization
- scientific article; zbMATH DE number 88930 (Why is no real title available?)
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- scientific article; zbMATH DE number 3529352 (Why is no real title available?)
- scientific article; zbMATH DE number 3568468 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Minimization of functions having Lipschitz continuous first partial derivatives
- Nonlinear Difference Equations and Gauss-Seidel Type Iterative Methods
- On Steepest Descent
- Stability by Liapunov's direct method. With applications
- Stability of Difference Equations and Convergence of Iterative Processes
- Trust Region Methods
- Über die Anwendung der Methode von Ljupanov auf Differenzengleichungen
Cited in
(15)- Global convergence and stabilization of unconstrained minimization methods without derivatives
- Convergence of line search methods for unconstrained optimization
- Efficent line search algorithm for unconstrained optimization
- Line search methods with guaranteed asymptotical convergence to an improving local optimum of multimodal functions
- Local stability and local convergence of the basic trust-region method
- A scaled three-term conjugate gradient method for unconstrained optimization
- On the divergence of line search methods
- Line search algorithms with guaranteed sufficient decrease
- Optimisation and asymptotic stability
- scientific article; zbMATH DE number 853073 (Why is no real title available?)
- Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise
- Stationarity Results for Generating Set Search for Linearly Constrained Optimization
- scientific article; zbMATH DE number 2238084 (Why is no real title available?)
- On a solution method in indefinite quadratic programming under linear constraints
- Convergence rate of gradient-concordant methods for smooth unconstrained optimization
This page was built for publication: Convergence and stability of line search methods for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385584)
