Constrained convex optimization problems-well-posedness and stability*
A. S. Konsulova, J. P. Revalski · Numerical Functional Analysis and Optimization · 1994
We study convex minimization problems in a Banach space with inequality constraints. Different notions of well-posedness (i.e. uniqueness of the solution and its stability) of such kind of problems are introduced and investigated, including relations between them. The notions and results are generalized for the case when the requirement for uniqueness of the solution is dropped.