✦ LIBER ✦

Closed mappings in unconstrained minimization problems for convex functions

✍ Scribed by S. V. Rzhevskii

Publisher: Springer US
Year: 1980
Tongue: English
Weight: 704 KB
Volume: 16
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01078508

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An unconstrained optimization technique

An unconstrained optimization technique for large-scale linearly constrained convex minimization problems

✍ C. Kanzow 📂 Article 📅 1994 🏛 Springer Vienna 🌐 English ⚖ 773 KB

Convex minimization problems for integra

Convex minimization problems for integral functionals with constraints of operator inclusion type

✍ V. V. Beresnev 📂 Article 📅 1980 🏛 Springer US 🌐 English ⚖ 426 KB

Exact penalty functions in proximal bund

Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization

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

Minimizing the makespan in open-shop sch

Minimizing the makespan in open-shop scheduling problems with a convex resource consumption function

✍ Dvir Shabtay; Moshe Kaspi 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB

Fast scaling algorithms for M-convex fun

Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem

✍ Akiyoshi Shioura 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 256 KB

M-convex functions, introduced by Murota (Adv. Math. 124 (1996) 272; Math. Prog. 83 (1998) 313), enjoy various desirable properties as "discrete convex functions." In this paper, we propose two new polynomial-time scaling algorithms for the minimization of an M-convex function. Both algorithms apply

An algorithm for the minimization of con

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

✍ E. A. Sideri 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 413 KB