Convergence and stability of line search methods for unconstrained optimization.

QR Code

Convergence and stability of line search methods for unconstrained optimization.

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 condition...

Full description

Bibliographic Details
Main Authors:	Leong, Wah June, Goh, Bean San
Format:	Article
Language:	English English
Published:	Springer Verlag 2013
Online Access:	http://psasir.upm.edu.my/id/eprint/30004/ http://psasir.upm.edu.my/id/eprint/30004/1/Convergence%20and%20stability%20of%20line%20search%20methods%20for%20unconstrained%20optimization.pdf

Similar Items

Convergence and Stability of Line Search Methods for Unconstrained Optimization
by: Leong, Wah, et al.
Published: (2013)

A three-term conjugate gradient method with nonmonotone line search for unconstrained optimization
by: Moyi, Aliyu Usman, et al.
Published: (2016)

Robustness of convergence proofs in numerical methods in unconstrained optimization
by: Goh, B., et al.
Published: (2014)

Modified Quasi-Newton Methods For Large-Scale Unconstrained Optimization
by: Leong, Wah June
Published: (2003)

Efficient ODE-based methods for unconstrained optimization
by: Yap, Chui Ying, et al.
Published: (2018)

Structured symmetric rank-one method for unconstrained optimization
by: Modarres, Farzin, et al.
Published: (2011)

The CG-BFGS method for unconstrained optimization problems
by: Ibrahim, Mohd Asrul Hery, et al.
Published: (2013)

The hybrid BFGS-CG method in solving unconstrained optimization problems
by: Ibrahim, Mohd Asrul Hery, et al.
Published: (2014)

Gradient method with multiple damping for large-scale unconstrained optimization
by: Sim, Hong Seng, et al.
Published: (2019)

Scaled memoryless symmetric rank one method for large-scale unconstrained optimization
by: Leong, Wah June, et al.
Published: (2008)

A new inexact line search method for convex optimization problems
by: Moyi, Aliyu Usman, et al.
Published: (2013)

Preconditioning on subspace quasi-Newton method for large scale unconstrained optimization
by: Sim, Hong Seng, et al.
Published: (2013)

A new modified conjugate gradient method under the strong Wolfe line search for solving unconstrained optimization problems
by: Ishak, M. I., et al.
Published: (2022)

New BFGS method for unconstrained optimization problem based on modified Armijo line search
by: Wan, Zhong, et al.
Published: (2012)

A new diagonal gradient-type method for large scale unconstrained optimization
by: Farid, Mahboubeh, et al.
Published: (2013)

Positive-definite memoryless symmetric rank one method for large-scale unconstrained optimization
by: Leong, Wah June, et al.
Published: (2011)

Quasi-Newton methods based on ordinary differential equation approach for unconstrained nonlinear optimization
by: Khiyabani, Farzin Modarres, et al.
Published: (2014)

A scaled three-term conjugate gradient method for unconstrained optimization
by: Arzuka, Ibrahim, et al.
Published: (2016)

Memoryless modified symmetric rank-one method for large-scale unconstrained optimization
by: Modarres, Farzin, et al.
Published: (2009)

A monotone gradient method via weak secant equation for unconstrained optimization
by: Leong, Wah June, et al.
Published: (2010)

Scaled memoryless BFGS preconditioned steepest descent method for very large-scale unconstrained optimization
by: Leong, Wah June, et al.
Published: (2009)

A class of diagonally preconditioned limited memory BFGS method for large scale unconstrained optimization
by: Leong, Wah June, et al.
Published: (2009)

Diagonal preconditioned conjugate gradient algorithm for unconstrained optimization
by: Ng, Choong Boon, et al.
Published: (2014)

A new two-step gradient-type method for large-scale unconstrained optimization
by: Farid, Mahboubeh, et al.
Published: (2010)

A symmetric rank-one method based on extra updating techniques for unconstrained optimization.
by: Modarres, Farzin, et al.
Published: (2011)

A restarting approach on symmetric rank one update for unconstrained optimization
by: Leong, Wah June, et al.
Published: (2009)

On the Modifications of a Broyden's Single Parameter Rank-Two Quasi-Newton Method for Unconstrained Minimization
by: Leong, Wah June
Published: (1999)

Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization
by: Farid, Mahboubeh, et al.
Published: (2013)

Memoryless quasi-Newton-type methods via some weak secant relations for large-scale unconstrained optimization
by: Lim, Keat Hee, et al.
Published: (2024)

Multi-steps symmetric rank-one update for unconstrained optimization
by: Modarres, Farzin, et al.
Published: (2009)

The algorithms of Broyden-CG for unconstrained optimization problems
by: Ibrahim, Mohd Asrul Hery, et al.
Published: (2014)

Comparison of the AIM conjugate gradient method under exact and inexact line search for solving unconstrained optimization problems
by: Za’aba, Fatin Nadhirah, et al.
Published: (2021)

Memoryless symmetric rank-one method based on modified secant equation for large-scale unconstrained optimization
by: Khiyabani, Farzin Modarres, et al.
Published: (2009)

Partial Newton methods for a system of equations
by: Goh, Bean San, et al.
Published: (2013)

Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization
by: Hong, Seng Sim, et al.
Published: (2021)

Multi-step spectral gradient methods with modified weak secant relation for large scale unconstrained optimization
by: Hong, Seng Sim, et al.
Published: (2018)

Gradient-Type Methods for Unconstrained Optimization
by: Guan, Hui Shan
Published: (2015)

Global and local convergence of a filter line search method for nonlinear programming.
by: Chin, Choong Ming, et al.
Published: (2007)

Convergence of a positive definite symmetric rank one method with restart
by: Leong, Wah June, et al.
Published: (2009)

Convergence of the Steepest Descent Method for Minimizing Convex Functions
by: Abu Hassan, Malik, et al.
Published: (2002)