✦ LIBER ✦

A descent method for submodular function minimization

✍ Scribed by Satoru Fujishige; Satoru Iwata

Publisher: Springer-Verlag
Year: 2002
Tongue: English
Weight: 57 KB
Volume: 92
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s101070100273

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Fully Combinatorial Algorithm for Subm

A Fully Combinatorial Algorithm for Submodular Function Minimization

✍ Satoru Iwata 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 115 KB

This paper presents a strongly polynomial algorithm for submodular function minimization using only additions, subtractions, comparisons, and oracle calls for function values.

Generalized descent method for minimizat

Generalized descent method for minimization of functionals

✍ R. F. Khabibullin 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 431 KB

A faster strongly polynomial time algori

A faster strongly polynomial time algorithm for submodular function minimization

✍ James B. Orlin 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 212 KB

Structures of subpartitions related to a

Structures of subpartitions related to a submodular function minimization

✍ Takeshi Naitoh; Akira Nakayama 📂 Article 📅 1997 🏛 Japan Society for Industrial and Applied Mathemati 🌐 English ⚖ 927 KB

Descent methods for quasidifferentiable

Descent methods for quasidifferentiable minimization

✍ Krzysztof C. Kiwiel 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 930 KB

A coordinate gradient descent method for

A coordinate gradient descent method for nonsmooth separable minimization

✍ Paul Tseng; Sangwoon Yun 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 425 KB

We consider the problem of minimizing the sum of a smooth function and a separable convex function. This problem includes as special cases bound-constrained optimization and smooth optimization with 1 -regularization. We propose a (block) coordinate gradient descent method for solving this class of