A Switching Criterion in Hybrid Quasi-Newton BFGS - Steepest Descent Direction
Two modified methods for unconstrained optimization are presented. The methods employ a hybrid descent direction strategy which uses a linear convex combination of quasi-Newton BFGS and steepest descent as search direction. A switching criterion is derived based on the First and Second order Kuhn-T...
Main Authors: | Abu Hassan, Malik, Monsi, Mansor, Leong, Wah June |
---|---|
Format: | Article |
Language: | English English |
Published: |
Universiti Putra Malaysia Press
1999
|
Online Access: | http://psasir.upm.edu.my/id/eprint/3467/1/A_Switching_Criterion_in_Hybrid_Quasi-Newton.pdf |
Similar Items
-
Scaled memoryless BFGS preconditioned steepest descent method for very large-scale unconstrained optimization
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) -
Perbandingan metode Steepest Descent, Konjugat Gradien dan BFGS Quasi-Newton untuk pembelajaran Feed-Forward Neural Network
by: , SUPRAPTO, et al.
Published: (2006) -
Numerical applications of the generalized method of steepest descents
by: Clarisse, Jean-Marie
Published: (2012) -
BFGS method: a new search direction
by: Ibrahim, Mohd Asrul Hery, et al.
Published: (2014)