Article ID: | iaor20128239 |
Volume: | 155 |
Issue: | 3 |
Start Page Number: | 762 |
End Page Number: | 784 |
Publication Date: | Dec 2012 |
Journal: | Journal of Optimization Theory and Applications |
Authors: | Mordukhovich B, Nghia T |
Keywords: | programming: convex |
The paper develops a new approach to the study of metric regularity and related well‐posedness properties of convex set‐valued mappings between general Banach spaces by reducing them to unconstrained minimization problems with objectives given as the difference of convex (DC) functions. In this way, we establish new formulas for calculating the exact regularity bound of closed and convex multifunctions and apply them to deriving explicit conditions ensuring well‐posedness of infinite convex systems described by inequality and equality constraints.