Towards large scale unconstrained optimization
A large scale unconstrained optimization problem can be formulated when the dimension n is large. The notion of 'large scale' is machine dependent and hence it could be difficult to state a priori when a problem is of large size. However, today an unconstrained problem with 400 or more var...
Saved in:
Main Author: | Abu Hassan, Malik |
---|---|
Format: | Inaugural Lecture |
Language: | English English |
Published: |
Universiti Putra Malaysia Press
2007
|
Online Access: | http://psasir.upm.edu.my/id/eprint/41627/1/0001.pdf http://psasir.upm.edu.my/id/eprint/41627/2/0001.pdf http://psasir.upm.edu.my/id/eprint/41627/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Scaled memoryless symmetric rank one method for large-scale unconstrained optimization
by: Leong, Wah June, et al.
Published: (2008) -
Scaled memoryless BFGS preconditioned steepest descent method for very large-scale unconstrained optimization
by: Leong, Wah June, et al.
Published: (2009) -
Memoryless modified symmetric rank-one method for large-scale unconstrained optimization
by: Modarres, Farzin, et al.
Published: (2009) -
Positive-definite memoryless symmetric rank one method for large-scale unconstrained optimization
by: Leong, Wah June, et al.
Published: (2011) -
A new two-step gradient-type method for large-scale unconstrained optimization
by: Farid, Mahboubeh, et al.
Published: (2010)