Hadamard and Strong Well-Posedness for Convex Programs

Abstract

It is proved that Hadamard well-posedness of a constrained convex optimization problem with respect to Attouch--Wets convergence on the data implies, in general, its strong (and hence Tykhonov) well-posedness. An example is given showing that the opposite implication fails without assuming an appropriate constrained qualification condition.