๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A fast dual proximal gradient algorithm for convex minimization and applications

โœ Scribed by Beck, Amir; Teboulle, Marc

Book ID
121506186
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
377 KB
Volume
42
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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