ON REGULARITY CONDITIONS FOR COMPLEMENTARITY PROBLEMS

Similar documents
A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems

A SIMPLY CONSTRAINED OPTIMIZATION REFORMULATION OF KKT SYSTEMS ARISING FROM VARIATIONAL INEQUALITIES

WHEN ARE THE (UN)CONSTRAINED STATIONARY POINTS OF THE IMPLICIT LAGRANGIAN GLOBAL SOLUTIONS?

20 J.-S. CHEN, C.-H. KO AND X.-R. WU. : R 2 R is given by. Recently, the generalized Fischer-Burmeister function ϕ p : R2 R, which includes

Rejoinder on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it

Pacific Journal of Optimization (Vol. 2, No. 3, September 2006) ABSTRACT

Some new facts about sequential quadratic programming methods employing second derivatives

ON A CLASS OF NONSMOOTH COMPOSITE FUNCTIONS

Lecture 19 Algorithms for VIs KKT Conditions-based Ideas. November 16, 2008

CHARACTERIZATIONS OF LIPSCHITZIAN STABILITY

Advanced Continuous Optimization

1. Introduction. We consider the mathematical programming problem

Stationary Points of Bound Constrained Minimization Reformulations of Complementarity Problems1,2

School of Mathematics, the University of New South Wales, Sydney 2052, Australia

A PENALIZED FISCHER-BURMEISTER NCP-FUNCTION. September 1997 (revised May 1998 and March 1999)

system of equations. In particular, we give a complete characterization of the Q-superlinear

1. Introduction The nonlinear complementarity problem (NCP) is to nd a point x 2 IR n such that hx; F (x)i = ; x 2 IR n + ; F (x) 2 IRn + ; where F is

Critical solutions of nonlinear equations: local attraction for Newton-type methods

Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption

Some Properties of the Augmented Lagrangian in Cone Constrained Optimization

A CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE

Technische Universität Dresden Herausgeber: Der Rektor

Critical solutions of nonlinear equations: Stability issues

A Continuation Method for the Solution of Monotone Variational Inequality Problems

Newton-type Methods for Solving the Nonsmooth Equations with Finitely Many Maximum Functions

A Novel Inexact Smoothing Method for Second-Order Cone Complementarity Problems

The effect of calmness on the solution set of systems of nonlinear equations

Lecture 8 Plus properties, merit functions and gap functions. September 28, 2008

A FRITZ JOHN APPROACH TO FIRST ORDER OPTIMALITY CONDITIONS FOR MATHEMATICAL PROGRAMS WITH EQUILIBRIUM CONSTRAINTS

UNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems

c 2002 Society for Industrial and Applied Mathematics

Uniqueness of Generalized Equilibrium for Box Constrained Problems and Applications

Using exact penalties to derive a new equation reformulation of KKT systems associated to variational inequalities

Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets

A Regularization Newton Method for Solving Nonlinear Complementarity Problems

Newton-Type Methods: A Broader View

Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints

ON GAP FUNCTIONS OF VARIATIONAL INEQUALITY IN A BANACH SPACE. Sangho Kum and Gue Myung Lee. 1. Introduction

A Regularized Directional Derivative-Based Newton Method for Inverse Singular Value Problems

A class of Smoothing Method for Linear Second-Order Cone Programming

On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-newton SQP methods to critical multipliers

Finite Convergence for Feasible Solution Sequence of Variational Inequality Problems

Semismooth Support Vector Machines

SOME STABILITY RESULTS FOR THE SEMI-AFFINE VARIATIONAL INEQUALITY PROBLEM. 1. Introduction

SOLUTION OF NONLINEAR COMPLEMENTARITY PROBLEMS

Structural and Multidisciplinary Optimization. P. Duysinx and P. Tossings

Affine scaling interior Levenberg-Marquardt method for KKT systems. C S:Levenberg-Marquardt{)KKTXÚ

An Accelerated Newton Method for Equations with Semismooth Jacobians and Nonlinear Complementarity Problems

Solving generalized semi-infinite programs by reduction to simpler problems.

A globally convergent Levenberg Marquardt method for equality-constrained optimization

The Relation Between Pseudonormality and Quasiregularity in Constrained Optimization 1

Inexact Josephy Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization

Error bounds for symmetric cone complementarity problems

Journal of Inequalities in Pure and Applied Mathematics

Constrained Optimization

On Second-order Properties of the Moreau-Yosida Regularization for Constrained Nonsmooth Convex Programs

Solving a Class of Generalized Nash Equilibrium Problems

1. Introduction. Consider the following parameterized optimization problem:

Constraint qualifications for nonlinear programming

An Accelerated Newton Method for Equations with Semismooth Jacobians and Nonlinear Complementarity Problems: Extended Version

ON LICQ AND THE UNIQUENESS OF LAGRANGE MULTIPLIERS

A QP-FREE CONSTRAINED NEWTON-TYPE METHOD FOR VARIATIONAL INEQUALITY PROBLEMS. Christian Kanzow 1 and Hou-Duo Qi 2

Smoothed Fischer-Burmeister Equation Methods for the. Houyuan Jiang. CSIRO Mathematical and Information Sciences

