Convergence and Stability of Line Search Methods for Unconstrained Optimization
MetadataShow full item record
This paper explores the stability of general line search methods in the sense of Lyapunov, for minimizing a smooth nonlinear function. In particular we give sufficient conditions for a line search method to be globally asymptotical stable. Our analysis suggests that the proposed sufficient conditions for asymptotical stability is equivalent to the Zoutendijk-type conditions in conventional global convergence analysis.
Showing items related by title, author, creator and subject.
Goh, Bean San; McDonald, D. (2015)Fundamental insight into the solution of systems of nonlinear equations was provided by Powell. It was found that Newton iterations, with exact line searches, did not converge to a stationary point of the natural merit ...
Nordin, Syarifah Zyurina (2011)Task scheduling in parallel processing systems is one of the most challenging industrial problems. This problem typically arises in the manufacturing and service industries. The task scheduling problem is to determine a ...
Goh, B.; Leong, W.; Teo, Kok Lay (2014)An iterative method to compute the minimum point in an unconstrained optimization problem can be viewed as a control system. Thus to achieve robust solutions it is desirable to have feedback solution rather than open ...