Optimal Algorithms and the BFGS Updating Techniques for Solving Unconstrained Nonlinear Minimization Problems
To solve an unconstrained nonlinear minimization problem, we propose an optimal algorithm (OA) as well as a globally optimal algorithm (GOA), by deflecting the gradient direction to the best descent direction at each iteration step, and with an optimal parameter being derived explicitly. An invarian...
Saved in:
Main Author: | Chein-Shan Liu |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2014-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2014/324181 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The Hybrid BFGS-CG Method in Solving Unconstrained Optimization Problems
by: Mohd Asrul Hery Ibrahim, et al.
Published: (2014-01-01) -
An Optimally Generalized Steepest-Descent Algorithm for Solving Ill-Posed Linear Systems
by: Chein-Shan Liu
Published: (2013-01-01) -
Extra multistep BFGS updates in quasi-Newton methods
by: Issam A. R. Moghrabi
Published: (2006-01-01) -
A Limited Memory BFGS Method for Solving Large-Scale Symmetric Nonlinear Equations
by: Xiangrong Li, et al.
Published: (2014-01-01) -
A New Hybrid Algorithm for Convex Nonlinear Unconstrained Optimization
by: Eman T. Hamed, et al.
Published: (2019-01-01)