Numerical Optimization

Bulletin of the. Iranian Mathematical Society

Interval solutions for interval algebraic equations

A STABILIZED SQP METHOD: SUPERLINEAR CONVERGENCE

Extreme Abridgment of Boyd and Vandenberghe s Convex Optimization

AN ABADIE-TYPE CONSTRAINT QUALIFICATION FOR MATHEMATICAL PROGRAMS WITH EQUILIBRIUM CONSTRAINTS. Michael L. Flegel and Christian Kanzow

Technische Universität Dresden Institut für Numerische Mathematik

CONVERGENCE OF INEXACT NEWTON METHODS FOR GENERALIZED EQUATIONS 1

DUALIZATION OF SUBGRADIENT CONDITIONS FOR OPTIMALITY

Lecture 3. Optimization Problems and Iterative Algorithms

Expected Residual Minimization Method for Stochastic Linear Complementarity Problems 1

Merit functions and error bounds for generalized variational inequalities

TMA 4180 Optimeringsteori KARUSH-KUHN-TUCKER THEOREM

On the Local Quadratic Convergence of the Primal-Dual Augmented Lagrangian Method

SEMISMOOTH LEAST SQUARES METHODS FOR COMPLEMENTARITY PROBLEMS

In view of (31), the second of these is equal to the identity I on E m, while this, in view of (30), implies that the first can be written

c 2012 Society for Industrial and Applied Mathematics

MODIFYING SQP FOR DEGENERATE PROBLEMS

Lagrange Duality. Daniel P. Palomar. Hong Kong University of Science and Technology (HKUST)

A GLOBALLY CONVERGENT STABILIZED SQP METHOD: SUPERLINEAR CONVERGENCE

CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS. W. Erwin Diewert January 31, 2008.

THE restructuring of the power industry has lead to

FIRST- AND SECOND-ORDER OPTIMALITY CONDITIONS FOR MATHEMATICAL PROGRAMS WITH VANISHING CONSTRAINTS 1. Tim Hoheisel and Christian Kanzow

University of California, Davis Department of Agricultural and Resource Economics ARE 252 Lecture Notes 2 Quirino Paris

Introduction to Optimization Techniques. Nonlinear Optimization in Function Spaces

More on Lagrange multipliers

AN EQUIVALENCY CONDITION OF NONSINGULARITY IN NONLINEAR SEMIDEFINITE PROGRAMMING

A sensitivity result for quadratic semidefinite programs with an application to a sequential quadratic semidefinite programming algorithm

Affine covariant Semi-smooth Newton in function space

Lecture 2. Solvers for the time-discretized problems.

Department of Social Systems and Management. Discussion Paper Series

1. Introduction. We consider mathematical programs with equilibrium constraints in the form of complementarity constraints:

RESEARCH ARTICLE. A strategy of finding an initial active set for inequality constrained quadratic programming problems

Lecture 1. 1 Conic programming. MA 796S: Convex Optimization and Interior Point Methods October 8, Consider the conic program. min.

Applying a type of SOC-functions to solve a system of equalities and inequalities under the order induced by second-order cone

5 Handling Constraints

Centre d Economie de la Sorbonne UMR 8174

Transcription:

ON REGULARITY CONDITIONS FOR COMPLEMENTARITY PROBLEMS A. F. Izmailov and A. S. Kurennoy December 011 ABSTRACT In the context of mixed complementarity problems various concepts of solution regularity are known each of them playing a certain role in related theoretical and algorithmic developments. In this note we provide the complete picture of relations between the most important regularity conditions for mixed complementarity problems. A special attention is paid to the particular cases of a nonlinear complementarity problem and of a Karush Kuhn Tucker system. Key words: mixed complementarity problem nonlinear complementarity problem KKT system natural residual function Fischer Burmeister function BD-regularity CD-regularity strong regularity semistability b-regularity quasi-regularity. AMS subject classifications. 90C33. This research is supported by the Russian Foundation for Basic Research Grant 10-01-0051. Moscow State University MSU Uchebniy Korpus VMK Faculty OR Department Leninskiye Gory 119991 Moscow Russia. Email: izmaf@ccas.ru Moscow State University MSU Uchebniy Korpus VMK Faculty OR Department Leninskiye Gory 119991 Moscow Russia. Email: alex-kurennoy@yandex.ru

