Generic optimality conditions for semialgebraic convex programs
Year of publication: |
2011
|
---|---|
Authors: | Bolte, Jérôme ; Daniilidis, Aris ; Lewis, Adrian S. |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 36.2011, 1, p. 55-70
|
Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Ivanov, Dmitry, (2015)
-
An improved ant algorithm for multi-mode resource constrained project scheduling problem
Wuliang, Peng, (2014)
-
Computing booking limits under a non-parametric demand model : a mathematical programming approach
Hosseinalifam, Morad, (2016)
- More ...
-
Generic Optimality Conditions for Semialgebraic Convex Programs
Bolte, Jérôme, (2011)
-
Cut-generating functions and S-free sets
Conforti, Michele, (2015)
-
Clarke subgradients for directionally Lipschitzian stratifiable functions
Drusvyatskiy, Dmitriy, (2015)
- More ...