Article contents
Lipschitz modulus in convex semi-infinite optimization via d.c.functions
Published online by Cambridge University Press: 19 July 2008
Abstract
We are concerned with the Lipschitz modulus of the optimal set mapping associated with canonically perturbed convex semi-infinite optimization problems. Specifically, the paper provides a lower and an upper bound for this modulus, both of them given exclusively in terms of the problem's data. Moreover, the upper bound is shown to be the exact modulus when the number of constraints is finite. In the particular case of linear problems the upper bound (or exact modulus) adopts a notably simplified expression. Our approach is based on variational techniques applied to certain difference of convex functions related to the model. Some results of [M.J. Cánovas et al., J. Optim. Theory Appl. (2008) Online First] (which go back to [M.J. Cánovas, J. Global Optim.41 (2008) 1–13] and [Ioffe, Math. Surveys55 (2000) 501–558; Control Cybern.32 (2003) 543–554]) constitute the starting point of the present work.
- Type
- Research Article
- Information
- ESAIM: Control, Optimisation and Calculus of Variations , Volume 15 , Issue 4 , October 2009 , pp. 763 - 781
- Copyright
- © EDP Sciences, SMAI, 2008
References
- 10
- Cited by