1 Introduction We consider the mixed complementarity problem (MCP) which is the variational inequality on the generalized box: where Φ: IR s IR s is a given mapping and z [l u] Φ(z) y z 0 y [l u] (1.1) [l u] = {z IR s l i z i u i i = 1... s} with some l i IR { } u i IR {+ } l i < u i i = 1... s. Equivalently MCP can be stated as follows: 0 if z i = l i z [l u] Φ i (z) = 0 if z i (l i u i ) i = 1... s. (1.) 0 if z i = u i The MCP format covers many important applications and problem settings [1 11 9] and perhaps the most well-known among them are the (usual) nonlinear complementarity problem (NCP) z 0 Φ(z) 0 z Φ(z) = 0 (1.3) corresponding to the case when l i = 0 u i = + i = 1... s and the Karush Kuhn Tucker (KKT) system F (x) + (h (x)) T λ + (g (x)) T µ = 0 h(x) = 0 (1.4) µ 0 g(x) 0 µ g(x) = 0 in unknown (x λ µ) IR n IR l IR m where F : IR n IR n h: IR n IR l and g : IR n IR m are given mappings and the last two are assumed differentiable. Indeed (1.4) can be written in the form of (1.) by setting s = n + l + m with G: IR n IR l IR m IR n defined by and taking Φ(z) = (G(x λ µ) h(x) g(x)) z = (x λ µ) G(x λ µ) = F (x) + (h (x)) T λ + (g (x)) T µ l i = i = 1... n + l l i = 0 i = n + l + 1... n + l + m u i = + i = 1... n + l + m. MCP (1.1) with Φ(z) = ϕ (z) z IR s gives the primal first-order optimality condition for the optimization problem minimize ϕ(z) subject to z [l u] 1

where ϕ : IR s IR is a given smooth objective function. On the other hand KKT system (1.4) with F (x) = f (x) x IR n characterizes stationary points and the associated Lagrange multipliers of the mathematical programming problem minimize f(x) subject to h(x) = 0 g(x) 0 where f : IR n IR is a given smooth objective function. Another well known fact (see e.g. [1 10]) is that MCP can be equivalently reformulated as a system of nonlinear equations employing a complementarity function that is a function ψ : IR IR satisfying Assuming the additional properties ψ(a b) = 0 a 0 b 0 ab = 0. ψ(a b) < 0 a > 0 b < 0 ψ(a b) > 0 a > 0 b > 0 (1.5) from the equivalent formulation (1.) of MCP (1.1) it can be seen that solutions of this problem coincide with solutions of the equation Ψ(z) = 0 (1.6) where Ψ: IR s IR s is given by Φ i (z) if i I Φ ψ(z i l i Φ i (z)) if i I l Ψ i (z) = ψ(u i z i Φ i (z)) if i I u ψ(z i l i ψ(u i z i Φ i (z))) if i I lu (1.7) with I Φ = {i = 1... s l i = u i = + } I l = {i = 1... s l i > u i = + } I u = {i = 1... s l i = u i < + } I lu = {i = 1... s l i > u i < + }. In this work we consider two widely used complementarity functions both satisfying (1.5): the natural residual (or minimum) function and the Fischer Burmeister function ψ(a b) = min{a b} ψ(a b) = a + b a + b. The corresponding instances of the mapping Ψ in (1.7) will be denoted by Ψ NR and Ψ F B respectively.

For a given solution z IR s of MCP (1.1) (equivalently of (1.)) define the index sets I + = I + ( z) = {i = 1... s Φ i ( z) = 0 z i (l i u i )} I 0 = I 0 ( z) = {i = 1... s Φ i ( z) = 0 z i {l i u i }} N = N( z) = {i = 1... s Φ i ( z) 0}. Observe that no matter how smooth the underlying mapping Φ is if the strict complementarity condition I 0 = is violated then both mappings Ψ = Ψ NR and Ψ = Ψ F B are not necessarily differentiable at z. At the same time they are locally Lipschitz-continuous at z provided Φ possesses this property. The relevant generalized differential objects for these mappings are therefore the B-differential B Ψ( z) = {J IR s s {z k } S Ψ such that {z k } z {Ψ (z k )} J} where S Ψ is the set of points at which Ψ is differentiable and Clarke s generalized Jacobian Φ( z) = conv B Φ( z) where conv stands for the convex hull (see [3 Section.6.1] [9 Section 7.1]). Assume that Φ is differentiable near z with its derivative being continuous at z (implying local Lipschitz continuity of Φ at z). The following upper estimate of B Ψ NR ( z) (see for example [14]) can be derived immediately by the definition of Ψ NR : the rows of any matrix J B Ψ NR ( z) satisfy = Φ i ( z) if i I + J i {Φ i ( z) ei } if i I 0 (1.8) = e i if i N where e i is the i-th row of the s s unit matrix i = 1... s. The set of matrices in IR s s with rows satisfying (1.8) will be denoted by NR ( z). Therefore B Ψ NR ( z) NR ( z). The upper estimate of Ψ F B ( z) has been obtained in [1]. We are not aware of any reference for the proof of the corresponding upper estimate for B Ψ F B ( z) but it can be easily derived directly from the definitions. Specifically the rows of any matrix J B Ψ F B ( z) satisfy Φ i ( z) if i I + J i = α i Φ i ( z) + β ie i if i I 0 (1.9) e i if i N where (α i β i ) IR IR belongs to the set S = {(a b) IR (a 1) + (b 1) = 1} (1.10) for each i I 0. The set of matrices with rows satisfying (1.9) with some (α i β i ) S i I 0 will be denoted by F B ( z). With this notation B Ψ F B ( z) F B ( z). The rest of the paper is organized as follows. In Section we recall the most important and widely used regularity conditions for MCP including those related to the generalized differential objects defined above. In Section 3 we establish the complete picture of relations between these regularity conditions for general MCP and for NCP. Section 4 is concerned with the specificities of KKT systems. 3

