A restarting approach on symmetric rank one update for unconstrained optimization
Two basic disadvantages of the symmetric rank one (SR1) update are that the SR1 update may not preserve positive definiteness when starting with a positive definite approximation and the SR1 update can be undefined. A simple remedy to these problems is to restart the update with the initial approxim...
Saved in:
Main Authors: | Leong, Wah June, Abu Hassan, Malik |
---|---|
Format: | Article |
Published: |
Springer
2009
|
Online Access: | http://psasir.upm.edu.my/id/eprint/12810/ http://link.springer.com/article/10.1007%2Fs10589-007-9115-z |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Scaling symmetric rank one update for unconstrained optimization
by: Abu Hassan, Malik, et al.
Published: (2002) -
Scaling symmetric rank one update for unconstrained optimization
by: Abu Hassan, Malik, et al.
Published: (2003) -
Multi-steps symmetric rank-one update for unconstrained optimization
by: Modarres, Farzin, et al.
Published: (2009) -
A symmetric rank-one method based on extra updating techniques for unconstrained optimization.
by: Modarres, Farzin, et al.
Published: (2011) -
Convergence of a positive definite symmetric rank one method with restart
by: Leong, Wah June, et al.
Published: (2009)