Generic Optimality Conditions for Semialgebraic Convex Programs
Lists
Only you see this
Abstract
We consider linear optimization over a nonempty convex semialgebraic feasible region F. Semidefinite programming is an example. If F is compact, then for almost every linear objective there is a un...
BibTeX
@article{bolte2011generic,
author = {Jérôme Bolte and Aris Daniilidis and Adrian S. Lewis},
title = {{Generic Optimality Conditions for Semialgebraic Convex Programs}},
journal = {Math. Oper. Res.},
year = {2011},
doi = {10.1287/moor.1110.0481},
}Loading related content...