Regularity conditions for MCP We will be saying that a set of square matrices is nonsingular if every matrix in this set is nonsingular. The following regularity conditions play a central role in justification of local superlinear convergence of semismooth Newton methods applied to equation (1.6) with a locally Lipschitzian mapping in the left-hand side (see [16 17 1 ] and [9 Section 7.5]). Definition.1 A mapping Ψ: IR s IR s is said to be BD-regular (CD-regular) at z IR s if the set B Ψ( z) ( Ψ( z)) is nonsingular. Assuming again that z IR s is a solution of MCP (1.1) and employing the upper estimates of B Ψ NR ( z) and B Ψ F B ( z) discussed in the previous section we conclude that BD-regularity of Ψ NR (of Ψ F B ) at z is implied by nonsingularity of NR ( z) (of F B ( z)) while CD-regularity of Ψ NR (of Ψ F B ) at z is implied by nonsingularity of conv NR ( z) (of conv F B ( z)). Define the sets Σ = {(a b) IR a + b = 1 a 0 b 0} and B = conv S = {(a b) IR (a 1) + (b 1) 1}. From the definition of NR ( z) by the standard tools of convex analysis it readily follows that conv NR ( z) consists of all matrices J IR s s with rows satisfying (1.9) with some (α i β i ) Σ i I 0. Similarly since J i in (1.9) depends linearly on (α i β i ) by the standard tools of convex analysis it immediately follows that conv F B ( z) consists of all matrices J IR s s with rows satisfying (1.9) with some (α i β i ) B i I 0. In the case of NCP (1.3) nonsingularity of NR ( z) is known under the name of b-regularity of solution z [0]. This condition amounts to the following: the matrix ( (Φ ( z)) I+ I + (Φ ) ( z)) I+ K (Φ ( z)) KI+ (Φ ( z)) KK is nonsingular for any index set K I 0. Here and throughout by M K1 K we denote the submatrix of a matrix M corresponding to row numbers i K 1 and column numbers j K. In the case of KKT system (1.4) nonsingularity of NR ( z) is known as quasi-regularity of solution z = ( x λ µ) IR n IR l IR m [8]. Assume that F is differentiable near x with its derivative being continuous at x and h and g are twice differentiable near x with their second derivatives being continuous at x and define the index sets A + = A + ( x µ) = {i = 1... m µ i > g i ( x) = 0} A 0 = A 0 ( x µ) = {i = 1... m µ i = g i ( x) = 0} Quasi-regularity amounts to saying that the matrix G x ( x λ µ) (h ( x)) T (g A + K ( x))t h (x) 0 0 g A + K ( x) 0 0 4

is nonsingular for any index set K A 0 where by y K we mean the subvector of y with components y i i K. Getting back to general MCP in addition to the regularity conditions mentioned above we will consider the following two properties. Definition. A solution z of MCP (1.1) is referred to as strongly regular if for each r IR s close enough to 0 the perturbed linearized MCP z [l u] Φ( z) + Φ ( z)(z z) r y z 0 y [l u] has near z the unique solution z(r) and the mapping z( ) is locally Lipschitz-continuous at 0. The concept of strong regularity is due to [3] and it keeps playing an important role in modern variational analysis (see e.g. [9 Chapter 5] [6 Chapter ] and bibliographical comments therein). A simple algebraic characterization of strong regularity for NCP was obtained in [3] and was extended to MCP in [7]. Recall that a square matrix M is referred to as a P -matrix if all its principal minors are positive. Solution z is strongly regular if and only if (Φ ( z)) I+ I + is a nonsingular matrix and its Schur complement (Φ ( z)) I0 I 0 (Φ ( z)) I0 I + (Φ ( z)) 1 I + I + (Φ ( z)) I+ I 0 in the matrix ( (Φ ( z)) I+ I + (Φ ( z)) I+ I 0 ) (Φ ( z)) I0 I + (Φ ( z)) I0 I 0 is a P-matrix. The following weaker regularity concept was introduced in [] as the main ingredient of sharp local convergence analysis of Newton-type methods for variational problems. Other applications of this property are concerned with sensitivity and error bounds [9 Sections 5.3 6.]. Definition.3 A solution z of MCP (1.1) is referred to as semistable if for any r IR s close enough to 0 any solution z(r) of the perturbed MCP close enough to z satisfies the estimate z [l u] Φ(z) r y z 0 y [l u] z(r) z = O( r ). 3 Relations between regularity conditions 3.1 Known relations In this section we recall the relations between the regularity properties stated above which we consider to be known or at least well-understood. 5

