The Many Faces of Degeneracy in Conic Optimization
Foundations and Trends® in Optimization · 2017
DOI: 10.1561/2400000011 ↗Kurz gefasst
Fachartikel in der Zeitschrift Foundations and Trends® in Optimization, 2017. Verfasst von Dmitriy Drusvyatskiy und 1 weiteren Autor:innen. Die Arbeit wurde bisher 51-mal zitiert (Crossref) und nennt 153 Literaturangaben.
Abstract (Originalsprache)
Slater’s condition – existence of a “strictly feasible solution” – is a common assumption in conic optimization. Without strict feasibility, first-order optimality conditions may be meaningless, the dual problem may yield little information about the primal, and small changes in the data may render the problem infeasible. Hence, failure of strict feasibility can negatively impact off-the-shelf numerical methods, such as primal-dual interior point methods, in particular. New optimization modeling techniques and convex relaxations for hard nonconvex problems have shown that the loss of strict feasibility is a more pronounced phenomenon than has previously been realized. In this text, we describe various reasons for the loss of strict feasibility, whether due to poor modeling choices or (more interestingly) rich underlying structure, and discuss ways to cope with it and, in many pronounced cases, how to use it as an advantage. In large part, we emphasize the facial reduction preprocessing technique due to its mathematical elegance, geometric transparency, and computational potential.
Zitieren
APA
Drusvyatskiy, D., & Wolkowicz, H. (2017). The Many Faces of Degeneracy in Conic Optimization. Foundations and Trends® in Optimization. https://doi.org/10.1561/2400000011
Vancouver
Drusvyatskiy D, Wolkowicz H. The Many Faces of Degeneracy in Conic Optimization. Foundations and Trends® in Optimization. 2017. doi:10.1561/2400000011
BibTeX
@article{Drusvyatskiy2017,
author = {Drusvyatskiy, Dmitriy and Wolkowicz, Henry},
title = {The Many Faces of Degeneracy in Conic Optimization},
journal = {Foundations and Trends® in Optimization},
year = {2017},
doi = {10.1561/2400000011}
}
EUVIMED