๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A symmetric rank-one method based on extra updating techniques for unconstrained optimization

โœ Scribed by Farzin Modarres; Malik Abu Hassan; Wah June Leong

Book ID
108078756
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
634 KB
Volume
62
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A new quasi-Newton pattern search method
A new quasi-Newton pattern search method based on symmetric rank-one update for unconstrained optimization
โœ Ting Wu; Linping Sun ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 268 KB

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

A nonmonotone conic trust region method
A nonmonotone conic trust region method based on line search for solving unconstrained optimization
โœ Shao-Jian Qu; Qing-Pu Zhang; Yue-Ting Yang ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 675 KB

In this paper, we present a nonmonotone conic trust region method based on line search technique for unconstrained optimization. The new algorithm can be regarded as a combination of nonmonotone technique, line search technique and conic trust region method. When a trial step is not accepted, the me