We start with some relations between BD-regularity and CD-regularity. It is evident that NR ( z) F B ( z) implying also the inclusion for the convex hulls conv NR ( z) conv F B ( z). In particular nonsingularity of F B ( z) implies nonsingularity of NR ( z). The converse implication is not true in general; moreover nonsingularity of NR ( z) does not necessarily imply neither CD-regularity Ψ NR at z nor BD-regularity Ψ F B at z as demonstrated by the following example taken from [18 Example.1]. Example 3.1 Let s = and consider NCP (1.3) with Φ(z) = ( z 1 + z z ). The point z = 0 is the unique solution of this NCP. It can be directly checked that B Ψ NR ( z) = NR ( z) = {( 1 0 0 1 ) ( 1 1 0 1 )} and therefore NR ( z) is nonsingular. On the other hand ( ) 1 1 0 + 1 ( ) ( 1 1 0 1/ = 0 1 0 1 0 1 ) is a singular matrix and hence Ψ NR is not CD-regular at z. For each k = 1... set z k = (1/k /k). Then Ψ F B is differentiable at z k Ψ F B(z k ) = ( 0 1 1/ 0 and the sequence {z k } converges to z. Therefore the singular matrix in the right-hand side of the last relation belongs to B Ψ F B ( z) and hence Ψ F B is not BD-regular at z. The next example taken from [5 Example ] demonstrates that B Ψ F B ( z) can be smaller than F B ( z). Moreover Ψ NR and Ψ F B can be both CD-regular at z when both NR ( x) and F B ( x) contain singular matrices. Example 3. Let s = Φ(z) = ((z 1 +z )/ (z 1 +z )/). Then z = 0 is the unique solution of NCP (1.3). It can be directly checked that and hence B Ψ NR ( z) = Ψ NR ( z) = {( 1 0 1/ 1/ ) ) ( 1/ 1/ 0 1 {( t + (1 t)/ (1 t)/ t/ (1 t) + t/ )} ) t [0 1]}. By direct computation det J = 1/ for all J Ψ NR ( z) implying CD-regularity (and hence BD-regularity) of Ψ NR at z. At the same time {( ) ( ) ( ) ( )} 1 0 1 0 1/ 1/ 1/ 1/ NR ( z) = 0 1 1/ 1/ 0 1 1/ 1/ 6

where the matrix J 0 = ( 1/ 1/ 1/ 1/ is singular. Furthermore F B ( z) consists of matrices of the form ( α1 / + β J = J(α β) = 1 α 1 / α / α / + β for all (α i β i ) S i = 1. By direct computation ) ) (3.1) (3.) det J(α β) = 1 (α 1β + α β 1 + β 1 β ). Since the inclusion (α i β i ) S implies that α i 0 β i 0 for i = 1 this determinant equals zero only provided α 1 β = 0 α β 1 = 0 β 1 β = 0 and hence α 1 = α = 1 β 1 = β = 0 implying that J 0 defined in (3.1) is the only singular matrix which belongs F B ( z). Moreover employing the above characterization of the structure of conv F B ( z) it is evident that J 0 is the only singular matrix in this set. However it can be directly checked that this matrix does not belong neither to B Ψ F B ( z) nor even to Ψ F B ( z) and therefore Ψ F B is CD-regular (and hence BD-regular) at x. One could conjecture that BD-regularity (or at least CD-regularity) of Ψ F B at z implies CD-regularity (or at least BD-regularity) of Ψ NR at z but this is also not the case as demonstrated by the following example taken from [4]. Example 3.3 Let s = Φ(z) = (z z 1 + z ). Then z = 0 is the unique solution of NCP (1.3) and it can be seen that B Ψ NR ( x) contains the singular matrix ( ) 0 1 0 1 while Ψ F B is CD-regular at z. It is also known that BD-regularity of Ψ F B at z does not imply CD-regularity of Ψ F B at z. This can be seen from the following simple example. Example 3.4 Let s = 1 Φ(z) = z. Then z = 0 is the unique solution of NCP (1.3). Obviously Ψ F B (z) = z B Ψ F B ( z) = { } implying BD-regularity of Ψ F B at z. At the same time Ψ F B ( z) = F B ( z) = [ ] contains 0. Finally we summarize the known relations concerning semistability and strong regularity. In [5] it has been shown that BD-regularity of either Ψ NR or Ψ F B at z implies semistability. The converse implication is not true. This can be seen from Examples 3.1 and 3.. 7

As for strong regularity the proof in [10 Theorem 1] implies the following: if z is a strongly regular solution of MCP (1.1) then conv F B ( x) (and hence conv NR ( x)) is nonsingular. In particular strong regularity cannot be implied by any of the conditions not implying nonsingularity of conv F B ( x). Table 1 summarizes the relations discussed in this section. Plus (minus) in each cell means that the property in the title of the row implies (does not imply) the property in the title of the column. Question mark means that to the best of our knowledge the presence or the absence of the corresponding implications has been unknown so far. Table 1: Regularity conditions for MCP: known relations Property Semistability BD-regularity of ΨNR BD-regularity of ΨF B CD-regularity of ΨNR CD-regularity of ΨF B Nonsingularity of NR Nonsingularity of F B Nonsingularity of conv NR Nonsingularity of conv F B Strong regularity Semistability + BD-regularity of Ψ NR + + BD-regularity of Ψ F B + + CD-regularity of Ψ NR + +? +? CD-regularity of Ψ F B + + + Nonsingularity of NR + + + Nonsingularity of F B + + +?? + +??? Nonsingularity of conv NR + +? +? +? +?? Nonsingularity of conv F B + + + + + + + + +? Strong regularity + + + + + + + + + + 3. Remaining relations We now fill the gaps in Table 1. We begin with the following fact. Proposition 3.1 For a solution z of MCP (1.1) the following properties are equivalent: (a) conv NR ( z) is nonsingular. (b) F B ( z) is nonsingular. 8

