✦ LIBER ✦

Dual coordinate ascent methods for non-strictly convex minimization

✍ Scribed by Paul Tseng

Publisher: Springer-Verlag
Year: 1993
Tongue: English
Weight: 958 KB
Volume: 59
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01581245

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Subgradient relaxation method for minimi

Subgradient relaxation method for minimization of strictly convex functions

✍ I. Ya. Zabotin; M. I. Kreinin 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 319 KB

A globally convergent BFGS method with n

A globally convergent BFGS method with nonmonotone line search for non-convex minimization

✍ Yunhai Xiao; Huijuan Sun; Zhiguo Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 626 KB

## a c t In this paper, we propose a modified BFGS (Broyden-Fletcher-Goldfarb-Shanno) method with nonmonotone line search for unconstrained optimization. Under some mild conditions, we show that the method is globally convergent without a convexity assumption on the objective function. We also repo

Global convergence of a modified BFGS-ty

Global convergence of a modified BFGS-type method for unconstrained non-convex minimization

✍ Qiang Guo; Jian-Guo Liu 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 191 KB