First-order optimality conditions for mathematical programs with second-order cone complementarity constraints

Size: px
Start display at page:

Download "First-order optimality conditions for mathematical programs with second-order cone complementarity constraints"

Transcription

1 First-order optimality conditions for mathematical programs with second-order cone complementarity constraints Jane J. Ye Jinchuan Zhou Abstract In this paper we consider a mathematical program with second-order cone complementarity constraints SOCMPCC. The SOCMPCC generalizes the mathematical program with complementarity constraints MPCC in replacing the set of nonnegative reals by second-order cones. There are difficulties in applying the classical Karush- Kuhn-Tucker condition to the SOCMPCC directly since the usual constraint qualification such as Robinson s constraint qualification never holds if it is considered as an optimization problem with a convex cone constraint. Using various reformulations and recent results on the exact formula for the proximal/regular and limiting normal cone, we derive necessary optimality conditions in the forms of the strong-, Mordukhovich- and Clarke- S-, M- and C- stationary conditions under certain constraint qualifications. We also show that unlike the MPCC, the classical KKT condition of the SOCMPCC is in general not equivalent to the S-stationary condition unless the dimension of each second-order cone is not more than 2. Finally, we show that reformulating an MPCC as an SOCMPCC produces new and weaker necessary optimality conditions. Key words: mathematical program with second-order cone complementarity constraints, necessary optimality conditions, constraint qualifications, S-stationary conditions, M-stationary conditions, C-stationary conditions. AMS subject classification: 9C3, 9C33, 9C46. Introduction In this paper we consider the following mathematical program with second-order cone complementarity constraints SOCMPCC or MPSOCC SOCMPCC min fz s.t. hz =, gz, K i G i z H i z K i, i =,, J, where a b means that the vector a is perpendicular to vector b. Throughout the paper we assume that f : R n R, g : R n R p, h : R n R q, G i : R n R m i, H i : R n R m i are The first author work was partially supported by NSERC. The second author s work was supported by National Natural Science Foundation of China 248, Department of Mathematics and Statistics, University of Victoria, Victoria, B.C., Canada V8W 2Y2 janeye@uvic.ca. Department of Mathematics, School of Science, Shandong University of Technology, Zibo 25549, P.R. China jinchuanzhou@63.com.

2 SOCMPCC 2 all continuously differentiable and K i is an m i -dimensional second-order cone defined as K i := {x = x, x 2 R R m i x x 2 }, where denotes the Euclidean norm and when m i =, K i stands for the set of nonnegative reals R +. In particular, SOCMPCC with all m i = for i =,, J coincides with the mathematical program with complementarity constraints MPCC which has received a lot of attention in the last twenty years or so [9, 3]. The generalization from MPCC to SOCMPCC has many important applications. We briefly review two of them. In practice it is more realistic to assume that an optimization problem involves uncertainty. An approach to optimization under uncertainty is robust optimization. For example, consider a robust bilevel programming problem where for a fixed upper level decision variable x, the lower level problem is replaced by its robust counterpart: P x : min y {fx, y, ζ : gx, y, ζ ζ U}, where U is some uncertainty set in the space of the data. It is well-known see [2] that if the uncertainty set U is given by a system of conic quadratic inequalities, then the deterministic counterpart of the problem P x is a second-order cone program. If this second-order cone program can be equivalently replaced by its Karush-Kuhn-Tucker KKT condition, then it yields an SOCMPCC. Another application of SOCMPCC is in modelling an inverse quadratic programming problem over the second-order cone, in which the parameters in a given second-order cone quadratic programming problem need to be adjusted as little as possible so that a known feasible solution becomes optimal see [28] for details. It is known that if an MPCC is treated as a nonlinear program with equality and inequality constraints, then Mangasarian-Fromovitz constraint qualification MFCQ fails to hold at each feasible point of the feasible region; see [26, Proposition.]. This causes great difficulties in applying classical theories and algorithms in nonlinear programs directly to MPCCs. To remedy this problem, several variants of stationary conditions such as the strong S-, Mordukhovich M-, Clarke C- stationary conditions have been proposed and constraint qualifications under which a local minimizer is an S-, M-, C-stationary point have been studied; see e.g., [7, 23] for a detailed discussion. For mathematical program with semidefinite cone complementarity constraints SDCMPCC, the matrix analogue of the MPCC, it was shown in [6] that Robinson s CQ, which is the usual constraint qualification for an optimization problem with a convex cone constraint, fails to hold at each feasible point and the corresponding S-, M-, C-stationary conditions were proposed and the constraint qualifications under which a local minimizer is an S-, M-, C-stationary point have been studied. The same difficulties exist for SOCMPCC. Notice that the cone complementarity constraint K Gz Hz K, where G, H : R n R m and K is the m-dimensional second-order cone, amounts to the following convex cone constraints: Gz, Hz, Gz K, Hz K. In this paper we show that if SOCMPCC is regarded as an optimization problem with a convex cone constraint, then Robinson s CQ fails to hold at each feasible point of SOCM- PCC.

3 SOCMPCC 3 So far there are only a few papers devoted to the study of SOCMPCC [8, 4, 8, 9, 2, 27, 28, 29] and [8, 9, 2, 27, 28, 29] mainly study numerical algorithms which are not the main purpose of this paper. To the best of our knowledge, the problem SOCMPCC was studied for the first time by Outrata and Sun in [4]. The approach taken was to consider the cone complementarity constraint as Gz Hz, Gz gphπ K, where gphπ K is the graph of the metric projection operator onto the second-order cone K. By computing the limiting normal cone to gphπ K or equivalently the limiting coderivative of the metric projection Π K, an M-stationary condition was shown to be necessary for optimality under the condition that there is no abnormal multipliers see [4, Theorem 6]. The same reformulation was further taken in Zhang, Zhang and Wu [27] to define M- and S-stationary conditions in terms of the regular and the limiting coderivative of the metric projection onto the second-order cone respectively see [27, Definitions 3.6 and 3.7]. Moreover a B-stationary condition is defined in [27, Definition 3.3] and it was shown that under the SOCMPCC-LICQ, the B-stationarity is equivalent to the S-stationarity [27, Lemma 3.2]. Moreover in [27, Definition 3.5] the C-stationary condition was proposed to be the nonsmooth KKT condition involving the Clarke generalized gradient for problem SOCMPCC where the cone complementarity constraint is reformulated as a nonsmooth equation constraint: Gz Π K Gz Hz =. However these optimality conditions are not in forms that are analogues to the S-, M- and C- stationary conditions for MPCCs and they are not explicit due to the existence of coderivatives or Clarke subdifferential of the metric projection onto the second-order cone in these formulas. Notice that the second-order cone complementarity constraint can be reformulated as a nonconvex cone constraint: Gz, Hz Ω, where Ω := {x, y x K, y K, x T y = } is called the second-order cone complementarity set or complementarity cone since it is a cone. Note that Ω is nonconvex due to the existence of complementarity conditions. If the exact expression for the regular and the limiting normal cones of second-order cone complementarity sets can be derived, then the corresponding stationary conditions would be the suitable generalization of the S- and M-stationary conditions. The first attempt in this direction was initiated by Liang, Zhu and Lin in [8] where they tried to derive exact expressions for the regular and the limiting normal cones of the second-order cone complementary set by using the relationships between the metric projection operator and the second-order cone complementary set. Unfortunately, there are some gaps in their expressions of the regular and the limiting normal cones, mainly on the boundary points, which result in gaps in their proposed expressions for the S-, M-, and C-stationary conditions. In a recent paper [25], we fill in this gap and establish the correct exact expressions for the regular and limiting normal cone of the second-order cone complementary set. Furthermore, we show that the regular and the proximal normal cones to the second-order cone complementary set coincide with each other. Using these exact expressions for the regular and the limiting normal cone of the second-order cone complementary set, in this paper we propose S-, M-,

4 SOCMPCC 4 and C-stationary conditions for SOCMPCC in a form that are analogues to the S-, M- and C-stationary conditions for MPCCs. It is well-known that for MPCC, the classical KKT condition is equivalent to the S- stationary condition see e.g. [7]. For SDCMPCC it was shown in [6] that in general the classical KKT condition is stronger than the S-stationary condition but these two conditions may not be equivalent. It is natural to ask the question whether or not the classical KKT condition is equivalent to the S-stationary condition for SOCMPCC. In this paper we show that for SOCMPCC, in general the classical KKT condition is a stronger condition than the S-stationary condition while these two concepts coincide when the dimension of each second-order cone K i is not more than 2. Moreover an example is given to illustrate that an S-stationary point may not be a classical KKT point when one of the second-order cone K i has dimension greater than 2. Since in general the classical KKT condition and the S-stationary condition are different, we introduce a new stationary point concept called K-stationary point, which is equivalent to the classical KKT point. Furthermore we have derived an exact expression for the set of all multipliers satisfying the K-stationary condition and shown that it is just a subset of the regular normal cone of the second-order cone complementarity set. We summarize our main contributions as follows: We show that Robinson s CQ fails to hold at every feasible point of SOCMPCC if the SOCMPCC is treated as an optimization problem with a convex cone constraint. We obtain the precise description for the S-, M-, and C-stationary conditions in the forms that are analogues to the associated stationary conditions for MPCCs and show that they are necessary for optimality under the corresponding Clarke calmness conditions. We also show that the S-stationary condition is a necessary optimality condition for a local minimum if the SOCMPCC LICQ holds. Moreover we show that for the case where all mappings are affine and the dimension of each second-order cone is less or equal to 2, a local minimal solution of SOCMPCC must be an M-stationary point without any further constraint qualification. We derive the relationships between various stationary conditions and shown that in general the K-stationary condition is stronger than the S-stationary condition but not equivalent and these two concepts coincide when the dimension of all K i is less or equal to 2. We obtain the relationship between various Clarke calmness conditions for the general optimization problem with symmetric cone complementarity constraints. Such results are new even for the case of MPCCs. We establish the relationship of various stationary points between MPCC and its SOCMPCC reformulation. We organize our paper as follows. Section 2 contains the preliminaries. In Section 3, we show that Robinson s CQ never holds if SOCMPCC is considered as an optimization problem with a convex cone constraint. The K-stationary condition is introduced and studied in this section. In Sections 4, 5 and 6, we give the explicit expressions for the S-, M- and C-stationary conditions and propose some constraint qualifications for them to be necessary for optimality. Section 7 gives the connections among various stationary