1.8 S 1.6 1.4 B (t S a t S b) 1. b 1 0.8 Σ (a b) 0.6 0.4 (t Σ a t Σ b) 0. 0 0 0.5 1 1.5 a Figure 1: Sets Σ S and B. (c) conv F B ( z) is nonsingular. Proof. A key observation is the following: for any point (a b) B there exists t Σ > 0 such that (t Σ a t Σ b) Σ and there exists t S > 0 such that (t S a t S b) S (see Figure 1). This implies that any matrix J defined in (1.9) with (α i β i ) B for all i I 0 can be transformed into matrices of the same form but with (α i β i ) Σ and (α i β i ) S respectively for all i I 0 and this transformation can be achieved by multiplication of some rows of J by appropriate positive numbers. In particular such matrices are nonsingular only simultaneously which gives the needed equivalence. Furthermore any of the equivalent properties (a) (c) in Proposition 3.1 implies strong regularity of z as we show next. We first prove the following Lemma closely related to [15 Proposition.7] (see also [10 Proposition 4]). 9

Lemma 3.1 If M IR p p is not a P -matrix then there exist α β IR p such that (α i β i ) S for all i = 1... p where S is defined in (1.10) and the matrix is singular. M(α β) = diag(α)m + diag(β) (3.3) Here and in the sequel diag(α) is the diagonal matrix with diagonal elements equal to the components of the vector α. Proof. We argue by induction. If m = 1 then the assumption that M is not a P -matrix means that M is a nonpositive scalar. It follows that the circle S in (α β)-plane always has a nonempty intersection with the straight line given by the equation diag(α)m + diag(β) = 0. The points in this intersection are the needed pairs (α β). Suppose now that the assertion is valid for any matrix in IR (p 1) (p 1) and suppose that the matrix M IR p p with elements m i j i j = 1... p has a nonpositive principal minor. If the only such minor is det M then set α i = 1 β i = 0 i =... p and compute α 1 m 11 + β 1 α 1 m 1... α 1 m 1p det M(α β) = det m 1 m... m p m p1 m p... m pp = α 1 det M + β 1 det M {... p}{... p} where the last equality can be obtained by expanding the determinant by the first row. Since det M 0 and det M {... m}{... m} > 0 we again obtain that the circle S in (α 1 β 1 )-plane always has a nonempty intersection with the straight line given by the equation det M(α β) = 0 with respect to (α 1 β 1 ) and we again get the needed α and β. It remains to consider the case of existence of an index set K {1... p} such that det M KK 0 and there exists k {1... m} \ K. Removing the k-th row and column from M we then get the matrix M = IR (p 1) (p 1) with a nonpositive principal minor. By the hypothesis of the induction there exist α = (α 1... α k 1 α k+1... α p ) IR p 1 β = (β 1... β k 1 β k+1... β p ) IR p 1 such that (α i β i ) S for all i = 1... p i k and the matrix diag( α) M + diag( β) is singular. Setting α k = 0 β k = 1 we again obtain the needed α and β. Proposition 3. For a solution z of MCP (1.1) if F B ( z) is nonsingular then z is strongly regular. Proof. Nonsingularity of all matrices in F B ( x) is equivalent to saying that the matrix ( D(α β) = (Φ ( x)) I+ I + (Φ ( x)) I+ I 0 diag(α)(φ ( x)) I0 I + diag(α)(φ ( x)) I0 I 0 + diag(β) ) (3.4) 10

is nonsingular for all α = (α i i I 0 ) and β = (β i i I 0 ) satisfying (α i β i ) S i I 0. Taking α i = 0 β i = 1 i I 0 we immediately obtain that (Φ ( x)) I+ I + is nonsingular. Suppose that x is not strongly regular. Then nonsingularity of (Φ ( x)) I+ I + implies that (Φ ( x)) I0 I 0 (Φ ( x)) I0 I + ((Φ ( x)) I+ I + ) 1 (Φ ( x)) I+ I 0 is not a P -matrix. Therefore by Lemma 3.1 we obtain the existence of α = (α i i I 0 ) and β = (β i i I 0 ) satisfying (α i β i ) S i I 0 and such that the matrix diag(α)((φ ( x)) I0 I 0 (Φ ( x)) I0 I + ((Φ ( x)) I+ I + ) 1 (Φ ( x)) I+ I 0 ) + diag(β) is singular. But this matrix is the Schur complement of the nonsingular matrix (Φ ( x)) I+ I + in D(α β) and therefore we conclude that D(α β) is also singular (see e.g. [19 Theorem.1]). Combining Propositions 3.1 and 3. with the known fact that strong regularity of z implies nonsingularity of conv F B ( x) we finally obtain that any of the equivalent properties (a) (c) in Proposition 3.1 is further equivalent to strong regularity. Now the only thing to clarify is whether CD-regularity of Ψ NR at z implies CD-regularity or (at least BD-regularity) of Ψ F B at z. The next example demonstrates that this is not the case; moreover even a combination of CD-regularity of Ψ NR at z and nonsingularity of NR ( z) does not imply BD-regularity (and even less so CD-regularity) of Ψ F B at z. Example 3.5 Let n = Φ(z) = ( z 1 + 3z /( ) z 1 + (1 3/( ))z ). Then z = 0 is the unique solution of the corresponding NCP. Consider any sequence {z k } IR such that z1 k < 0 zk = 0 for all k and zk 1 tends to 0 as k. Then for all k it holds that Φ is differentiable at z k and zk 1 3 Φ (z k (z ) = 1 k) 1 + zk 1 (z1 k ) ( 1 zk 1 1 + 1 3 ) (z1 k) 1 zk 1 (z1 k ( ) 3 = 1 1 ) ( 4 1 + 1 3 ) and therefore the singular matrix in the right-hand side belongs to B Ψ F B ( z). At the same time it can be directly checked that B Ψ NR ( z) = 1 0 1 3 1 3 0 1 11

