Lipschitz modulus of the argmin mapping in convex quadratic optimization

M. J. Cánovas Cánovas, M. Fukushima, J. Parra López

This work was initially motivated by the computation of the Lipschitz modulus of the metric projection on polyhedral convex sets in the Euclidean space when both the reference point and the polyhedron where it is projected are subject to perturbations. The talk tackles the more general problem of computing the Lipschitz modulus of the argmin mapping in the framework of canonically perturbed convex quadratic problems. We point out the fact that a point-based formula (depending only on the nominal data) for such a modulus is provided. In this way, the paper extends to the current quadratic setting some results previously developed in linear programming. As an application, we provide a point-based formula for the Lipschitz modulus of the metric projection on a polyhedral convex set.

Palabras clave: Aubin property, Lipschitz modulus, quadratic programming, linear programming, argmin mapping

GT Optimización Continua I
2 de septiembre de 2026  12:40
Aula 30

R. Correa Fontecilla, R. Correa, A. Hantoute

J. E. Martínez Legaz, E. Naraghirad, M. Tamadoni Jahromi

J. Rückmann