𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new Liu–Storey type nonlinear conjugate gradient method for unconstrained optimization problems

✍ Scribed by Li Zhang

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
819 KB
Volume
225
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New spectral PRP conjugate gradient meth
New spectral PRP conjugate gradient method for unconstrained optimization
✍ Zhong Wan; ZhanLu Yang; YaLin Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 230 KB

In this paper, a new spectral PRP conjugate gradient algorithm has been developed for solving unconstrained optimization problems, where the search direction was a kind of combination of the gradient and the obtained direction, and the steplength was obtained by the Wolfe-type inexact line search. I

A conjugate gradient method with descent
A conjugate gradient method with descent direction for unconstrained optimization
✍ Gonglin Yuan; Xiwen Lu; Zengxin Wei 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 726 KB

A modified conjugate gradient method is presented for solving unconstrained optimization problems, which possesses the following properties: (i) The sufficient descent property is satisfied without any line search; (ii) The search direction will be in a trust region automatically; (iii) The Zoutendi

A gradient-only line search method for t
A gradient-only line search method for the conjugate gradient method applied to constrained optimization problems with severe noise in the objective function
✍ J. A. Snyman 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

A new implementation of the conjugate gradient method is presented that economically overcomes the problem of severe numerical noise superimposed on an otherwise smooth underlying objective function of a constrained optimization problem. This is done by the use of a novel gradient-only line search t