A tolerant derivative-free nonmonotone line-search technique is proposed and analyzed. Several consecutive increases in the objective function and also nondescent directions are admitted for unconstrained minimization. To exemplify the power of this new line search we describe a direct search algori
β¦ LIBER β¦
A derivative-free algorithm for unconstrained optimization
β Scribed by Peng Yehui; Liu Zhenhai
- Book ID
- 107500727
- Publisher
- SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
- Year
- 2005
- Tongue
- English
- Weight
- 314 KB
- Volume
- 20
- Category
- Article
- ISSN
- 1005-1031
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A derivative-free nonmonotone line-searc
β
M.A. Diniz-Ehrhardt; J.M. MartΓnez; M. Raydan
π
Article
π
2008
π
Elsevier Science
π
English
β 210 KB
Unconstrained derivative-free optimizati
β
ΓrpΓ‘d BΕ±rmen; Tadej Tuma
π
Article
π
2009
π
Elsevier Science
π
English
β 912 KB
We present an algorithmic framework for unconstrained derivative-free optimization based on dividing the search space in regions (partitions). Every partition is assigned a representative point. The representative points form a grid. A piecewiseconstant approximation to the function subject to optim
A decomposition algorithm for unconstrai
β
G. Liuzzi; A. Risi
π
Article
π
2010
π
Springer-Verlag
π
English
β 301 KB
A Derivative-Free Algorithm for Bound Co
β
Stefano Lucidi; Marco Sciandrone
π
Article
π
2002
π
Springer US
π
English
β 136 KB
A new arc algorithm for unconstrained op
β
Israel Zang
π
Article
π
1978
π
Springer-Verlag
π
English
β 749 KB
A parallel quasi-Newton algorithm for un
β
Z. Chen; P. Fei; H. Zheng
π
Article
π
1995
π
Springer Vienna
π
English
β 363 KB