✦ LIBER ✦

A convergent dynamic method for large minimization problems

✍ Scribed by J.A. Snyman

Book ID: 108020334
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 499 KB
Volume: 17
Category: Article
ISSN: 0898-1221
DOI: 10.1016/0898-1221(89)90020-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Space-decomposition minimization method

Space-decomposition minimization method for large-scale minimization problems

✍ Chin-Sung Liu; Ching-Hung Tseng 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 822 KB

This paper introduces a set of new algorithms, called the Space-Decomposition Minimization (SDM) algorithms, that decomposes the minimization problem into subproblems. If the decomposed-space subproblems are not coupled to each other, they can be solved independently with any convergent algorithm; o

A globally convergent Newton method for

A globally convergent Newton method for convex SC1minimization problems

✍ J. S. Pang; L. Qi 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 696 KB

A dynamic minimization method

✍ S.S. Kozlov; T.V. Sazonova 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 179 KB

Scalar Correction Method for Solving Lar

Scalar Correction Method for Solving Large Scale Unconstrained Minimization Problems

✍ Marko Miladinović; Predrag Stanimirović; Sladjana Miljković 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 620 KB

Convergence estimates for iterative mini

Convergence estimates for iterative minimization methods

✍ V.G. Karmanov 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 743 KB

Rate-of-convergence bound of regularizat

Rate-of-convergence bound of regularization methods for unstable minimization problems

✍ F. P. Vasil'ev 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 393 KB