Envelope Functions: Unifications and Further Properties

Research output: Contribution to journalArticle

Bibtex

@article{621a87ae86a04620b09d982d7ccb858e,
title = "Envelope Functions: Unifications and Further Properties",
abstract = "Forward–backward and Douglas–Rachford splitting are methods for structured nonsmooth optimization. With the aim to use smooth optimization techniques for nonsmooth problems, the forward–backward and Douglas–Rachford envelopes where recently proposed. Under specific problem assumptions, these envelope functions have favorable smoothness and convexity properties and their stationary points coincide with the fixed-points of the underlying algorithm operators. This allows for solving such nonsmooth optimization problems by minimizing the corresponding smooth convex envelope function. In this paper, we present a general envelope function that unifies and generalizes existing ones. We provide properties of the general envelope function that sharpen corresponding known results for the special cases. We also present a new interpretation of the underlying methods as being majorization–minimization algorithms applied to their respective envelope functions.",
keywords = "Envelope functions, First-order methods, Large-scale optimization, Nonsmooth optimization, Smooth reformulations",
author = "Pontus Giselsson and Mattias F{\"a}lt",
year = "2018",
doi = "10.1007/s10957-018-1328-z",
language = "English",
volume = "178",
pages = "673--698",
journal = "Journal of Optimization Theory and Applications",
issn = "0022-3239",
publisher = "Springer New York",
number = "3",

}