✦ LIBER ✦

On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems

✍ Scribed by Cartis, C.; Gould, N. I. M.; Toint, Ph. L.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The optimal step and regularization for

✍ V.V. Ermakov; N.N. Kalitkin 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 393 KB

Efficient dynamic programming implementa

✍ J. C. Dunn; D. P. Bertsekas 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 720 KB

Accelerating the cubic regularization of

✍ Yu. Nesterov 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 291 KB

On convergence of regularized modified N

✍ George, Santhosh (author) 📂 Article 📅 2010 🏛 Walter de Gruyter GmbH and Co. KG 🌐 English ⚖ 190 KB

On convergence of regularized modified N

✍ George, Santhosh (author) 📂 Article 📅 2010 🏛 Walter de Gruyter GmbH and Co. KG 🌐 English ⚖ 190 KB

On a modification of Newton's methods fo

✍ V.K. Isayev; V.V. Sonin 📂 Article 📅 1963 🏛 Elsevier Science ⚖ 275 KB