In this paper, we establish conditions ensuring Hölder and Lipschitz continuity of minimizers in convex programming. Lipschitz continuity is proved by establishing and applying a generalized version of the implicit function theorem.
|Original language||English (US)|
|Number of pages||9|
|Journal||Nonlinear Analysis, Theory, Methods and Applications|
|Publication status||Published - Feb 1 2012|
All Science Journal Classification (ASJC) codes
- Applied Mathematics