Generic nondegeneracy in convex optimization
Optimization and Control
2011-08-23 v1
Abstract
We show that minimizers of convex functions subject to almost all linear perturbations are nondegenerate. An analogous result holds more generally, for lower-C^2 functions.
Keywords
Cite
@article{arxiv.1005.1082,
title = {Generic nondegeneracy in convex optimization},
author = {Dmitriy Drusvyatskiy and Adrian S. Lewis},
journal= {arXiv preprint arXiv:1005.1082},
year = {2011}
}
Comments
13 pages