✦ LIBER ✦

An acceleration of gradient descent algorithm with backtracking for unconstrained optimization

✍ Scribed by Neculai Andrei

Publisher: Springer US
Year: 2006
Tongue: English
Weight: 245 KB
Volume: 42
Category: Article
ISSN: 1017-1398
DOI: 10.1007/s11075-006-9023-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Accelerated hybrid conjugate gradient al

Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization

✍ Neculai Andrei 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 545 KB

Multicriterion optimization of composite

Multicriterion optimization of composite laminates for maximum failure margins with an interactive descent algorithm

✍ P. Kere; J. Koski 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 279 KB

Acceleration of the leastpth algorithm f

Acceleration of the leastpth algorithm for minimax optimization with engineering applications

✍ Christakis Charalambous 📂 Article 📅 1979 🏛 Springer-Verlag 🌐 English ⚖ 889 KB

Global Convergence of a Nonmonotone Trus

Global Convergence of a Nonmonotone Trust Region Algorithm with Memory for Unconstrained Optimization

✍ Zhensheng Yu; Anqi Wang 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 247 KB

A supermemory gradient projection algori

A supermemory gradient projection algorithm for optimization problem with nonlinear constraints

✍ Ziyou Gao; Guoping He 📂 Article 📅 1992 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 429 KB