A quasi-Newton bundle method based on approximate subgradients
β Scribed by Shen Jie; Pang Li-Ping
- Publisher
- Springer-Verlag
- Year
- 2007
- Tongue
- English
- Weight
- 138 KB
- Volume
- 23
- Category
- Article
- ISSN
- 1598-5865
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper proposes a new robust and quickly convergent pattern search method based on an implementation of OCSSR1 (Optimal Conditioning Based Self-Scaling Symmetric Rank-One) algorithm [M.R. Osborne, L.P. Sun, A new approach to symmetric rank-one updating, IMA Journal of Numerical Analysis 19 (1999
This paper presents a parallel algorithm and its systolic array architecture for the BFGS (Broyden, Fletcher, Goldfarb, and Shanno) quasi-Newton method of minimizing an n-vector function. The calculation of search direction vectors and the update of approximation to Hessian matrices by the BFGS upda