✦ LIBER ✦

An algorithm for the minimization of convex, nondifferentiable functionals in Hilbert space

✍ Scribed by E. A. Sideri

Publisher: Springer
Year: 1981
Tongue: English
Weight: 413 KB
Volume: 35
Category: Article
ISSN: 0022-3239
DOI: 10.1007/bf00934700

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An outer approximation method for minimi

An outer approximation method for minimizing the product of several convex functions on a convex set

✍ Takahito Kuno; Yasutoshi Yajima; Hiroshi Konno 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 458 KB

An algorithm for determining the minimal

An algorithm for determining the minimal convex subset that contains all the integer points of a convex polyhedral set

✍ J.B. Hughes 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 467 KB

Minimal distance upper bounds for the pe

Minimal distance upper bounds for the perturbation of least squares problems in Hilbert spaces

✍ J. Ding 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 275 KB

In this paper, we present an optimal perturbation result on the least squares solutions to the operator equation Tx = y under the most general condition. (~) 2002 Elsevier Science Ltd. All rights reserved.

Duality for the sum of convex functions

Duality for the sum of convex functions in general normed spaces

✍ D. Azé 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 306 KB

On the accelerating property of an algor

On the accelerating property of an algorithm for function minimization without calculating derivatives

✍ P. L. Toint; F. M. Callier 📂 Article 📅 1977 🏛 Springer 🌐 English ⚖ 751 KB

On the accelerating property of an algor

On the accelerating property of an algorithm for function minimization without calculating derivatives

✍ F. M. Calliee; P. L. Toint 📂 Article 📅 1978 🏛 Springer 🌐 English ⚖ 149 KB