and hence Ψ NR ( z) = t (1 t) (1 t) 3 ( ) t t 1 3 + (1 t) t [0 1]. By direct computation for any matrix J(t) in the right-hand side of the last relation we have ( det J(t) = 3 ) t 1 1 3 < 0 t [0 1] implying CD-regularity of Ψ NR at z. Observe also that NR ( z) ( 1 0 = 0 1 ) 1 0 1 3 1 3 0 1 3 1 1 3 and it is evident that NR ( z) is nonsingular that is z is a b-regular solution. Example 3.5 shows that replacing B Ψ NR ( z) by its convexification Ψ NR ( z) or by its different enlargement NR ( z) and assuming nonsingularity of all matrices in the resulting set does not imply even BD-regularity of Ψ F B at z. However by Propositions 3.1 and 3. applying both these enlargements together (that is assuming nonsingularity of all matrices in conv NR ( z)) implies strong regularity of z. 4 KKT systems Some implications that are not valid for a general MCP turn out to be true for the special case of a KKT system. The key observation is that unlike the case of NCP for KKT systems formula (1.8) gives not only an outer estimate of the B-differential of Ψ NR but its exact characterization: for any solution z = ( x λ µ) of the KKT system (1.4) it holds that B Ψ NR ( z) = NR ( z) implying also the equality Ψ NR ( z) = conv NR ( z). This is due to the fact that the primal variable x and the dual variable µ are decoupled in the arguments of the natural residual complementarity function and for any J NR ( z) one can readily construct a sequence {z k } S ΨNR such that {z k } z and {Ψ NR (zk )} J. Therefore in the case of the KKT system BD-regularity of Ψ NR at z is equivalent to nonsingularity of NR ( z) (that is to quasi-regularity of this solution) while CD-regularity of Ψ NR at z is equivalent to nonsingularity of conv NR ( z). As for Ψ F B it can be seen that formula (1.9) gives the exact characterization of the B-differential of this mapping at z provided that the gradients g i ( x) i A 0 are linearly independent. We next show that the latter condition is automatically satisfied at any solution z of the KKT system such that Ψ F B is BD-regular at this solution. 1

Proposition 4.1 For a solution z = ( x λ µ) of KKT system (1.4) if Ψ F B is BD-regular at z then x satisfies the linear independence constraint qualification: the gradients h j ( x) j = 1... l g i ( x) i A = A + A 0 are linearly independent. Proof. Fix any sequence {µ k } IR m such that µ k A > 0 µk {1... m}\a = 0 for all k and {µ k A } µ A. Then the sequence {( x λ µ k )} converges to ( x λ µ) and it can be easily seen that for any k the mapping Ψ F B is differentiable at ( x λ µ k ) and the sequence of its Jacobians converges to the matrix G x ( x λ µ) (h ( x)) T (g A ( x))t (g{1... m}\a ( x))t h (x) 0 0 0 g A ( x) 0 0 0 0 0 0 I (perhaps after an appropriate re-ordering of rows and columns) where I stands for the identity matrix of the appropriate size. The needed result is now evident. From this proposition and the preceding discussion it follows that for a KKT system BD-regularity of Ψ F B at z implies nonsingularity of F B ( z) and hence by Proposition 3.1 nonsingularity of conv F B ( z) (which in its turn implies CD-regularity of Ψ F B at z). Also it now becomes evident that CD-regularity of Ψ F B at a solution z of the KKT system implies nonsingularity of F B ( z). Therefore for KKT systems we have three groups of equivalent conditions. The first group consists of BD-regularity of Ψ F B at z CD-regularity of Ψ NR at z CD-regularity of Ψ F B at z nonsingularity of F B ( z) nonsingularity of conv NR ( z) nonsingularity of conv F B ( z) and strong regularity of z. The second group consists of BD-regularity of Ψ NR at z and of nonsingularity of NR ( z). The last group consists of semistability. Conditions in the first group imply conditions in the second and conditions in the second imply semistability. The absence of converse implications is well-understood. The NCP in Example 3.4 corresponds to the primal first-order optimality conditions for the optimization problem minimize 1 x subject to x 0. The unique solution of the corresponding KKT system is z = ( x µ) = (0 0) and it can be readily seen that this solution is quasi-regular but F B ( z) contains a singular matrix. The fact that semistability does not necessarily imply BD-regularity of Ψ NR is demonstrated. e.g. by [13 Example 1]. In conclusion we present all the relations between regularity conditions in question in the form of a flowchart in Figure. The solid arrows correspond to implications valid for a general MCP while the dashed arrows show the additional implications valid for KKT systems. The diagram is complete: if two blocks in it are not connected by (a sequence of) arrows it means the absence of the corresponding implication even for the particular cases of NCP or KKT system (observe that all counterexamples presented in Section 3 are NCPs). 13