5 SOCMPCC 5 conditions and various Clarke calmness conditions. In Section 8 we reformulate MPCC as SOCMPCC and obtain some new and weaker necessary optimality conditions for MPCCs. The following notations will be used throughout the paper. We denote by I and O the identity and zero matrix of appropriate dimensions respectively. For a matrix A, we denote by A T its transpose. The inner product of two vectors x, y is denoted by x T y or x, y. For x = x, x 2 R R m, we write its reflection about the x axis as ˆx := x, x 2. Denote by Rx the set {tx t R}. R + x and R ++ x where R + := [, and R ++ :=, are similarly defined. For a set C, denote by intc, clc, bdc, coc, C c its interior, closure, boundary, convex hull, and complement, respectively. The polar cone of a vector v is v := {x x T v }. Given a point x R n and ε >, B ε x denotes an open ball centered at x with radius ε while B denotes the open unit ball center at the origin of an appropriate dimension. For a differentiable mapping H : R n R m and a vector x R n, we denote by J Hx the Jacobian matrix of H at x and Hx := J Hx T. The graph of a set-valued mapping Φ : R n R m, is denoted by gphφ, i.e., gphφ := {z, v R n R m v Φz}. 2 Preliminaries In this section we review some basic concepts in variational analysis and then specialize it to the second-order cone and the second-order cone complementarity set. 2. Background in variational analysis First we summarize some background materials on variational analysis which will be used throughout the paper. Detailed discussions on these subjects can be found in [4, 5,, 2, 6]. Let C be a nonempty subset of R n. Given x clc, the proximal normal cone of C at x is defined as N π Cx := {v R n M >, such that v, x x M x x 2 x C} and the regular/fréchet normal cone is N C x := {v R n v, x x o x x x C}, where o means that oα/α as α. The limiting/mordukhovich normal cone is defined as the outer limit of either the proximal normal cone or the regular normal cone, i.e., N C x := { lim i ζ i ζ i N π Cx i, x i x, x i C} = { lim i ζ i ζ i N C x i, x i x x i C}. Proposition 2. Change of coordinates [6, Exercise 6.7] Let F : R n R m be smooth and set D R m. Suppose that F x has full column rank m at a point x F := {x R n F x D}. Then N F x = { F x y y N D F x }, N F x = { F x y y N D F x }.

6 SOCMPCC 6 Let Φ : R n R m be a set-valued map and x, y gphφ. The regular coderivative and the limiting Mordukhovich coderivative of Φ at x, y are the set-valued mappings defined by D Φx, y v := {u R n u, v N gphφ x, y }, D Φx, y v := {u R n u, v N gphφ x, y }, respectively. We omit y in the coderivative notation if the set-valued map Φ is single-valued at x. For a single-valued Lipschitz continuous map Φ : R n R m, the Bouligand-subdifferential B Φ is defined as B Φx = { lim k J Φx k x k x, Φ is diffferentiable at x k }. It is known that co B Φx = c Φx, the Clarke generalized Jacobian of Φ at x see [4]. Moreover if Φ is a continuously differentiable single-valued map, then D Φx = D Φx = Φx. 2.2 Background in variational analysis associated with the second-order cone Let K be the m-dimensional second-order cone. The topological interior and the boundary of K are respectively. intk = {x, x 2 R R m x > x 2 } and bdk = {x, x 2 R R m x = x 2 }, Proposition 2.2 For any x, y bdk\{}, the following equivalence holds: x T y = y = kˆx with k = y /x > y = kˆx with k R ++. Proof. Suppose that x, y bdk\{} and x T y =. Then x = x 2 >, y = y 2 >, x T y = x y + x T 2 y 2 =, 2 which implies that x T 2 y 2 = x y = x 2 y 2. Hence there exists a positive constant k such that y 2 = kx 2. It follows from 2 that k = y /x and hence y = kˆx. The rest of the proof follows from [8, Lemma 2.3]. The exact formula of the regular normal cone and limiting normal cone of Ω have been established in [25]. Proposition 2.3 [25, Theorem 3.] Let x, y be in the m-dimensional second-order cone complementarity set Ω. Then {u, v u R m, v = } if x =, y intk; {u, v u =, v R m } if x intk and y = ; {u, v u x, v y, x N Ω x, y = û + y v Rx} if x, y bdk\{}, x T y = ; {u, v u ŷ, v R ŷ} if x =, y bdk\{}; {u, v u R ˆx, v ˆx } if x bdk\{}, y = ; {u, v u K, v K} if x =, y =.

7 SOCMPCC 7 Proposition 2.4 [25, Theorem 3.3] Let x, y Ω where Ω is the m-dimensional secondorder cone complementarity set. Then N Ω x, y = N {u, v u R m, v = } if x =, y intk; Ω x, y = {u, v u =, v R m } if x intk, y = ; {u, v u x, v y, x û + y v Rx} if x, y bdk\{}. For x =, y bdk\{}, N Ω x, y = {u, v u R m, v = or u ŷ, v Rŷ or u, ŷ, v R ŷ}; for x bdk\{}, y =, N Ω x, y = {u, v u =, v R m or u Rˆx, v ˆx or u R ˆx, v, ˆx }; for x = y =, N Ω x, y = {u, v u K, v K or u R m, v = or u =, v R m or u R ξ, v ξ or u ξ, v R ξ or u ξ, v ˆξ, αû + αv Rξ, α [, ], for some ξ C} where C := {, w w R m, w = }. 3 Failure of Robinson s CQ and the classical KKT condition Note that G i z, H i z K i implies that G i z T H i z for i =,..., J. Hence SOCM- PCC can be rewritten as an optimization problem with a convex cone constraint: K-SOCMPCC min fz s.t. gz, hz =, Gz, Hz, Gz, Hz K K, where Gz := G z,, G J z, Hz := H z,, H J z, and K := K K 2 K J. We denote by τ := J j= m j. For a general optimization problem with a cone constraint such as K-SOCMPCC, the following Robinson s CQ is considered to be a usual constraint qualification: h i z i =,..., q are linearly independent, h i z T d =, i =,..., q, d R n such that gz + gz T d intr p +, Hz Gz + Gz Hz T d <, Gz + Gz T d int K, Hz + Hz T d int K. It is well-known that the MFCQ never holds for MPCCs. We now show that Robinson s CQ never holds for the K-SOCMPCC.

8 SOCMPCC 8 Proposition 3. For K-SOCMPCC, Robinson s CQ fails to hold at every feasible solution of SOCMPCC. Proof. Any feasible solution z of SOCMPCC must be a solution to the following mathematical program with a convex cone constraint: min Gz, Hz s.t. Gz K, Hz K. By the Fritz John necessary optimality condition, there exist λ, λ G R τ, λ H R τ not all equal to zero such that = λ G, H z + Gz λ G + Hz λ H, λ G N KGz, λ H N KHz. It is clear that,,, λ, λ G, λ H is a singular Lagrange multiplier of K-SOCMPCC. By [3, Propositions 3.6 ii and 3.9iii], a singular Lagrange multiplier exists if and only if Robinson s CQ does not hold. Therefore we conclude that Robinson s CQ does not hold at z for K-SOCMPCC. For a feasible point z of SOCMPCC, define the following index sets I g z := {i g i z = }, I G z := {i G i z = }, I + G z := {i G iz intk i }, I H z := {i H i z = }, I + H z := {i H iz intk i }, B H z := {i H i z bdk i \{}}, B G z := {i G i z bdk i \{}}. For simplicity we may omit the dependence of z in the above index sets and denote G i z, H i z by G i, H i and Ĝiz, Ĥiz by Ĝi, Ĥi, respectively, if there is no confusion. Now we introduce a new concept of stationary point for SOCMPCC, called K-stationary point, and we show that the K-stationary condition 3 is equivalent to the classical KKT conditions 4. Definition 3. K-stationary point Let z be a feasible solution of SOCMPCC. We say that z is a K-stationary point of SOCMPCC if there exists a multiplier λ g, λ h, λ G, λ H such that the following K-stationary condition holds: fz + gz λ g + hz λ h + J G i z λ G i + J H i z λ H i =, λ g, gz T λ g =, λ G i R m i, λ H i = if i I G I + H, λ G i =, λ H i R m i if i I + G I H, λ G i RĜiz, λ H i RĤiz if i B G B H, λ G i K i + R + H i z, λ H i R Ĥ i z if i I G B H, λ G i R Ĝ i z, λ H i K i + R + G i z if i B G I H, λ G i K i, λ H i K i if i I G I H. Definition 3.2 We say that K-SOCMPCC is Clarke calm at a feasible solution z if there exist positive ε and µ such that, for all r, s, t, p εb, for all z B ε z F K r, s, t, p, one has fz fz + µ r, s, t, p, 3

9 SOCMPCC 9 where F K r, s, t, p := { z hz + r =, gz + s, Gz, Hz + t, Gz, Hz + p K K }. Theorem 3. Let z be a local optimal solution of SOCMPCC. Suppose that the problem K-SOCMPCC is Clarke calm at z. Then z is a K-stationary point. Moreover the K- stationary condition is equivalent to the classical KKT condition 4. Proof. Since the problem K-SOCMPCC is Clarke calm at z, by the classical necessary optimality condition see e.g. [6, Theorem 2.2], there exists λ g, λ h, a, b, γ R p R q R τ R τ R such that the classical KKT condition holds: fz + gz λ g + hz λ h + J G i z a i + J H i z b i +γ G T Hz =, λ g, gz T λ g =, G i z K i, a i K i, G i z T a i =, i =,, J, H i z K i, b i K i, H i z T b i =, i =,, J, γ. We now show the equivalence of the classical KKT condition 4 and the K-stationary condition 3. Let λ G := a + γhz and λ H := b + γgz. We first show that λ g, λ h, λ G, λ H satisfies 3. Consider the following cases. i I G I + H. Then G iz =, H i z intk i. By 4, b i = and hence λ H i = b i + γg i z =. i I + G I H. Similar to Case we can show that λ G i =. i B G B H. Then H i z, G i z bdk i \{} and H i z G i z. Since a i G i z and a i K i by 4, then a i R + Ĝ i z. Similarly, b i R + Ĥ i z by b i H i z and b i K i. It follows from Proposition 2.2 that H i z R ++ Ĝ i z and G i z R ++ Ĥ i z. So λ G i = a i + γh i z RĜiz and λ H i = b i + γg i z RĤiz. i I G B H. Then G i z =, H i z bdk i \{}. Since a i, b i K i and b i H i z by 4, then b i R + Ĥ i z. Hence λ G i = a i + γh i z K i + R + H i z and λ H i = b i + γg i z = b i R Ĥ i z. i B G I H. Similarly to the above case, we have λ G i = a i +γh i z = a i R Ĝ i z and λ H i = b i + γg i z K i + R + G i z. i I G I H. Then G i z = H i z =. By 4, we have λ G i = a i K i and λ H i = b i K i. Hence λ g, λ h, λ G, λ H satisfies 3. Conversely, take λ g, λ h, λ G, λ H satisfying 3. Let a := λ G γhz and b := λ H γgz where γ >. We now show that λ g, λ h, a, b, γ satisfies 4 if γ is sufficiently large. Consider the following cases. 4

10 SOCMPCC i I G I + H. Then a i = λ G i γh i z = γ [ λ G i γ H i z ] and b i = λ H i γg i z = λ H i =. Since H i z intk i, λ G i /γ H iz K i when γ is sufficiently large. Hence a i K i and b i = K i. i I + G I H. Similar to Case, we can show that a i = K i and b i K i. i B G B H. Then G i z, H i z bdk i \{}. By Proposition 2.2, G i z = kĥiz for some k >, which in turn implies that H i z = Ĝiz /k. By 3, λ G i = t Ĝ i z and λ H i = t 2 Ĥ i z for some t, t 2 R. Hence a i = γh i z λ G i = γ/k t Ĝiz K i and b i = γg i z λ H i = γk t 2 Ĥiz K i provided that γ is sufficiently large. In addition, a i, G i z = t γ/k Ĝiz, G i z = and b i, H i z = t 2 γk Ĥiz, H i z =. i I G B H. It follows from 3 that λ G i = t H i z ξ i and λ H i = t 2 Ĥ i z for some t, t 2 and ξ i K i. Hence a i = γh i z λ G i = γ t H i z +ξ i K i as γ t. Similarly, b i = λ H i γg i z = λ H i = t 2 Ĥ i z K i. In addition, a i, G i z = since G i z = and b i, H i z = t 2 Ĥ i z, H i z =. i B G I H. The argument is similar to the above case. i I G I H. Then G i z = H i z = and a i = λ G i K i and b i = λ H i K i. Hence λ g, λ h, a, b, γ satisfies 4. 4 S-stationary conditions For MPCC, it is known see Ye [2, Theorem 3.2] that the S-stationary condition is equivalent to the stationary condition derived by using the proximal normal cone of the complementarity set. In this vector case, the regular normal cone is the same as the proximal normal cone. For SDCMPCC, it was shown that the regular normal cone is the same as the proximal normal cone and the S-stationary condition is defined by using the proximal normal cone [6]. Similarly, in [25] it was verified that the regular normal cone coincides with the proximal normal cone for the second-order cone complementarity set and hence we can define the S-stationary condition below. First we introduce the concept of weak W- stationary points. Note that when the dimension m i 2, the condition G i z ˆλG i + H i z λ H i RG i z is redundant and can be omitted. Definition 4. W-stationary point Let z be a feasible solution of SOCMPCC. We say that z is a weak stationary point of SOCMPCC if there exist a multiplier λ g, λ h, λ G, λ H such that fz + gz λ g + hz λ h + J G i z λ G i + J H i z λ H i =, λ g, gz T λ g =, λ G i R m i, λ H i = if i I G I + H, λ G i =, λ H i R m i if i I + G I H, λ G i G i z, λ H i H i z, G i z ˆλG i + H i z λ H i RG i z if i B G B H. 5

11 SOCMPCC Definition 4.2 S-stationary point Let z be a feasible solution of SOCMPCC. We say that z is a strong stationary point of SOCMPCC if there exist a multiplier λ g, λ h, λ G, λ H such that = fz + gz λ g + hz λ h + J G i z λ G i + J H i z λ H i, λ g, gz T λ g =, λ G i, λh i N Ωi G i z, H i z, i =,..., J, or equivalently such that 5 and the following condition hold: λ H i R Ĥ i z, λ G i, Ĥiz if i I G z B H z, λ G i R Ĝ i z, λ H i, Ĝiz if i B G z I H z, λ G i K i, λ H i K i if i I G z I H z. Definition 4.3 Let z be a feasible solution of SOCMPCC. We say that SOCMPCC-LICQ holds at z provided that the gradient vectors are linearly independent. g i z i I g z, h i z i =,..., q, G i z i I G z B G z, H i z i I H z B H z In the following theorem we show that under SOCMPCC-LICQ, a local optimal solution of SOCMPCC must be an S-stationary point. Theorem 4. Let z be a local optimal solution of SOCMPCC. If SOCMPCC-LICQ holds at z, then z is an S-stationary point. Proof. Since z is a local optimal solution, it is also a local optimal solution of the problem with the same objective function and with the inactive constraints g i z < i I g z, H i z intk i, i I, G i z intk i, i I 2 deleted from the feasible region, i.e., z is a local optimal solution to the problem: min fz s.t. hz =, g i z, i I g z, G i z =, i I, H i z =, i I 2, K i G i z H i z K i, i I I 2 c, where I := I G z I + H z, I 2 := I + G z I H z. Then fz + N F z, where F := {z F z D} is the feasible region of the above problem with and F z := hz, g Ig z, G I z, H I2 z, G I I 2 cz, H I I 2 cz, D := {} R Ig {}I {} I 2 Ω I I 2 c, Ω I I 2 c := {u i, v i K i u i v i K i, i I I 2 c }. By the SOCMPCC-LICQ, F z has a full column rank. The desired result follows from Propositions 2. and 2.3 by letting λ g i = for i / I gz, λ H i = for i I and λ G i = for i I 2, i.e., letting the multiplies corresponding to the deleted constraints be zero.

12 SOCMPCC 2 5 M-stationary conditions In this section we study the M-stationary condition for SOCMPCC. For this purpose we rewrite the SOCMPCC as an optimization problem with a nonconvex cone constraint: M-SOCMPCC min fz s.t. hz =, gz, G i z, H i z Ω i, i =,..., J, where Ω i := {x, y x K i, y K i, x y}. As in the MPCC case, we will show that the M-stationary condition introduced below is the KKT condition of M-SOCMPCC by using the limiting normal cone. Note that when the dimension m i 2, the condition α iˆλg i + α i λ H i Rξ i for some α i [, ] is redundant and can be omitted. Definition 5. M-stationary point Let z be a feasible solution of SOCMPCC. We say that z is an M-stationary point of SOCMPCC if there exist multipliers λ g, λ h, λ G, λ H such that = fz + gz λ g + hz λ h + J G i z λ G i + J H i z λ H i, λ g, gz T λ g =, λ G i, λh i N Ω i G i z, H i z, i =,..., J, or equivalently such that 5 and the following condition hold: λ G i R m i, λ H i = or λ G i Ĥiz, λ H i RĤiz or λ H i R Ĥ i z, λ G i, Ĥiz if i I G B H, λ G i =, λ H i R m i or λ G i RĜiz, λ H i Ĝiz or λ G i R Ĝ i z, λ H i, Ĝiz if i B G I H, λ G i K i, λ H i K i or λ H i =, λ G i R m i or λ G i =, λ H i R m i or λ G i R ξ i, λ H i ξi or λ H i R ξ i, λ G i ξi or λ G i ξ i, λ H i ˆξ i, α iˆλg i + α i λ H i Rξ i for some α i [, ] and some ξ i C i if i I G I H, where C i := {, w R R m i w = }. Definition 5.2 We say that M-SOCMPCC is Clarke calm at a feasible solution z if there exist positive ε and µ such that, for all r, s, p εb, for all z B ε z F M r, s, p, one has fz fz + µ r, s, p, where F M r, s, p := { z hz + r =, gz + s, G i z, H i z + p i Ω i, i =,..., J }. Theorem 5. Let z be a local optimal solution of SOCMPCC. Suppose that the problem M-SOCMPCC is Clarke calm at z. Then z is an M-stationary point of SOCMPCC.

13 SOCMPCC 3 Proof. By Theorem [6, Theorem 2.2], there exists a multiplier λ g, λ h, λ G, λ H such that = fz + gz λ g + hz λ h + J G i z λ G i + J H i z λ H i, λ g, gz T λ g =, λ G i, λ H i N Ωi G i z, H i z, i =,..., J, and so the desired result follows from using the expression of the limiting normal cone in Proposition 2.4. Definition 5.3 Let z be a feasible solution of SOCMPCC. We say that the constraint system of M-SOCMPCC has a local error bound at z if there exist µ, ε > such that distz, F M,, µ r, s, p, r, s, p εb and z F M r, s, p B ε z. Note that the constraint system of M-SOCMPCC has a local error bound at z if and only if the set-valued mapping F M r, s, p is calm [6] or pseudoupper-lipschitz continuous using the terminology of [24] around,,, z. Hence F M r, s, p being either pseudo-lipschitz continuous [] around,,, z or upper-lipschitz continuous [5] at z implies that the constraint system of M-SOCMPCC has a local error bound at z. The proposition below is an easy consequence of Clarke s exact penalty principle [4, Proposition 2.4.3] and the calmness of the constraint system. See [22, Proposition 4.2] for a proof. Proposition 5. If the objective function is Lipschitz near z and F M r, s, p is calm at,,, z, then the problem M-SOCMPCC is calm at z. Definition 5.4 SOCMPCC-NNAMCQ Let z be a local optimal solution of SOCM- PCC. We say that SOCMPCC-No Nonzero Abnormal Multiplier Constraint Qualification SOCMPCC-NNAMCQ holds at z if there is no nonzero vector λ g, λ h, λ G, λ H such that the following conditions hold: = gz λ g + hz λ h + J G i z λ G i + J H i z λ H i, λ g, gz T λ g =, λ G i, λh i N Ω i G i z, H i z, i =,..., J. Theorem 5.2 Let z be a local optimal solution of SOCMPCC. Then z is an M-stationary point under one of the following constraint qualifications: i The SOCMPCC-NNAMCQ holds at z. ii All mappings h, g, G, H are affine and m i 2 for i =,..., J. Proof. By Theorem 5. and Proposition 5., it suffices to show the calmness of F M. i Similarly as in [22, Theorem 4.4], we can show that under SOCMPCC-NNAMCQ, the constraint system of M-SOCMPCC is pseudo-lipschitz continuous around,,, z and hence has a local error bound at z. ii Since when m i 2, the second-order cone K i is polyhedral and hence the secondorder cone complementarity set Ω i is a union of finitely many polyhedral convex sets. Since all mappings h, g, G, H are affine, the graph of the set-valued mapping F M is a union of polyhedral convex sets and hence F M is a polyhedral set-valued mapping. By [5, Proposition ], F M is upper-lipschitz and hence the local error bound condition holds at z.

14 SOCMPCC 4 6 C-stationary conditions In this section, we consider the C-stationary condition by reformulating SOCMPCC as a nonsmooth problem: C-SOCMPCC min fz s.t. hz =, gz, G i z Π Ki Gi z H i z =, i =,..., J. As in the MPCC case, the C-stationary condition introduced below is the nonsmooth KKT condition of C-SOCMPCC by using the Clarke generalized gradient. Definition 6. C-stationary point Let z be a feasible solution of SOCMPCC. We say that z is a C-stationary point of SOCMPCC if there exists a multiplier λ g, λ h, λ G, λ H such that 5 and the following conditions hold: λ H i RĤiz if i I G B H, λ G i RĜiz if i B G I H, λ G i, λh i for all i =,..., J. We present the first-order optimality condition of SOCMPCC in terms of C-stationary conditions in the following result. Definition 6.2 We say that C-SOCMPCC is Clarke calm at a feasible solution z if there exist positive ε and µ such that, for all r, s, α εb, for all z B ε z F C r, s, α, one has fz fz + µ r, s, α, where F C r, s, α := { z hz + r =, gz + s, G i z Π Ki Gi z H i z + α i =, i =,..., J }. Theorem 6. Let z be a local optimal solution of SOCMPCC. Suppose that the problem C-SOCMPCC is Clarke calm at z. Then z is a C-stationary point of SOCMPCC. Proof. Since the problem is calm, by the Clarke nonsmooth KKT condition [4, Proposition 6.4.4], there exist λ h R q, λ g R p and β i R m i i =,..., J such that c z Lz, λ h, λ g, β, λ g and λ g, gz =, 6 where c z denotes the Clarke generalized gradient with respect to z and Lz, λ h, λ g, β := fz + λ h, hz + λ g, gz + Consider the Clarke generalized gradient of the nonsmooth function J β i, G i z Π Ki Gi z H i z. S i z := β i, Π Ki Gi z H i z.

15 SOCMPCC 5 Applying the Jacobian chain rule [4, Theorem 2.6.6] twice yields c S i z β T i c Π Ki Gi z H i z J G i z J H i z. Therefore, since any element of the Clarke generalized gradient of the metric projection operator to a closed convex set is self-adjoint see e.g., [, Proposition a], we know from 6 that there exists A i c Π Ki Gi z H i z such that fz + hz λ h + gz λ g + J G i z β i J Gi z H i z A i β i =. 7 Define λ G i := β i A i β i and λ H i := A i β i. Then it follows from 6 and 7 that = fz + hz λ h + gz λ g + λ g, λ g, gz =. J G i z λ G i + J H i z λ H i, We now continue to show that 5 holds. Notice that for i I G I + H I+ G I H B G B H, Π Ki is continuously differentiable at G i z H i z. Hence A i = J Π Ki Gi z H i z. Since [ ] λ H i = A i β i = A i I i A i β i + A i β i = A i λ G i + λ H i, where I i denotes the m i -dimensional identity matrix, it follows that λ H i = D Π Ki Gi z H i z λ G i λ H i. Hence λ G i, λh i N Ωi G i z, H i z by [25, Proposition 2.] for i I G I + H I+ G I H B G B H. Using the formula of regular normal cone given in Proposition 2.3 yields λ G i R m i, λ H i = if i I G I + H, λ G i =, λ H i R m i if i I + G I H, λ G i G i z, λ H i H i z, G i z ˆλ G i + H i z λh i RG i z if i B G B H, which implies that 5 holds. Now consider the case where i I G B H. In this case G i z H i z = H i z bdk i \ {} and hence by [4, Lemma iii] we have A i co B Π Ki Gi z H i z { } = co O, 2 H i z 2 Ĥ i z Ĥiz T, which from λ H i = A i β i implies λ H i RĤix. In the case where i B G I H, G i z H i z = G i z bdk i \ {} and hence by [4, Lemma ii] we have A i co B Π Ki Gi z H i z { } = co I, I 2 G i z 2 Ĝ i z Ĝiz T. It follows from λ G i = I i A i β i that λ G i RĜiz. Moreover, from [, Proposition c], we know that A i β i, β i A i β i, which implies λ G i, λ H i for all i =,..., J. The proof of the theorem is complete.

16 SOCMPCC 6 7 Connections between various stationary points In this section, we discuss the relationships among various stationary points and the Clarke calmness conditions for various reformulations given in the previous sections. First, we give the following result. Proposition 7. Let x, y Ω with Ω being the m-dimensional second-order cone complementarity set. Then N K x + R + y, N K y + R + x = R m, if x =, y intk;, R m if x intk, y = ; Rˆx, Rŷ if x, y bdk\{}, x T y = ; K + R + y, R ŷ if x =, y bdk\{}; R ˆx, K + R + x if x bdk\{}, y = ; K, K if x =, y =, 8 and N K x + R + y, N K y + R + x N Ω x, y. 9 Proof. We will prove 8 and 9 simultaneously. Consider the following cases. Let x = and y intk. For any z R m, since y intk, there exists t > such that y tz K. Hence z K+y t K + R + y. Because z R m is arbitrary, we have K + R + y = R m. Thus N K x + R + y, N K y + R + x = K + R + y, = R m, = N Ω x, y. Let x intk and y =. Then similar to the above case we can show that N K x + R + y, N K y + R + x =, K + R + x =, R m = N Ω x, y. Let x, y bdk\{} and x T y =. It follows from Proposition 2.2 that y R +ˆx and x R + ŷ. Note that N K x = R ˆx and N K y = R ŷ. This implies NK x + R + y, N K y + R + x = R ˆx + R +ˆx, R ŷ + R + ŷ = Rˆx, Rŷ, since R = R + R +. For u, v Rˆx, Rŷ, we have u x, v y, and x û + y v Rx due to ŷ R + x. Comparing the formula given in and Proposition 2.3 yields NK x + R + y, N K y + R + x N Ω x, y. Let x = and y bdk\{}, then by Proposition 2.3 we have NK x + R + y, N K y + R + x = K + R + y, R ŷ N Ω x, y, since w + βy, ŷ = w, ŷ for all w K and β R +.

17 SOCMPCC 7 Let x bdk\{} and y =. Similarly as the above case we can show that N K x + R + y, N K y + R + x = R ˆx, K + R + x N Ω x, y. Let x, y =,. Then by Proposition 2.3 we have N K x + R + y, N K y + R + x = K, K = N Ω x, y. Comparing Proposition 7. and 3 leads to the following expression of the K-stationary condition immediately. Corollary 7. A feasible solution z is a K-stationary point of SOCMPCC if and only if there exist a multiplier λ g, λ h, λ G, λ H such that fz + gz λ g + hz λ h + J G i z λ G i + J H i z λ H i =, λ g, gz T λ g =, λ G i, λh i N Ki G i z + R + H i z, N Ki H i z + R + G i z, i =,..., J. In the following proposition we show that 9 becomes an equality when the dimension of K is less or equal to 2. Proposition 7.2 If K is the m-dimensional second-order cone with m 2, then for x, y Ω, N K x + R + y, N K y + R + x = N Ω x, y. Proof. If m =, then the possible cases are x =, y intk or x intk, y = or x = y =. In these three cases, according to 8 and the formula of the regular normal cone given in Proposition 2.3 we have N K x + R + y, N K y + R + x = N Ω x, y. If m = 2, according to the proof of Proposition 7. it only needs to show N K x + R + y, N K y + R + x N Ω x, y for x, y bdk\{} or x =, y bdk\{} or x bdk\{}, y =. Let x, y bdk\{}. Take u, v N Ω x, y. Then it follows from u x and v y that u Rˆx, v Rŷ. Since N K x + R + y, N K y + R + x = Rˆx, Rŷ by, then N K x + R + y, N K y + R + x N Ω x, y. Let x = and y bdk\{}. According to Proposition 2.3 and, it suffices to show that ŷ K + R + y. Let u ŷ, i.e., u y u 2 y 2. Since y = y 2 due to the assumption that y bdk\{}, consider the following two cases. If y = y 2, then u u 2. Let t > be sufficiently large so that ty u 2. Then ty u ty u 2 = ty u 2 = ty 2 u 2. It means ty u K, i.e., u K + R + y. If y = y 2, then u + u 2. Let t > be sufficiently large so that ty + u 2. Then ty u ty + u 2 = ty + u 2 = ty 2 + u 2 = ty 2 u 2. Hence ty u K, i.e., u K + R + y. In both cases, we have shown that ŷ K + R + y.

18 SOCMPCC 8 Let x bdk\{} and y =. The proof is similar to the above case. The following result follows from Propositions 7., 7.2 and Corollary 7.. Corollary 7.2 A K-stationary point is an S-stationary point. Moreover if the dimension of every K i is less or equal to 2, then an S-stationary point is a K-stationary point. It is well known that the KKT conditions and the S-stationary conditions are equivalent for MPCC. However, for SOCMPCC, according to Corollary 7.2 and Example 7. below, this equivalence holds only for the case where all m i 2 but may fail to hold as m i 3 for some i,..., J. Since the S-stationary point is defined in terms of the regular normal cone and the M-stationary point is defined in terms of the limiting normal cone, it is obvious that an S-stationary point must be an M-stationary point. However, unlike MPCC, it is not so easy to see that an M-stationary point must be an C-stationary point. We now verify this implication. Theorem 7. An M-stationary point must be a C-stationary point. Proof. It suffices to show that for every u, v N Ω x, y, one has u, v. The cases where x =, y intk or x intk, y = or x =, y bdk\{} or x bdk\{}, y = are clear. It suffices to prove for the cases where x, y bdk\{} and where x = y =. Let x, y bdk\{}. Then by Proposition 2.4, x û + y v = βx for some β R and u x. Since y = y 2, it follows that v = βx x û y. Hence u, v = y u, βx x û = x y u, û = x y u 2 u 2 2, where the last inequality follows from the fact that u u 2 since u = x T 2 u 2 due to x u. Now consider the case where x = y =. In this case, it only needs to consider the case where there exists α [, ], β R and ξ C such that αû+ αv = βξ, u ξ, v ˆξ. If α =, then v = βξ and hence u v. If α =, then û = βξ, i.e., u = β ˆξ, which in turn implies u v. If α,, then αû + αv = βξ implies that v = βξ αû α. Hence u, v = α α u, βξ αû = u, û = α α α u2 u 2 2, where the last inequality follows from the fact that u ξ and ξ =, w with w =. We can now summarize the relation between various stationary points as follows. K stationary point = S stationary point = M stationary point = C stationary point = W stationary point. The following examples show that the reverse relationships between various stationary points may not hold in general. In all examples, we use the notation K m to denote the mth dimensional second-order cone. Example 7. S-stationary but not K-stationary Consider the following SOCMPCC:

19 SOCMPCC 9 min fz := z 2 + z 2 2 z 3 s.t. gz := z3 2, z + Gz := z 2 + K 3, Hz := Gz Hz. z 3 z z 2 z 3 K 3, It is obvious that the optimal solution is z =,,. The index sets except I g z, B G z, I H z are all empty. Hence the S-stationary condition is fz + gz λ g + Gz λ G + Hz λ H =, λ g, gz T λ g =, λ G R Ĝz, λ H, Ĝz, 2 and the K-stationary condition is fz + gz λ g + Gz λ G + Hz λ H =, λ g, gz T λ g =, λ G R Ĝz, λ H K 3 + R + Gz. 3 Take λ G =,,, λ H =,,. Then the first condition in the S-stationary condition 2 holds: = +λ H + λ g + λ H 2 + λ G + λ H 3 + λ G 2 + λ G 3 Moreover λ G =,, R Ĝz and λ H, Ĝz = and so the third condition in the S-stationary condition 2 holds. However z is not a K-stationary point. In fact, let λ G R Ĝz, i.e., λ G = λ G, λg 2, λg 3 = t,, for some t, then λh = λ H, λh 2, λh 3 = t, t, by the first condition in the K-stationary condition 3. But λ H +ηgz = t, t, +η,, / K 3 for all η, which means λ H / K 3 +R + Gz. Hence z is not a K-stationary point. This example demonstrates that the K-stationary point and S-stationary point may be different when the dimension of one of the second-order cones is more than 2. Example 7.2 M-stationary but not S-stationary Consider the following SOCMPCC:.

20 SOCMPCC 2 min fz := z + z2 2 z + s.t. Gz := K 2, z 2 + z Hz := K 2, z 2 Gz Hz. The optimal solution is z =,. The index sets except B G z, I H z are all empty. Hence the M-stationary condition is fz + Gz λ G + Hz λ H =, λ G =, λ H R 2 or λ G RĜz, λ H Ĝz or λ G R Ĝz, λ H, Ĝz, and the S-stationary condition is { fz + Gz λ G + Hz λ H =, λ G R Ĝz, λ H, Ĝz. Since G, H are affine and m = 2, z must be an M-stationary point by Theorem 5.2. In fact, let λ G = /2, /2 and λ H = /2, /2. Then the first condition in the M-stationary condition 4 holds: = + λ G + λ G 2 + λ H and the second condition in the M-stationary condition 4 holds: + λ H 2 λ G = /2, /2 RĜz and λ H = /2, /2 Ĝz. Hence the M-stationary condition holds. However, z is not an S-stationary point. If λ G, λ H satisfies 5 with λ G R, and λ H,,, then λ G + λh =, λ G 2 + λh 2 =, λg = λg 2 and λh λh 2. So λg = λh λh 2 = + λg 2 = λg. This implies λ G /2, which contradicts with λg. Example 7.3 C-stationary but not M-stationary Consider the following SOCMPCC: 4 5 min fz := z + z 2 z 3 z + s.t. Gz := z + z 2 z 3 K 3, Hz := Gz Hz. z z z z 2 3 z 2 K 3,

21 SOCMPCC 2 We can show that the only feasible solution is,, and hence it is also the unique optimal solution. Indeed, since Hz = z, z z3 2, z 2 K 3, by definition of the second order cone we have z z + z z 2 2 which implies that z and z 2 z + z z 2 2 z + z Hence we obtain z 3 =. Plugging z 3 = in 6, we obtain z 2 =. Similarly from Gz = z +, z + z 2 z 3, z K 3 and z 3 =, we obtain z =. The index sets except B G z, I H z are all empty. Hence the C-stationary condition is { fz + Gz λ G + Hz λ H =, λ G RĜz, λ G, λ H 7, and the M-stationary condition is fz + Gz λ G + Hz λ H =, λ G =, λ H R 3 or λ G RĜz, λ H Ĝz or λ G R Ĝz, λ H, Ĝz. Take λ G =,, and λ H = 2,,. Then the first condition in the C-stationary condition 7 holds: = + λ G + λ G 2 + λ G 3 +λ H + λ H 2 + λ H 3 8 and λ G = Ĝz RĜz, λ G, λ H = λ H λh 2 = >. So z is a C-stationary point. However z is not an M-stationary point. Indeed, from 8, it is clear that λ G must be nonzero. For λ G RĜz = t,, for some t R, then it follows from 8 that t = and λ H λh 2 =. Thus λg R + Ĝz but λ H, Ĝz. So z is not an M-stationary point. Example 7.4 W-stationary but not C-stationary Consider the following SOCMPCC: min fz := z + z2 2 z 3 z + z 2 s.t. Gz := z + z 2 + z 3 K 3, Hz := Gz Hz. z z 3 z z 2 z 2 K 3,

22 SOCMPCC 22 We can show that the feasible region is {z = z, z 2, z 3 z =, z 2 =, z 3 }. Indeed, from Hz K 3, we have z and z 2 z + z z 2 2 z + z 2 2. Hence z = and z 2 =. Then Hz =,, and Gz =, + z 3, z 3 K 3 which implies z 3 [, ]. Hence the optimal solution is z =,,. The index sets except B G z, I H z are all empty. Hence the W-stationary condition is fz + Gz λ G + Hz λ H =, 9 and the C-stationary condition is { fz + Gz λ G + Hz λ H =, λ G RĜz, λ G, λ H. Let λ G =,, and λ H = 2,, 2 or λ G =,, and λ H =,, 3. Then the W-stationary condition 9 holds: = 2 + λ G + λ G 2 + λ G 3 +λ H + λ H 2 + λ H 3. 2 However z is not a C-stationary point. Indeed, for λ G RĜz, i.e., λ G = t,, for some t R, it then follows from 2 that t =, λ H λh 2 = >, and λh 3 = 2. Thus λ G, λ H = tλ H λh 2 = <. Hence z is not a C-stationary point. To study the relationship between the Clarke calmness conditions for the various reformulations we consider the following general optimization problem with cone complementarity constraints. P min fz s.t. K Gz Hz K, where K is a convex symmetric cone of a finite dimensional space X and G, H are continuous. For simplicity we omit the standard inequality and equality constraints. Let t R and α, β X. Consider the following perturbed feasible regions of P. F K t, α, β := {z X Gz, Hz + t, Gz, Hz + α, β K K} F M α, β := {z X Gz, Hz + α, β Ω} F C α := {z X Gz Π K Gz Hz + α = }. Proposition 7.3 Let z be a feasible solution of problem P. a Suppose that there exist positive ε and µ such that, for all t, α, β ε B, for all z B ε z F K t, α, β, one has fz fz + µ t, α, β, 2 then there exist positive ε 2, µ 2 such that for all α, β ε 2 B, for all z B ε2 z F M α, β, one has fz fz + µ 2 α, β. 22

23 SOCMPCC 23 b Suppose that there exist positive ε and µ such that, for all α, β in ε B, for all z B ε z F M α, β, one has fz fz + µ α, β, 23 then for all α ε 2 B, for all z B ε2 z F C α, one has where ε 2 = ε / 2 and µ 2 = 2µ. fz fz + µ 2 α, 24 Proof. a Suppose that z F M α, β, i.e., Gz, Hz + α, β Ω. Then it is easy to verify that Gz, Hz + t M, Gz, Hz + α, β K K with t M := Gz, β + Hz, α + α, β. That is, z F K t M, α, β. Now suppose that there exist positive ε and µ such that, for all t, α, β in ε B and z B ε z F K t, α, β, 2 holds. Then by the continuity of G, H, one can find positive ε 2 < ε and µ 2 such that for all z B ε2 z and α, β in ε 2 B, and t M, α, β = Gz, β + Hz, α + α, β, α, β ε B, µ 2 α, β µ tm, α, β. Combining these and 2 with t = t M ensures that 22 holds. b Suppose that z F C α. Then Gz Π K Gz Hz + α =, which can be rewritten as Gz + α = Π K Gz + α Hz α, i.e., Gz, Hz + α, α Ω. That is, z F M α, α. Now suppose that there exist positive ε and µ such that, for all α, β in ε B, for all z B ε z F M α, β, 23 holds. Let ε 2 = ε / 2 and µ 2 = 2µ. Then for all α ε 2 B and z B ε2 z F C α, we have α, α ε B and hence i.e., 24 holds. fz fz + µ 2 α = fz fz + µ α, α, Definition 7. K-Clarke calmness We say that a feasible solution z of P is K- Clarke calm if there exist positive ε and µ such that, for all t, α, β εb, for all z B ε z F K t, α, β, one has fz fz + µ t, α, β. Definition 7.2 M-Clarke calmness We say that a feasible solution z of P is M- Clarke calm if there exist positive ε and µ such that, for all α, β εb, for all z B ε z F M α, β, one has fz fz + µ α, β. Definition 7.3 C-Clarke calmness We say that a feasible solution z of P is C- Clarke calm if there exist positive ε and µ such that, for all α εb, for all z B ε z F C α, one has fz fz + µ α. According to Proposition 7.3, the following implications hold. Theorem 7.2 K-Clarke calmness = M-Clarke calmness = C-Clarke calmness.

24 SOCMPCC 24 8 New optimality conditions for MPCC via SOCMPCC Consider the vector MPCC: MPCC min fz s.t. hz =, gz, G i z H i z, i =,..., J, where G i z, H i z : R n R. We reformulate MPCC as the associated SOCMPCC: a-socmpcc min fz s.t. hz =, gz, K i G i z H i z K i, i =,..., J, where G i z := G i z,,..., R m i and H i z := G i z,,..., R m i for i =,..., J. Note that the index sets B Gz, B Hz are always empty. For the convenience of the discussion we recall the definition of W-, S-, M- and C-stationary conditions for the problem a-socmpcc. A feasible solution of a-socmpcc is W-stationary point if there exists λ g, λ h, λ G, λ H R p R q R τ R τ such that fz + gz λ g + hz λ h + J G i z λ G i + J H i z λ H i =, λ g, gz T λ g =, λ H i = if i I Gz I + Hz, λ G i = if i I + Gz I Hz. It is an S-, M- and C-stationary point if 25 holds and for all i I Gz I Hz λ G i K i, λ H i K i ; λ G i K i, λ H i K i or λ H i =, λ G i R m i or λ G i =, λ H i R m i or λ G i R ξ i, λ H i ξ i or λ H i R ξ i, λ G i ξ i or λ G i ξ i, λ H i ˆξ i, α iˆ λg i + α i λ H i Rξ i for some α i [, ] and some ξ i C i ; λ G i, λ H i holds respectively. Let us discuss the relationship of the various stationary points between MPCC and its associated SOCMPCC reformulations. Theorem 8. The following statements holds: a If z is an S-stationary point of vector MPCC with λ g, λ h, λ G, λ H R p R q R J R J then z is an S-stationary point of the associated SOCMPCC with λ g, λ h, λ G, λ H R p R q R τ R τ where λ G i = λ G i,,..., Rm i and λ H i = λ H i,,..., Rm i for i =,..., J. Conversely, if z is an S-stationary point of SOCMPCC with λ g, λ h, λ G, λ H R p R q R τ R τ, then z is an S- stationary point of vector MPCC with λ g, λ h, λ G, λ H R p R q R J R J where λ G i = λ G i and λ H i = λ H i for i =,..., J. 25

25 SOCMPCC 25 b If z is an M-,C-stationary point of vector MPCC with λ g, λ h, λ G, λ H R p R q R J R J, then z is an M-,C-stationary point of the associated SOCMPCC with λ g, λ h, λ G, λ H R p R q R τ R τ where λ G i = λ G i,,..., Rm i and λ H i = λ H i,,..., Rm i for i =,..., J. Proof. Part a. Recall that a point z is said to be an S-stationary point of the MPCC if there exists λ g, λ h, λ G, λ H R p R q R J R J such that Note that Let Then fz + gz λ g + hz λ h + J G i z λ G i λ g, gz T λ g =, λ H i = if i I G z I + H z, λ G i = if i I + G z I H z, λ G i, λ H i, if i I G z I H z. + J H i z λ H i =, I Gz = I G z, I + Gz = I + G z, I Hz = I H z, I + Hz = I + H z. λ G = λ G,..., λ G J with λg i = λ G i,,..., R m i, 26 λ H = λ H,..., λ H J with λh i = λ H i,,..., R m i. 27 G i z λ G i = G i z λ G i and H i z λ H i = H i z λ H i. From λ G i, λ H i, we have λ G i K i, λ H i K i. Thus 26 implies that that z is an S-stationary point of a-socmpcc. Conversely, assume that z is an S-stationary point of the SOCMPCC reformulation, i.e., there exists λ g, λ h, λ G, λ H R p R q R τ R τ such that 25-8 hold. Notice that G i z λ G i = λ G i G i z and H i z λ H i = λ H i H i z. In addition, λ G i K i, λh i K i implies λ G i, λ H i. Hence z is an S- stationary point of MPCC with λ g, λ h, λ G, λ H R p R q R J R J satisfying 26 where λ G i = λ G i and λ H i = λ H i for j =,..., J. Part b. Recall that a point z is said to be an M-stationary point of the vector MPCC if there exists λ, µ, u, v R p R q R J R J such that fz + gz λ g + hz λ h + J G i z λ G i λ g, gz T λ g =, λ H i = if i I G z I + H z, λ G i = if i I + G z I H z, λ G i <, λ H i < or λ G i λh i = if i I G z I H z. + J H i z λ H i =,

First order optimality conditions for mathematical programs with second-order cone complementarity constraints

First order optimality conditions for mathematical programs with second-order cone complementarity constraints First order optimality conditions for mathematical programs with second-order cone complementarity constraints Jane J. Ye and Jinchuan Zhou April 9, 05 Abstract In this paper we consider a mathematical

More information

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

A FRITZ JOHN APPROACH TO FIRST ORDER OPTIMALITY CONDITIONS FOR MATHEMATICAL PROGRAMS WITH EQUILIBRIUM CONSTRAINTS A FRITZ JOHN APPROACH TO FIRST ORDER OPTIMALITY CONDITIONS FOR MATHEMATICAL PROGRAMS WITH EQUILIBRIUM CONSTRAINTS Michael L. Flegel and Christian Kanzow University of Würzburg Institute of Applied Mathematics

More information

First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints

First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints Chao Ding, Defeng Sun and Jane J. Ye November 15, 2010; First revision: May 16, 2012; Second

More information

Necessary optimality conditions for optimal control problems with nonsmooth mixed state and control constraints

Necessary optimality conditions for optimal control problems with nonsmooth mixed state and control constraints Necessary optimality conditions for optimal control problems with nonsmooth mixed state and control constraints An Li and Jane J. Ye Abstract. In this paper we study an optimal control problem with nonsmooth

More information

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

AN ABADIE-TYPE CONSTRAINT QUALIFICATION FOR MATHEMATICAL PROGRAMS WITH EQUILIBRIUM CONSTRAINTS. Michael L. Flegel and Christian Kanzow AN ABADIE-TYPE CONSTRAINT QUALIFICATION FOR MATHEMATICAL PROGRAMS WITH EQUILIBRIUM CONSTRAINTS Michael L. Flegel and Christian Kanzow University of Würzburg Institute of Applied Mathematics and Statistics

More information

Implications of the Constant Rank Constraint Qualification

Implications of the Constant Rank Constraint Qualification Mathematical Programming manuscript No. (will be inserted by the editor) Implications of the Constant Rank Constraint Qualification Shu Lu Received: date / Accepted: date Abstract This paper investigates

More information

First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints

First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints Chao Ding, Defeng Sun and Jane J. Ye November 15, 2010 Abstract In this paper we consider

More information

Mathematical programs with complementarity constraints in Banach spaces

Mathematical programs with complementarity constraints in Banach spaces Mathematical programs with complementarity constraints in Banach spaces Gerd Wachsmuth July 21, 2014 We consider optimization problems in Banach spaces involving a complementarity constraint defined by

More information

Constrained Optimization

Constrained Optimization 1 / 22 Constrained Optimization ME598/494 Lecture Max Yi Ren Department of Mechanical Engineering, Arizona State University March 30, 2015 2 / 22 1. Equality constraints only 1.1 Reduced gradient 1.2 Lagrange

More information

ON A CLASS OF NONSMOOTH COMPOSITE FUNCTIONS

ON A CLASS OF NONSMOOTH COMPOSITE FUNCTIONS MATHEMATICS OF OPERATIONS RESEARCH Vol. 28, No. 4, November 2003, pp. 677 692 Printed in U.S.A. ON A CLASS OF NONSMOOTH COMPOSITE FUNCTIONS ALEXANDER SHAPIRO We discuss in this paper a class of nonsmooth

More information

Optimality Conditions for Constrained Optimization

Optimality Conditions for Constrained Optimization 72 CHAPTER 7 Optimality Conditions for Constrained Optimization 1. First Order Conditions In this section we consider first order optimality conditions for the constrained problem P : minimize f 0 (x)

More information

ON LICQ AND THE UNIQUENESS OF LAGRANGE MULTIPLIERS

ON LICQ AND THE UNIQUENESS OF LAGRANGE MULTIPLIERS ON LICQ AND THE UNIQUENESS OF LAGRANGE MULTIPLIERS GERD WACHSMUTH Abstract. Kyparisis proved in 1985 that a strict version of the Mangasarian- Fromovitz constraint qualification (MFCQ) is equivalent to

More information

Some Properties of the Augmented Lagrangian in Cone Constrained Optimization

Some Properties of the Augmented Lagrangian in Cone Constrained Optimization MATHEMATICS OF OPERATIONS RESEARCH Vol. 29, No. 3, August 2004, pp. 479 491 issn 0364-765X eissn 1526-5471 04 2903 0479 informs doi 10.1287/moor.1040.0103 2004 INFORMS Some Properties of the Augmented

More information

Numerical Optimization

Numerical Optimization Constrained Optimization Computer Science and Automation Indian Institute of Science Bangalore 560 012, India. NPTEL Course on Constrained Optimization Constrained Optimization Problem: min h j (x) 0,

More information

Gerd Wachsmuth. January 22, 2016

Gerd Wachsmuth. January 22, 2016 Strong stationarity for optimization problems with complementarity constraints in absence of polyhedricity With applications to optimization with semidefinite and second-order-cone complementarity constraints

More information

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

FIRST- AND SECOND-ORDER OPTIMALITY CONDITIONS FOR MATHEMATICAL PROGRAMS WITH VANISHING CONSTRAINTS 1. Tim Hoheisel and Christian Kanzow FIRST- AND SECOND-ORDER OPTIMALITY CONDITIONS FOR MATHEMATICAL PROGRAMS WITH VANISHING CONSTRAINTS 1 Tim Hoheisel and Christian Kanzow Dedicated to Jiří Outrata on the occasion of his 60th birthday Preprint

More information

CHARACTERIZATIONS OF LIPSCHITZIAN STABILITY

CHARACTERIZATIONS OF LIPSCHITZIAN STABILITY CHARACTERIZATIONS OF LIPSCHITZIAN STABILITY IN NONLINEAR PROGRAMMING 1 A. L. DONTCHEV Mathematical Reviews, Ann Arbor, MI 48107 and R. T. ROCKAFELLAR Dept. of Math., Univ. of Washington, Seattle, WA 98195

More information

Identifying Active Constraints via Partial Smoothness and Prox-Regularity

Identifying Active Constraints via Partial Smoothness and Prox-Regularity Journal of Convex Analysis Volume 11 (2004), No. 2, 251 266 Identifying Active Constraints via Partial Smoothness and Prox-Regularity W. L. Hare Department of Mathematics, Simon Fraser University, Burnaby,

More information

Preprint ISSN

Preprint ISSN Fakultät für Mathematik und Informatik Preprint 2016-06 Susanne Franke, Patrick Mehlitz, Maria Pilecka Optimality conditions for the simple convex bilevel programming problem in Banach spaces ISSN 1433-9307

More information

A smoothing augmented Lagrangian method for solving simple bilevel programs

A smoothing augmented Lagrangian method for solving simple bilevel programs A smoothing augmented Lagrangian method for solving simple bilevel programs Mengwei Xu and Jane J. Ye Dedicated to Masao Fukushima in honor of his 65th birthday Abstract. In this paper, we design a numerical

More information

Technische Universität Dresden Herausgeber: Der Rektor

Technische Universität Dresden Herausgeber: Der Rektor Als Manuskript gedruckt Technische Universität Dresden Herausgeber: Der Rektor The Gradient of the Squared Residual as Error Bound an Application to Karush-Kuhn-Tucker Systems Andreas Fischer MATH-NM-13-2002

More information

Constrained Optimization Theory

Constrained Optimization Theory Constrained Optimization Theory Stephen J. Wright 1 2 Computer Sciences Department, University of Wisconsin-Madison. IMA, August 2016 Stephen Wright (UW-Madison) Constrained Optimization Theory IMA, August

More information

DUALITY, OPTIMALITY CONDITIONS AND PERTURBATION ANALYSIS

DUALITY, OPTIMALITY CONDITIONS AND PERTURBATION ANALYSIS 1 DUALITY, OPTIMALITY CONDITIONS AND PERTURBATION ANALYSIS Alexander Shapiro 1 School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205, USA, E-mail: ashapiro@isye.gatech.edu

More information

Lectures 9 and 10: Constrained optimization problems and their optimality conditions

Lectures 9 and 10: Constrained optimization problems and their optimality conditions Lectures 9 and 10: Constrained optimization problems and their optimality conditions Coralia Cartis, Mathematical Institute, University of Oxford C6.2/B2: Continuous Optimization Lectures 9 and 10: Constrained

More information

On the Moreau-Yosida regularization of the vector k-norm related functions

On the Moreau-Yosida regularization of the vector k-norm related functions On the Moreau-Yosida regularization of the vector k-norm related functions Bin Wu, Chao Ding, Defeng Sun and Kim-Chuan Toh This version: March 08, 2011 Abstract In this paper, we conduct a thorough study

More information

Introduction to Optimization Techniques. Nonlinear Optimization in Function Spaces

Introduction to Optimization Techniques. Nonlinear Optimization in Function Spaces Introduction to Optimization Techniques Nonlinear Optimization in Function Spaces X : T : Gateaux and Fréchet Differentials Gateaux and Fréchet Differentials a vector space, Y : a normed space transformation

More information

Optimization and Optimal Control in Banach Spaces

Optimization and Optimal Control in Banach Spaces Optimization and Optimal Control in Banach Spaces Bernhard Schmitzer October 19, 2017 1 Convex non-smooth optimization with proximal operators Remark 1.1 (Motivation). Convex optimization: easier to solve,

More information

Constraint qualifications for nonlinear programming

Constraint qualifications for nonlinear programming Constraint qualifications for nonlinear programming Consider the standard nonlinear program min f (x) s.t. g i (x) 0 i = 1,..., m, h j (x) = 0 1 = 1,..., p, (NLP) with continuously differentiable functions

More information

Complementarity Formulations of l 0 -norm Optimization Problems

Complementarity Formulations of l 0 -norm Optimization Problems Complementarity Formulations of l 0 -norm Optimization Problems Mingbin Feng, John E. Mitchell, Jong-Shi Pang, Xin Shen, Andreas Wächter May 17, 2016 Abstract In a number of application areas, it is desirable

More information

Mingbin Feng, John E. Mitchell, Jong-Shi Pang, Xin Shen, Andreas Wächter

Mingbin Feng, John E. Mitchell, Jong-Shi Pang, Xin Shen, Andreas Wächter Complementarity Formulations of l 0 -norm Optimization Problems 1 Mingbin Feng, John E. Mitchell, Jong-Shi Pang, Xin Shen, Andreas Wächter Abstract: In a number of application areas, it is desirable to

More information

Lecture 9 Monotone VIs/CPs Properties of cones and some existence results. October 6, 2008

Lecture 9 Monotone VIs/CPs Properties of cones and some existence results. October 6, 2008 Lecture 9 Monotone VIs/CPs Properties of cones and some existence results October 6, 2008 Outline Properties of cones Existence results for monotone CPs/VIs Polyhedrality of solution sets Game theory:

More information

Complementarity Formulations of l 0 -norm Optimization Problems

Complementarity Formulations of l 0 -norm Optimization Problems Complementarity Formulations of l 0 -norm Optimization Problems Mingbin Feng, John E. Mitchell,Jong-Shi Pang, Xin Shen, Andreas Wächter Original submission: September 23, 2013. Revised January 8, 2015

More information

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

1. Introduction. We consider mathematical programs with equilibrium constraints in the form of complementarity constraints: SOME PROPERTIES OF REGULARIZATION AND PENALIZATION SCHEMES FOR MPECS DANIEL RALPH AND STEPHEN J. WRIGHT Abstract. Some properties of regularized and penalized nonlinear programming formulations of mathematical

More information

Simulation-Based Solution of Stochastic Mathematical Programs with Complementarity Constraints Ilker Birbil, S.; Gurkan, Gul; Listes, O.L.

Simulation-Based Solution of Stochastic Mathematical Programs with Complementarity Constraints Ilker Birbil, S.; Gurkan, Gul; Listes, O.L. Tilburg University Simulation-Based Solution of Stochastic Mathematical Programs with Complementarity Constraints Ilker Birbil, S.; Gurkan, Gul; Listes, O.L. Publication date: 2004 Link to publication

More information

The Relation Between Pseudonormality and Quasiregularity in Constrained Optimization 1

The Relation Between Pseudonormality and Quasiregularity in Constrained Optimization 1 October 2003 The Relation Between Pseudonormality and Quasiregularity in Constrained Optimization 1 by Asuman E. Ozdaglar and Dimitri P. Bertsekas 2 Abstract We consider optimization problems with equality,

More information

TMA 4180 Optimeringsteori KARUSH-KUHN-TUCKER THEOREM

TMA 4180 Optimeringsteori KARUSH-KUHN-TUCKER THEOREM TMA 4180 Optimeringsteori KARUSH-KUHN-TUCKER THEOREM H. E. Krogstad, IMF, Spring 2012 Karush-Kuhn-Tucker (KKT) Theorem is the most central theorem in constrained optimization, and since the proof is scattered

More information

Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty

Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty V. Jeyakumar, G. M. Lee and G. Li Communicated by Sándor Zoltán Németh Abstract This paper deals with convex optimization problems

More information

On smoothness properties of optimal value functions at the boundary of their domain under complete convexity

On smoothness properties of optimal value functions at the boundary of their domain under complete convexity On smoothness properties of optimal value functions at the boundary of their domain under complete convexity Oliver Stein # Nathan Sudermann-Merx June 14, 2013 Abstract This article studies continuity

More information

Semi-infinite programming, duality, discretization and optimality conditions

Semi-infinite programming, duality, discretization and optimality conditions Semi-infinite programming, duality, discretization and optimality conditions Alexander Shapiro School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205,

More information

On solving simple bilevel programs with a nonconvex lower level program

On solving simple bilevel programs with a nonconvex lower level program On solving simple bilevel programs with a nonconvex lower level program Gui-Hua Lin, Mengwei Xu and Jane J. Ye December 2011, Revised September 2012 Abstract. In this paper, we consider a simple bilevel

More information

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

SOME STABILITY RESULTS FOR THE SEMI-AFFINE VARIATIONAL INEQUALITY PROBLEM. 1. Introduction ACTA MATHEMATICA VIETNAMICA 271 Volume 29, Number 3, 2004, pp. 271-280 SOME STABILITY RESULTS FOR THE SEMI-AFFINE VARIATIONAL INEQUALITY PROBLEM NGUYEN NANG TAM Abstract. This paper establishes two theorems

More information

CONSTRAINT QUALIFICATIONS, LAGRANGIAN DUALITY & SADDLE POINT OPTIMALITY CONDITIONS

CONSTRAINT QUALIFICATIONS, LAGRANGIAN DUALITY & SADDLE POINT OPTIMALITY CONDITIONS CONSTRAINT QUALIFICATIONS, LAGRANGIAN DUALITY & SADDLE POINT OPTIMALITY CONDITIONS A Dissertation Submitted For The Award of the Degree of Master of Philosophy in Mathematics Neelam Patel School of Mathematics

More information

INTERIOR-POINT METHODS FOR NONCONVEX NONLINEAR PROGRAMMING: CONVERGENCE ANALYSIS AND COMPUTATIONAL PERFORMANCE

INTERIOR-POINT METHODS FOR NONCONVEX NONLINEAR PROGRAMMING: CONVERGENCE ANALYSIS AND COMPUTATIONAL PERFORMANCE INTERIOR-POINT METHODS FOR NONCONVEX NONLINEAR PROGRAMMING: CONVERGENCE ANALYSIS AND COMPUTATIONAL PERFORMANCE HANDE Y. BENSON, ARUN SEN, AND DAVID F. SHANNO Abstract. In this paper, we present global

More information

UNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems

UNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems UNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems Robert M. Freund February 2016 c 2016 Massachusetts Institute of Technology. All rights reserved. 1 1 Introduction

More information

Optimality, identifiability, and sensitivity

Optimality, identifiability, and sensitivity Noname manuscript No. (will be inserted by the editor) Optimality, identifiability, and sensitivity D. Drusvyatskiy A. S. Lewis Received: date / Accepted: date Abstract Around a solution of an optimization

More information

Nonlinear Programming, Elastic Mode, SQP, MPEC, MPCC, complementarity

Nonlinear Programming, Elastic Mode, SQP, MPEC, MPCC, complementarity Preprint ANL/MCS-P864-1200 ON USING THE ELASTIC MODE IN NONLINEAR PROGRAMMING APPROACHES TO MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS MIHAI ANITESCU Abstract. We investigate the possibility

More information

Date: July 5, Contents

Date: July 5, Contents 2 Lagrange Multipliers Date: July 5, 2001 Contents 2.1. Introduction to Lagrange Multipliers......... p. 2 2.2. Enhanced Fritz John Optimality Conditions...... p. 14 2.3. Informative Lagrange Multipliers...........

More information

Convex Optimization Theory. Chapter 5 Exercises and Solutions: Extended Version

Convex Optimization Theory. Chapter 5 Exercises and Solutions: Extended Version Convex Optimization Theory Chapter 5 Exercises and Solutions: Extended Version Dimitri P. Bertsekas Massachusetts Institute of Technology Athena Scientific, Belmont, Massachusetts http://www.athenasc.com

More information

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

Solving generalized semi-infinite programs by reduction to simpler problems. Solving generalized semi-infinite programs by reduction to simpler problems. G. Still, University of Twente January 20, 2004 Abstract. The paper intends to give a unifying treatment of different approaches

More information

Chapter 2 Convex Analysis

Chapter 2 Convex Analysis Chapter 2 Convex Analysis The theory of nonsmooth analysis is based on convex analysis. Thus, we start this chapter by giving basic concepts and results of convexity (for further readings see also [202,

More information

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

Lecture 1. 1 Conic programming. MA 796S: Convex Optimization and Interior Point Methods October 8, Consider the conic program. min. MA 796S: Convex Optimization and Interior Point Methods October 8, 2007 Lecture 1 Lecturer: Kartik Sivaramakrishnan Scribe: Kartik Sivaramakrishnan 1 Conic programming Consider the conic program min s.t.

More information

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

A sensitivity result for quadratic semidefinite programs with an application to a sequential quadratic semidefinite programming algorithm Volume 31, N. 1, pp. 205 218, 2012 Copyright 2012 SBMAC ISSN 0101-8205 / ISSN 1807-0302 (Online) www.scielo.br/cam A sensitivity result for quadratic semidefinite programs with an application to a sequential

More information

Convergence of Stationary Points of Sample Average Two-Stage Stochastic Programs: A Generalized Equation Approach

Convergence of Stationary Points of Sample Average Two-Stage Stochastic Programs: A Generalized Equation Approach MATHEMATICS OF OPERATIONS RESEARCH Vol. 36, No. 3, August 2011, pp. 568 592 issn 0364-765X eissn 1526-5471 11 3603 0568 doi 10.1287/moor.1110.0506 2011 INFORMS Convergence of Stationary Points of Sample

More information

A strongly polynomial algorithm for linear systems having a binary solution

A strongly polynomial algorithm for linear systems having a binary solution A strongly polynomial algorithm for linear systems having a binary solution Sergei Chubanov Institute of Information Systems at the University of Siegen, Germany e-mail: sergei.chubanov@uni-siegen.de 7th

More information

Lecture 7 Monotonicity. September 21, 2008

Lecture 7 Monotonicity. September 21, 2008 Lecture 7 Monotonicity September 21, 2008 Outline Introduce several monotonicity properties of vector functions Are satisfied immediately by gradient maps of convex functions In a sense, role of monotonicity

More information

Optimality, identifiability, and sensitivity

Optimality, identifiability, and sensitivity Noname manuscript No. (will be inserted by the editor) Optimality, identifiability, and sensitivity D. Drusvyatskiy A. S. Lewis Received: date / Accepted: date Abstract Around a solution of an optimization

More information

Implicit Multifunction Theorems

Implicit Multifunction Theorems Implicit Multifunction Theorems Yuri S. Ledyaev 1 and Qiji J. Zhu 2 Department of Mathematics and Statistics Western Michigan University Kalamazoo, MI 49008 Abstract. We prove a general implicit function

More information

Variational Analysis of the Ky Fan k-norm

Variational Analysis of the Ky Fan k-norm Set-Valued Var. Anal manuscript No. will be inserted by the editor Variational Analysis of the Ky Fan k-norm Chao Ding Received: 0 October 015 / Accepted: 0 July 016 Abstract In this paper, we will study

More information

1. Introduction. Consider the following parametric mathematical program with geometric constraints: s.t. F (x, p) Λ,

1. Introduction. Consider the following parametric mathematical program with geometric constraints: s.t. F (x, p) Λ, SIAM J. OPTIM. Vol. 22, No. 3, pp. 1151 1176 c 2012 Society for Industrial and Applied Mathematics STABILITY ANALYSIS FOR PARAMETRIC MATHEMATICAL PROGRAMS WITH GEOMETRIC CONSTRAINTS AND ITS APPLICATIONS

More information

Characterizations of Solution Sets of Fréchet Differentiable Problems with Quasiconvex Objective Function

Characterizations of Solution Sets of Fréchet Differentiable Problems with Quasiconvex Objective Function Characterizations of Solution Sets of Fréchet Differentiable Problems with Quasiconvex Objective Function arxiv:1805.03847v1 [math.oc] 10 May 2018 Vsevolod I. Ivanov Department of Mathematics, Technical

More information

The limiting normal cone to pointwise defined sets in Lebesgue spaces

The limiting normal cone to pointwise defined sets in Lebesgue spaces The limiting normal cone to pointwise defined sets in Lebesgue spaces Patrick Mehlitz Gerd Wachsmuth February 3, 2017 We consider subsets of Lebesgue spaces which are defined by pointwise constraints.

More information

Franco Giannessi, Giandomenico Mastroeni. Institute of Mathematics University of Verona, Verona, Italy

Franco Giannessi, Giandomenico Mastroeni. Institute of Mathematics University of Verona, Verona, Italy ON THE THEORY OF VECTOR OPTIMIZATION AND VARIATIONAL INEQUALITIES. IMAGE SPACE ANALYSIS AND SEPARATION 1 Franco Giannessi, Giandomenico Mastroeni Department of Mathematics University of Pisa, Pisa, Italy

More information

GENERALIZED CONVEXITY AND OPTIMALITY CONDITIONS IN SCALAR AND VECTOR OPTIMIZATION

GENERALIZED CONVEXITY AND OPTIMALITY CONDITIONS IN SCALAR AND VECTOR OPTIMIZATION Chapter 4 GENERALIZED CONVEXITY AND OPTIMALITY CONDITIONS IN SCALAR AND VECTOR OPTIMIZATION Alberto Cambini Department of Statistics and Applied Mathematics University of Pisa, Via Cosmo Ridolfi 10 56124

More information

Convex Optimization M2

Convex Optimization M2 Convex Optimization M2 Lecture 3 A. d Aspremont. Convex Optimization M2. 1/49 Duality A. d Aspremont. Convex Optimization M2. 2/49 DMs DM par email: dm.daspremont@gmail.com A. d Aspremont. Convex Optimization

More information

Lecture 3. Optimization Problems and Iterative Algorithms

Lecture 3. Optimization Problems and Iterative Algorithms Lecture 3 Optimization Problems and Iterative Algorithms January 13, 2016 This material was jointly developed with Angelia Nedić at UIUC for IE 598ns Outline Special Functions: Linear, Quadratic, Convex

More information

Inequality Constraints

Inequality Constraints Chapter 2 Inequality Constraints 2.1 Optimality Conditions Early in multivariate calculus we learn the significance of differentiability in finding minimizers. In this section we begin our study of the

More information

Perturbation analysis of a class of conic programming problems under Jacobian uniqueness conditions 1

Perturbation analysis of a class of conic programming problems under Jacobian uniqueness conditions 1 Perturbation analysis of a class of conic programming problems under Jacobian uniqueness conditions 1 Ziran Yin 2 Liwei Zhang 3 Abstract. We consider the stability of a class of parameterized conic programming

More information

ON GENERALIZED-CONVEX CONSTRAINED MULTI-OBJECTIVE OPTIMIZATION

ON GENERALIZED-CONVEX CONSTRAINED MULTI-OBJECTIVE OPTIMIZATION ON GENERALIZED-CONVEX CONSTRAINED MULTI-OBJECTIVE OPTIMIZATION CHRISTIAN GÜNTHER AND CHRISTIANE TAMMER Abstract. In this paper, we consider multi-objective optimization problems involving not necessarily

More information

GEOMETRIC APPROACH TO CONVEX SUBDIFFERENTIAL CALCULUS October 10, Dedicated to Franco Giannessi and Diethard Pallaschke with great respect

GEOMETRIC APPROACH TO CONVEX SUBDIFFERENTIAL CALCULUS October 10, Dedicated to Franco Giannessi and Diethard Pallaschke with great respect GEOMETRIC APPROACH TO CONVEX SUBDIFFERENTIAL CALCULUS October 10, 2018 BORIS S. MORDUKHOVICH 1 and NGUYEN MAU NAM 2 Dedicated to Franco Giannessi and Diethard Pallaschke with great respect Abstract. In

More information

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

Lecture 8 Plus properties, merit functions and gap functions. September 28, 2008 Lecture 8 Plus properties, merit functions and gap functions September 28, 2008 Outline Plus-properties and F-uniqueness Equation reformulations of VI/CPs Merit functions Gap merit functions FP-I book:

More information

Stationarity and Regularity of Infinite Collections of Sets. Applications to

Stationarity and Regularity of Infinite Collections of Sets. Applications to J Optim Theory Appl manuscript No. (will be inserted by the editor) Stationarity and Regularity of Infinite Collections of Sets. Applications to Infinitely Constrained Optimization Alexander Y. Kruger

More information

On duality theory of conic linear problems

On duality theory of conic linear problems On duality theory of conic linear problems Alexander Shapiro School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 3332-25, USA e-mail: ashapiro@isye.gatech.edu

More information

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

Structural and Multidisciplinary Optimization. P. Duysinx and P. Tossings Structural and Multidisciplinary Optimization P. Duysinx and P. Tossings 2018-2019 CONTACTS Pierre Duysinx Institut de Mécanique et du Génie Civil (B52/3) Phone number: 04/366.91.94 Email: P.Duysinx@uliege.be

More information

AN AUGMENTED LAGRANGIAN AFFINE SCALING METHOD FOR NONLINEAR PROGRAMMING

AN AUGMENTED LAGRANGIAN AFFINE SCALING METHOD FOR NONLINEAR PROGRAMMING AN AUGMENTED LAGRANGIAN AFFINE SCALING METHOD FOR NONLINEAR PROGRAMMING XIAO WANG AND HONGCHAO ZHANG Abstract. In this paper, we propose an Augmented Lagrangian Affine Scaling (ALAS) algorithm for general

More information

Extreme Abridgment of Boyd and Vandenberghe s Convex Optimization

Extreme Abridgment of Boyd and Vandenberghe s Convex Optimization Extreme Abridgment of Boyd and Vandenberghe s Convex Optimization Compiled by David Rosenberg Abstract Boyd and Vandenberghe s Convex Optimization book is very well-written and a pleasure to read. The

More information

Fakultät für Mathematik und Informatik

Fakultät für Mathematik und Informatik Fakultät für Mathematik und Informatik Preprint 2018-03 Patrick Mehlitz Stationarity conditions and constraint qualifications for mathematical programs with switching constraints ISSN 1433-9307 Patrick

More information

Finite Convergence for Feasible Solution Sequence of Variational Inequality Problems

Finite Convergence for Feasible Solution Sequence of Variational Inequality Problems Mathematical and Computational Applications Article Finite Convergence for Feasible Solution Sequence of Variational Inequality Problems Wenling Zhao *, Ruyu Wang and Hongxiang Zhang School of Science,

More information

Elements of Convex Optimization Theory

Elements of Convex Optimization Theory Elements of Convex Optimization Theory Costis Skiadas August 2015 This is a revised and extended version of Appendix A of Skiadas (2009), providing a self-contained overview of elements of convex optimization

More information

Shiqian Ma, MAT-258A: Numerical Optimization 1. Chapter 4. Subgradient

Shiqian Ma, MAT-258A: Numerical Optimization 1. Chapter 4. Subgradient Shiqian Ma, MAT-258A: Numerical Optimization 1 Chapter 4 Subgradient Shiqian Ma, MAT-258A: Numerical Optimization 2 4.1. Subgradients definition subgradient calculus duality and optimality conditions Shiqian

More information

GENERAL NONCONVEX SPLIT VARIATIONAL INEQUALITY PROBLEMS. Jong Kyu Kim, Salahuddin, and Won Hee Lim

GENERAL NONCONVEX SPLIT VARIATIONAL INEQUALITY PROBLEMS. Jong Kyu Kim, Salahuddin, and Won Hee Lim Korean J. Math. 25 (2017), No. 4, pp. 469 481 https://doi.org/10.11568/kjm.2017.25.4.469 GENERAL NONCONVEX SPLIT VARIATIONAL INEQUALITY PROBLEMS Jong Kyu Kim, Salahuddin, and Won Hee Lim Abstract. In this

More information

Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets

Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets A. L. Dontchev Mathematical Reviews, Ann Arbor, MI 48107 and R. T. Rockafellar Dept. of Math., Univ. of Washington,

More information

PARTIAL SECOND-ORDER SUBDIFFERENTIALS IN VARIATIONAL ANALYSIS AND OPTIMIZATION BORIS S. MORDUKHOVICH 1, NGUYEN MAU NAM 2 and NGUYEN THI YEN NHI 3

PARTIAL SECOND-ORDER SUBDIFFERENTIALS IN VARIATIONAL ANALYSIS AND OPTIMIZATION BORIS S. MORDUKHOVICH 1, NGUYEN MAU NAM 2 and NGUYEN THI YEN NHI 3 PARTIAL SECOND-ORDER SUBDIFFERENTIALS IN VARIATIONAL ANALYSIS AND OPTIMIZATION BORIS S. MORDUKHOVICH 1, NGUYEN MAU NAM 2 and NGUYEN THI YEN NHI 3 Abstract. This paper presents a systematic study of partial

More information

Stochastic Mathematical Programs with Equilibrium Constraints, Modeling and Sample Average Approximation

Stochastic Mathematical Programs with Equilibrium Constraints, Modeling and Sample Average Approximation Stochastic Mathematical Programs with Equilibrium Constraints, Modeling and Sample Average Approximation Alexander Shapiro and Huifu Xu Revised June 24, 2005 Abstract. In this paper, we discuss the sample

More information

Inexact alternating projections on nonconvex sets

Inexact alternating projections on nonconvex sets Inexact alternating projections on nonconvex sets D. Drusvyatskiy A.S. Lewis November 3, 2018 Dedicated to our friend, colleague, and inspiration, Alex Ioffe, on the occasion of his 80th birthday. Abstract

More information

5. Duality. Lagrangian

5. Duality. Lagrangian 5. Duality Convex Optimization Boyd & Vandenberghe Lagrange dual problem weak and strong duality geometric interpretation optimality conditions perturbation and sensitivity analysis examples generalized

More information

On the convexity of piecewise-defined functions

On the convexity of piecewise-defined functions On the convexity of piecewise-defined functions arxiv:1408.3771v1 [math.ca] 16 Aug 2014 Heinz H. Bauschke, Yves Lucet, and Hung M. Phan August 16, 2014 Abstract Functions that are piecewise defined are

More information

DUALIZATION OF SUBGRADIENT CONDITIONS FOR OPTIMALITY

DUALIZATION OF SUBGRADIENT CONDITIONS FOR OPTIMALITY DUALIZATION OF SUBGRADIENT CONDITIONS FOR OPTIMALITY R. T. Rockafellar* Abstract. A basic relationship is derived between generalized subgradients of a given function, possibly nonsmooth and nonconvex,

More information

1 The Observability Canonical Form

1 The Observability Canonical Form NONLINEAR OBSERVERS AND SEPARATION PRINCIPLE 1 The Observability Canonical Form In this Chapter we discuss the design of observers for nonlinear systems modelled by equations of the form ẋ = f(x, u) (1)

More information

Normally admissible stratifications and calculation of normal cones to a finite union of polyhedral sets

Normally admissible stratifications and calculation of normal cones to a finite union of polyhedral sets Set Valued and Variational Analysis manuscript No. (will be inserted by the editor) Normally admissible stratifications and calculation of normal cones to a finite union of polyhedral sets Lukáš Adam Michal

More information

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

Lagrange Duality. Daniel P. Palomar. Hong Kong University of Science and Technology (HKUST) Lagrange Duality Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization Fall 2017-18, HKUST, Hong Kong Outline of Lecture Lagrangian Dual function Dual

More information

Introduction to Real Analysis Alternative Chapter 1

Introduction to Real Analysis Alternative Chapter 1 Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces

More information

Lecture 3: Lagrangian duality and algorithms for the Lagrangian dual problem

Lecture 3: Lagrangian duality and algorithms for the Lagrangian dual problem Lecture 3: Lagrangian duality and algorithms for the Lagrangian dual problem Michael Patriksson 0-0 The Relaxation Theorem 1 Problem: find f := infimum f(x), x subject to x S, (1a) (1b) where f : R n R

More information

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

CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS. W. Erwin Diewert January 31, 2008. 1 ECONOMICS 594: LECTURE NOTES CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS W. Erwin Diewert January 31, 2008. 1. Introduction Many economic problems have the following structure: (i) a linear function

More information

An Integral-type Constraint Qualification for Optimal Control Problems with State Constraints

An Integral-type Constraint Qualification for Optimal Control Problems with State Constraints An Integral-type Constraint Qualification for Optimal Control Problems with State Constraints S. Lopes, F. A. C. C. Fontes and M. d. R. de Pinho Officina Mathematica report, April 4, 27 Abstract Standard

More information

Lecture: Duality of LP, SOCP and SDP

Lecture: Duality of LP, SOCP and SDP 1/33 Lecture: Duality of LP, SOCP and SDP Zaiwen Wen Beijing International Center For Mathematical Research Peking University http://bicmr.pku.edu.cn/~wenzw/bigdata2017.html wenzw@pku.edu.cn Acknowledgement:

More information

I.3. LMI DUALITY. Didier HENRION EECI Graduate School on Control Supélec - Spring 2010

I.3. LMI DUALITY. Didier HENRION EECI Graduate School on Control Supélec - Spring 2010 I.3. LMI DUALITY Didier HENRION henrion@laas.fr EECI Graduate School on Control Supélec - Spring 2010 Primal and dual For primal problem p = inf x g 0 (x) s.t. g i (x) 0 define Lagrangian L(x, z) = g 0

More information

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

A CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE Journal of Applied Analysis Vol. 6, No. 1 (2000), pp. 139 148 A CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE A. W. A. TAHA Received

More information

CONVERGENCE ANALYSIS OF AN INTERIOR-POINT METHOD FOR NONCONVEX NONLINEAR PROGRAMMING

CONVERGENCE ANALYSIS OF AN INTERIOR-POINT METHOD FOR NONCONVEX NONLINEAR PROGRAMMING CONVERGENCE ANALYSIS OF AN INTERIOR-POINT METHOD FOR NONCONVEX NONLINEAR PROGRAMMING HANDE Y. BENSON, ARUN SEN, AND DAVID F. SHANNO Abstract. In this paper, we present global and local convergence results

More information

Dedicated to Michel Théra in honor of his 70th birthday

Dedicated to Michel Théra in honor of his 70th birthday VARIATIONAL GEOMETRIC APPROACH TO GENERALIZED DIFFERENTIAL AND CONJUGATE CALCULI IN CONVEX ANALYSIS B. S. MORDUKHOVICH 1, N. M. NAM 2, R. B. RECTOR 3 and T. TRAN 4. Dedicated to Michel Théra in honor of

More information

OPTIMALITY OF RANDOMIZED TRUNK RESERVATION FOR A PROBLEM WITH MULTIPLE CONSTRAINTS

OPTIMALITY OF RANDOMIZED TRUNK RESERVATION FOR A PROBLEM WITH MULTIPLE CONSTRAINTS OPTIMALITY OF RANDOMIZED TRUNK RESERVATION FOR A PROBLEM WITH MULTIPLE CONSTRAINTS Xiaofei Fan-Orzechowski Department of Applied Mathematics and Statistics State University of New York at Stony Brook Stony

More information