𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On perturbed steepest descent methods with inexact line search for bilevel convex optimization

✍ Scribed by Neto, Elias Salomão Helou; De Pierro, Álvaro Rodolfo

Book ID
120969183
Publisher
Taylor and Francis Group
Year
2011
Tongue
English
Weight
286 KB
Volume
60
Category
Article
ISSN
0233-1934

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The spherical quadratic steepest descent
The spherical quadratic steepest descent (SQSD) method for unconstrained minimization with no explicit line searches
✍ J.A. Snyman; A.M. Hay 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 481 KB

A very simple gradient only algorithm for unconstrained minimization is proposed that, in terms of storage requirement and computational efficiency, may be considered as an alternative to the conjugate gradient line search methods for large problems. The method effectively applies the steepest desce