Convergence of Algorithms in Optimization and Solutions of Nonlinear Equations

B. S. Goh ()
Additional contact information
B. S. Goh: Nanjing University

Journal of Optimization Theory and Applications, 2010, vol. 144, issue 1, No 4, 43-55

Abstract: Abstract It is desirable that an algorithm in unconstrained optimization converges when the guessed initial position is anywhere in a large region containing a minimum point. Furthermore, it is useful to have a measure of the rate of convergence which can easily be computed at every point along a trajectory to a minimum point. The Lyapunov function method provides a powerful tool to study convergence of iterative equations for computing a minimum point of a nonlinear unconstrained function or a solution of a system of nonlinear equations. It is surprising that this popular and powerful tool in the study of dynamical systems is not used directly to analyze the convergence properties of algorithms in optimization. We describe the Lyapunov function method and demonstrate how it can be used to study convergence of algorithms in optimization and in solutions of nonlinear equations. We develop an index which can measure the rate of convergence at all points along a trajectory to a minimum point and not just at points in a small neighborhood of a minimum point. Furthermore this index can be computed when the calculations are being carried out.

Keywords: Convergence; Rates of convergence; Lyapunov function; Unconstrained optimization; Solutions of equations; Steepest descent method; Newton method (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10957-009-9583-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:144:y:2010:i:1:d:10.1007_s10957-009-9583-7

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-009-9583-7

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().