 |
|||||||||
| Volume 4, Number 3, September 2008, pp. 411-422 | |||||||||
| M.J. Cánovas, A. Hantoute, M.A. López and J. Parra | |||||||||
| Key words: | |||||||||
| Lipschitz modulus, convex programming, metric regularity | |||||||||
| Mathematices Subject Classification: 49J53, 90C25, 90C31, 52A41 | |||||||||
|
|||||||||
| Volume 4, Number 3, September 2008, pp. 411-422 | |||||||||
| M.J. Cánovas, A. Hantoute, M.A. López and J. Parra | |||||||||
| Key words: | |||||||||
| Lipschitz modulus, convex programming, metric regularity | |||||||||
| Mathematices Subject Classification: 49J53, 90C25, 90C31, 52A41 | |||||||||
|
||||||||||||||||||||||||||||||||||||||||
| Abstract: | |||
| In this paper we relate the Lipschitz modulus of the optimal set mapping of a canonically perturbed convex optimization problem in lRn with the Lipschitz moduli of suitable subproblems with exactly n constraints. This approach allows us to simplify other expressions for the modulus given in [8] in terms of d.c. functions involving the problem's data. | |||
| Lipschitz modulus of the optimal set mapping in convex optimization via minimal subproblems | ||