✦ LIBER ✦

Convergence of the constrained gradient method for a class of nonconvex functions

✍ Scribed by Z. R. Gabidullina

Publisher: Springer US
Year: 1990
Tongue: English
Weight: 470 KB
Volume: 50
Category: Article
ISSN: 1573-8795
DOI: 10.1007/bf01097200

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Global Convergence of a Modified Gradien

Global Convergence of a Modified Gradient Projection Method for Convex Constrained Problems

✍ Qing-ying Sun; Chang-yu Wang; Zhen-jun Shi 📂 Article 📅 2006 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 229 KB

A method of linearizations for linearly

A method of linearizations for linearly constrained nonconvex nonsmooth minimization

✍ Krzysztof C. Kiwiel 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 562 KB

A variant of the constrained gradient me

A variant of the constrained gradient method

✍ I. Ya. Zabotin; E. V. Lyamin 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 463 KB

A homotopy method for getting a local mi

A homotopy method for getting a local minimum of constrained nonconvex programming

✍ Wenjuan Sun; Qinghuai Liu; Cailing Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 429 KB

Convergence of the gradient projection m

Convergence of the gradient projection method

✍ E. A. Nurminskii 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 244 KB

Global convergence of the nonmonotone MB

Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization

✍ Weijun Zhou; Li Zhang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 404 KB

In this paper, we propose a new nonmonotone Armijo type line search and prove that the MBFGS method proposed by Li and Fukushima with this new line search converges globally for nonconvex minimization. Some numerical experiments show that this nonmonotone MBFGS method is efficient for the given test