Coderivative calculus and metric regularity for constraint and variational systems

Abstract This paper provides new developments in generalized differentiation theory of variational analysis with their applications to metric regularity of parameterized constraint and variational systems in finite-dimensional and infinite-dimensional spaces. Our approach to the study of metric regularity for these two major classes of parametric systems is based on appropriate coderivative constructions for set-valued mappings and on extended calculus rules supporting their computation and estimation. The main attention is paid in this paper to the so-called reversed mixed coderivative, which is of crucial importance for efficient pointwise characterizations of metric regularity in the general framework of set-valued mappings between infinite-dimensional spaces. We develop new calculus results for the latter coderivative that allow us to compute it for large classes of parametric constraint and variational systems. On this basis we derive verifiable sufficient conditions, necessary conditions as well as complete characterizations for metric regularity of such systems with computing the corresponding exact bounds of metric regularity constants/moduli. This approach allows us to reveal general settings in which metric regularity fails for major classes of parametric variational systems. Furthermore, the developed coderivative calculus leads us also to establishing new formulas for computing the radius of metric regularity for constraint and variational systems, which characterize the maximal region of preserving metric regularity under linear (and other types of) perturbations and are closely related to conditioning aspects of optimization.

[1]  Javier Peña,et al.  A characterization of the distance to infeasibility under block-structured perturbations , 2003 .

[2]  Boris S. Mordukhovich Coderivative Analysis of Variational Systems , 2004, J. Glob. Optim..

[3]  Jiří V. Outrata,et al.  Mathematical Programs with Equilibrium Constraints: Theory and Numerical Methods , 2006 .

[4]  James Renegar,et al.  Incorporating Condition Measures into the Complexity Theory of Linear Programming , 1995, SIAM J. Optim..

[5]  S. M. Robinson Generalized equations and their solutions, Part I: Basic theory , 1979 .

[6]  B. Mordukhovich Complete characterization of openness, metric regularity, and Lipschitzian properties of multifunctions , 1993 .

[7]  B. Mordukhovich Variational Analysis and Generalized Differentiation II: Applications , 2006 .

[8]  J. Borwein,et al.  Techniques of variational analysis , 2005 .

[9]  A. Ioffe Metric regularity and subdifferential calculus , 2000 .

[10]  F. Facchinei,et al.  Finite-Dimensional Variational Inequalities and Complementarity Problems , 2003 .

[11]  Alexander D. Ioffe On robustness of the regularity property of maps , 2003 .

[12]  R. Rockafellar,et al.  The radius of metric regularity , 2002 .

[13]  R. Phelps Convex Functions, Monotone Operators and Differentiability , 1989 .

[14]  Boris S. Mordukhovich,et al.  On Second-Order Subdifferentials and Their Applications , 2001, SIAM J. Optim..

[15]  F. Javier Toledo-Moreo,et al.  Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems , 2005, Math. Program..