Figure : Regularity conditions: complete flowchart of relations. strong regularity quasi-regularity b-regularity nonsingularity of conv NR nonsingularity of NR semistability nonsingularity of F B CD-regularity of Ψ NR BD-regularity of Ψ NR nonsingularity of conv F B CD-regularity of Ψ F B BD-regularity of Ψ F B 14

References [1] S.C. Billups. Algorithms for complementarity problems and generalized equations. Technical Report 95-14. Computer Sciences Department University of Wisconsin Madison. August 1995. PhD thesis. [] J.F. Bonnans. Local analysis of Newton-type methods for variational inequalities and nonlinear programming. Appl. Math. Optim. 9 (1994) 161 186. [3] F.H. Clarke. Optimization and Nonsmooth Analysis. John Wiley New York 1983. [4] A.N. Daryina A.F. Izmailov and M.V. Solodov. A class of active-set Newton methods for mixed complementarity problems. SIAM J. Optim. 15 (004) 409-49. [5] A.N. Daryina A.F. Izmailov and M.V. Solodov. Mixed complementary problems: regularity estimates of the distance to the solution and Newton s methods. Comput. Math. Math. Phys. 44 (004) 45 61. [6] A.L. Dontchev and R.T. Rockafellar. Implicit Functions and Solution Mappings. Springer-Verlag New York 009. [7] F. Facchinei A. Fischer and C. Kanzow. A semismooth Newton method for variational inequalities: The case of box constraints. In: M.C. Ferris J.-S. Pang eds. Complementarity and Variational Problems: State of the Art pp. 76 90. SIAM Philadelphia 1997. [8] F. Facchinei A. Fischer and C. Kanzow. On the accurate identifcation of active constraints. SIAM J. Optim. 9 (1999) 14 3. [9] F. Facchinei and J.-S. Pang. Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer-Verlag New York 003. [10] M.C. Ferris C. Kanzow and T.S. Munson. Feasible descent algorithms for mixed complementarity problems. Math. Program. 86 (1999) 475 497. [11] M.C. Ferris and J.-S. Pang. Engineering and economic applications of complementarity problems. SIAM Rev. 39 (1997) 669 713. [1] P.T. Harker and J.-S. Pang. Finite-dimensional variational inequality problems: A survey of theory algorithms and applications. Math. Program. 48 (1990) 161 0. [13] A.F. Izmailov and M.V. Solodov. Karush-Kuhn-Tucker systems: regularity conditions error bounds and a class of Newton-type methods. Math. Program. 95 (003) 631 650. [14] C. Kanzow and M. Fukishima. Solving box constrained variational inequalities by using the natural residual with D-gap function globalization. Oper. Res. Letters 3 (1998) 45 51. 15

[15] C. Kanzow and H. Kleinmichel. A new class of semismooth Newton-type methods for nonlinear complementarity problems. Comput. Optim. Appl. 11 (1998) 7 51. [16] B. Kummer. Newton s method for nondifferentiable functions. In J. Guddat B. Bank H. Hollatz P. Kall D. Klatte B. Kummer K. Lommalzsch L. Tammer M. Vlach and K. Zimmerman eds. Advances in Mathematical Optimization V. 45 pp. 114 15. Akademie-Verlag Berlin 1988. [17] B. Kummer. Newton s method based on generalized derivatives for nonsmooth functions. In W. Oettli and D. Pallaschke eds. Advances in Optimization pp. 171 194. Springer- Verlag Berlin 199. [18] T. De Luca F. Facchinei and C. Kanzow. A theoretical and numerical comparison of some semismooth algorithms for complementarity problems. Comput. Optim. Appl. 16 (000) 173 05. [19] D.V. Ouellette. Schur complements and statistics. Linear Algebra Appl. 36 (1981) 187 95. [0] J.-S. Pang and S.A. Gabriel. NE/SQP: A robust algorithm for the nonlinear complementarity problem. Math. Program. 60 (1993) 95 338. [1] L. Qi. Convergence analysis of some algorithms for solving nonsmooth equations. Math. Oper. Res. 18 (1993) 7 44. [] L. Qi and J. Sun. A nonsmooth version of Newton s method. Math. Program. 58 (1993) 353 367. [3] S.M. Robinson. Strongly regular generalized equations. Math. Oper. Res. 5 (1980) 43 6. 16