Perturbation Theory of Polyhedral Seminorms Under Linear Constraints
Authors
Published Date
Publisher
Abstract
A recent paper by Klatte and Kummer provides a new characterization for the regularity of the $\argmin$ set of an optimization problem with respect to perturbations. In this thesis we prove that this characterization applies to a broad class of widely used minimization problems. In particular, this work applies to both $\ell_1$ and (anisotropic) discrete total variation minimization problems under linear constraints.
Keywords
Description
University of Minnesota Ph.D. dissertation. 2019. Major: Mathematics. Advisor: Gilad Lerman. 1 computer file (PDF); 54 pages.
Related to
item.page.replaces
License
Collections
Series/Report Number
Funding Information
item.page.isbn
DOI identifier
Previously Published Citation
Other identifiers
Suggested Citation
Gutierrez, Alexander. (2020). Perturbation Theory of Polyhedral Seminorms Under Linear Constraints. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/216884.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.