Convergence of a positive definite symmetric rank one method with restart
The paper investigates convergence properties of a positive definite symmetric rank one method with the line search. The method is applied to find a local minimum of the unconstrained minimization problem, the objective function of which is defined on ℝ n and is assumed to be twice continuously diff...
Saved in:
Main Authors: | Leong, Wah June, Abu Hassan, Malik |
---|---|
Format: | Article |
Language: | English |
Published: |
ICI Publishing House
2009
|
Online Access: | http://psasir.upm.edu.my/id/eprint/13791/1/Convergence%20of%20a%20positive%20definite%20symmetric%20rank%20one%20method%20with%20restart.pdf http://psasir.upm.edu.my/id/eprint/13791/ http://camo.ici.ro/journal/v11n4.htm |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A restarting approach on symmetric rank one update for unconstrained optimization
by: Leong, Wah June, et al.
Published: (2009) -
Positive-definite memoryless symmetric rank one method for large-scale unconstrained optimization
by: Leong, Wah June, et al.
Published: (2011) -
Convergence of symmetric rank-one method based on modified Quasi-Newton equation
by: Khiyabani, Farzin Modarres, et al.
Published: (2010) -
Structured symmetric rank-one method for unconstrained optimization
by: Modarres, Farzin, et al.
Published: (2011) -
Scaled memoryless symmetric rank one method for large-scale optimization.
by: Leong, Wah June, et al.
Published: (2011)