Robust linear semi-in nite programming duality under uncertainty?
|
|
- Erika Parks
- 5 years ago
- Views:
Transcription
1 Mathematical Programming (Series B) manuscript No. (will be inserted by the editor) Robust linear semi-in nite programming duality under uncertainty? Robust linear SIP duality Goberna M.A., Jeyakumar V. 2, Li G. 2, López M.A. Department of Statistics and Operations Research, University of Alicante, 38 Alicante, Spain 2 Department of Applied Mathematics, University of New South Wales, Sydney 252, Australia The date of receipt and acceptance will be inserted by the editor Abstract In this paper, we propose a duality theory for semi-in nite linear programming problems under uncertainty in the constraint functions, the objective function, or both, within the framework of robust optimization. We present robust duality by establishing strong duality between the robust counterpart of an uncertain semi-in nite linear program and the optimistic counterpart of its uncertain Lagrangian dual. We show that robust duality holds whenever a robust moment cone is closed and convex. We then show that the closed-convex robust moment cone condition in the case of constraint-wise uncertainty is in fact necessary and su cient for robust duality in the sense that robust moment cone is closed and convex if and only if robust duality holds for every linear objective function of the program. In the case of uncertain problems with a nely parameterized data uncertainty, we establish that robust duality is easily satis ed under a Slater type constraint quali cation. Consequently, we derive robust forms of the Farkas lemma for systems of uncertain semi-in nite linear inequalities. Key words Robust optimization - semi-in nite linear programming - parameter uncertainty - robust duality - convex programming.? This research was partially supported by ARC Discovery Project DP2 of Australia and by MICINN of Spain, Grant MTM C3-.
2 2 Goberna M.A. et al. Introduction Duality theory has played a key role in the study of semi-in nite programming [3, 5, 6, 22] which traditionally assumes perfect information (that is, accurate values for the input quantities or system parameters), despite the reality that such precise knowledge is rarely available in practice for realworld optimization problems. The data of real-world optimization problems more often than not are uncertain (that is, they are not known exactly at the time of the decision) due to estimation errors, prediction errors or lack of information [3 6]. Robust optimization [2] provides a deterministic framework for studying mathematical programming problems under uncertainty. It is based on a description of uncertainty via sets, as opposed to probability distributions which are generally used in stochastic approaches [7, 24]. A successful treatment of robust optimization approach for linear programming problems as well as convex optimization problems under data uncertainty has been given by Ben-Tal and Nemirovski [3 5], and El Ghaoui [2]. The present work was motivated by the recent development of robust duality theory [, 2] for convex programming problems in the face of data uncertainty. To set the context of this work, consider a standard form of linear semi-in nite programming (SIP) problem in the absence of data uncertainty: (SP ) inf hc; xi s.t. ha t ; xi b t ; 8t 2 T; where T is an arbitrary (possible in nite) index set, c; a t 2 R n, and b t 2 R; t 2 T. The linear SIP problem in the face of data uncertainty in the constraints can be captured by the parameterized model problem (USP ) inf hc; xi s.t. ha t (v t ); xi b t (w t ); 8t 2 T; where a t : V t! R n ; b t : W t! R; V t R q ; W t R q2 ; q ; q 2 2 N: The uncertain set-valued mapping U : T R q ; q = q + q 2 ; is de ned as U t := V t W t for all t 2 T: We represent by u t := (v t ; w t ) 2 V t W t an arbitrary element of U t or a variable ranging on U t : So, gph U = f(t; u t ) : u t 2 U t ; t 2 T g : Throughout the paper, u 2 U means that u is a selection of U; i.e., that u : T! R q and u t 2 U t for all t 2 T (u can be also represented as (u t ) ). In stochastic programming [7,24] each set U t is equipped with a probability distribution and each selection of U determines a scenario for (SP ). As an illustration of the model, consider the uncertain linear SIP problem: inf (x ;x 2)2R 2fx : a t x + a 2 t x 2 b t ; t 2 T g
3 Robust linear semi-in nite programming duality under uncertainty 3 where the data a t ; a 2 t are uncertain, and for each t 2 T := [; ], a t 2 [ 2t; + 2t], a 2 t 2 [=(2 + t); =(2 t)] and b t. Then, this uncertain problem can be captured by our model as inf x s.t. ( + 2vt )x + 2+v 2 t x 2 ; 8t 2 T; where u t = (v t ; v 2 t ; w t ) 2 R 3 is the uncertain parameter and u t 2 U t := V t W t with V t := [ t; t] [ t; t] and W t = fg. In this case, a t (v t ; v 2 t ) = + 2v t ; =(2 + v 2 t ) and b t (w t ). The robust counterpart of (USP ) [,3,5] is (RSP ) inf hc; xi () s.t. ha t (v t ); xi b t (w t ); 8 (t; u t ) 2 gph U: The problem (RSP) is indeed a linear SIP problem. We assume that (RSP ) is a consistent problem with a closed and convex feasible set F := fx : ha t (v t ); xi b t (w t ); 8 (t; u t ) 2 gph Ug 6= ;: Now, for each xed selection u 2 U, the Lagrangian dual of (USP ) is ( ) (DP ) t a t (v t ) = ; sup 2R (T ) + t b t (w t ) : c + where R (T ) + denotes the set of mappings : T! R + (also denoted by ( t ) ) such that t = except for nitely many indexes, and sup ; = by convention. The optimistic counterpart [, 2] of the Lagrangian dual of (DP ) is given by ( ) (ODP ) By construction, If inf(rsp ) = sup u=(v t;w t) 2U 2R (T ) + t b t (w t ) : c + inf(rsp ) sup(odp ): t a t (v t ) =, then (ODP ) has no feasible solution, i.e. [ c =2 co conefa t (v t ); t 2 T g; u=(v t;w t) 2U where co conefa t (v t ); t 2 T g denotes the convex cone generated by fa t (v t ); t 2 T g: We say that robust duality holds whenever inf(rsp ) = max(odp ), i.e. ( ) inffhc; xi : x 2 F g = t a t (v t ) = max u=(v t;w t) 2U 2R (T ) + t b t (w t ) : c + :
4 4 Goberna M.A. et al. whenever inf(rsp ) is nite. In this paper, we make the following key contributions: Firstly, we establish that robust duality holds for (USP) whenever the robust moment cone, M := [ u=(v t;w t) 2U co conef(a t (v t ); b t (w t )); t 2 T ; ( n ; )g; is closed and convex. We further show that the closed-convex robust moment cone condition in the case of constraint uncertainty is in fact necessary and su cient for robust duality in the sense that robust moment cone is closed and convex if and only if robust duality holds for every linear objective function of the program. We also derive strong duality between the robust counterpart (RSP) and its standard (or Haar) dual problem [5] in terms of a robust characteristic cone, illustrating the link between the Haar dual and the optimistic dual. Secondly, for the important case of a nely parametrized data uncertainty [2], we show that the convexity of the robust moment cone always holds and that it is closed under a robust Slater constraint quali cation together with suitable topological requirements on the index set and the uncertainty set of the problem. Thirdly, we derive robust forms of Farkas lemma [,, 7] for systems of uncertain semi-in nite linear inequalities in terms of the robust moment cone and the robust characteristic cones. Finally, we extend our results to deal with uncertain linear SIP problems where data uncertainty occurs at both objective function and at constraints. The organization of the paper is as follows. Section 2 provides robust duality theorems under geometric conditions in terms of robust moment and characteristic cones. Section 3 shows that these cone conditions are satis ed if and only if robust duality holds for every linear objective function. Section 4 presents robust Farkas lemma for uncertain semi-in nite linear inequalities. Section 5 extends the results to deal with uncertain linear SIP problems where data uncertainty occurs at both objective function and constraints. 2 Robust Duality Let us introduce the necessary notation. We denote by kk and B n the Euclidean norm and the open unit ball in R n : By n we represent the null vector of R n. For a set C R n ; we de ne its convex hull co C and conical hull cone C as co C = f P m i= ic i : i ; P m i= i = ; c i 2 C; m 2 Ng and cone C = S C; respectively. The topological closure of C is cl C: Given h: R n! R [ f+g; such that h 6= +, the epigraph of h is epih := f(x; r) 2 R n+ : h(x) rg
5 Robust linear semi-in nite programming duality under uncertainty 5 and the conjugate function of h is h : R n! R [ f+g such that h (v) := supfhv; xi h(x) j x 2 domhg: The indicator and the support functions of C are denoted respectively by C and C: Let C R n be a convex set and h: C! R: Identifying h with its extension to R n by de ning h (x) := + for any x =2 C; h is called convex when epih is convex, concave when h is convex, and a ne when it is both convex and concave on C: We de ne the robust moment cone of (RSP ) as [ M = co conef(a t (v t ); b t (w t )); t 2 T ; ( n ; )g: (2) u=(v t;w t) 2U The next academic example shows that M can be neither convex nor closed. Example Consider the simple uncertain linear SIP problem (SP ) inf x x 2 s.t. ha t ; xi b t ; 8t 2 T; where T = [; ]; a is uncertain on the set V = f(cos ; sin ) : 2 [; 2] \ Qg (a dense subset of the circle fx : kxk = g) whereas the remaining data are deterministic: b = and (a t ; b t ) = ( 2 ; ) for t 2 ]; ] : This uncertain problem can be modeled as (USP ) inf x x 2 s.t. ha t (v t ); xi b t (w t ); 8t 2 T; with uncertain mapping U such that U = V f g and U t = f(; ; )g for all t 2 ]; ] ; and associated functions a (v ) = v ; a t (v t ) = v t = 2 ; for all t 2 ]; ] ; and b t (w t ) = w t =, for all t 2 [; ]: Observe that there exists a one-to-one correspondence between the selections of U and the elements of V because the unique uncertain constraint is ha ; xi b : So, the robust counterpart and the robust moment cone are and (RSP ) inf x x 2 s.t. hv ; xi ; 8v 2 V ; h 2 ; xi ; 8t 2 ]; ] ; M = S v 2V co conef( v ; ) ; ( 2 ; )g; respectively. Thus M is the union of countable many 2-dimensional convex cones having a common edge on the vertical axis. Obviously, pm is neither p convex nor closed. As F = cl B; the unique optimal solution is 2=2; 2=2 and min(rsp ) = p 2: Concerning the robust dual problem (ODP ); it is inconsistent because (; ) =2 co conefv ; 2 g = R + fv g whichever v 2 V we consider (cos 6= sin for any 2 [; 2]\Q); so that max(odp ) = by convention, i.e., there is an in nite duality gap.
6 6 Goberna M.A. et al. Theorem If the robust moment cone M is closed and convex, then inf(rsp ) = max(odp ): Proof. Let := inf(rsp ) 2 R. It follows that [ha t (v t ); xi b t (w t ); 8 (t; u t ) 2 gph U] ) hc; xi ; (3) where u t = (v t ; w t ): De ne g : R n! R by g(x) = sup f ha t (v t ); xi + b t (w t )g: As g is supremum of a collection of a ne functions, g is convex, F = fx : g(x) g; and (3) is equivalent to g(x) ) hc; xi : Let f(x) := hc; xi + F (x). This implies that f(x) for all x 2 R n. So, we have (see, e.g., [9] and [23]) (; ) 2 epif = cl(epi(hc; :i) + epi F ) Note that [g] = sup (g) and = epi(hc; :i) + epi F = fcg R + + epi F : epi sup f i = cl co i2i (see, e.g., [4, (2.3)]). It follows that! [ epifi i2i (4) epi F = epi sup (g) = cl [ epi(g) A : As g = sup (t;ut)2gph Ufh a t (v t ); xi+b t (w t )g, we have by applying again (4) epi(g) = cl [ [( a t (v t ); b t (w t )) + f n g R + ] A :
7 Robust linear semi-in nite programming duality under uncertainty 7 This gives us that epi F = cl [ epi(g) A 8 9 = cl [ < cl [ = [ (a t (v t ); b t (w t )) + f n g R + ] A A : ; = cl [ [ [ (a t (v t ); b t (w t )) + f n g R + ] A (5) = cl [ [ [(a t (v t ); b t (w t )) + f n g R ] A : On the other hand, Lemma 5. of Appendix shows that [ [ [(a t (v t ); b t (w t )) + f n g R ] A = co M; and hence epi F = cl co M: (6) As M is closed and convex by our assumption, we have epi F = so, (; ) 2 (fcg R + ) M: M, and This implies that there exists bu = (bv t ; bw t ) 2 U and b 2 R (T ) + such that c = b t a t (bv t ) and b t b t ( bw t ): So, we see that P tb t (w t ) max(odp ). Thus the conclusion follows from the weak duality, and we also conclude that (bu; ) b is optimal for (ODP ). Observe that (ODP ) is more easily manageable than the ordinary (or Haar) dual problem of (RSP ): P (DRSP ) sup (gph U) 2R (t;u + t)2gph U (t;u t)b (t;ut)(w (t;ut)) s.t. c + P (7) (t;u t)a (t;ut)(v (t;ut)) = : Now consider the so-called characteristic cone of (RSP ) K = co conef(a t (v t ); b t (w t )); (t; u t ) 2 gph U; (; )g: (8) Then (DRSP ) is equivalent to sup f : (c; ) 2 Kg in the sense that both problems have the same optimal value and are simultaneously solvable or not. It is worth observing that K = co M: In fact, co M K because
8 8 Goberna M.A. et al. M K trivially and K is convex. To show the reverse inclusion, take an arbitrary generator of K di erent of (; ) 2 M; say (a s (v s ); b s (w s )); with (s; u s ) 2 gph U: As (a s (v s ); b s (w s )) 2 co conef(a t (v t ); b t (w t )); t 2 T ; (; )g; we have (a s (v s ); b s (w s )) 2 M: Thus, K co M and so K = co M: From the linear SIP strong duality theorem, inf(rsp ) = max(drsp ) whenever K is closed (see, e.g., [5, Chapter 8]). If M is closed and convex, then K = co M = M is closed and so inf(rsp ) = max(drsp ) = max f : (c; ) 2 Kg = max f : (c; ) 2 Mg = max(odp ): Thus, we have obtained an alternative proof of Theorem appealing to linear SIP machinery. In Example, the characteristic cone K = co n conef( v ; ) ; v 2 V ; (; )g = x 2 R 3 : x 3 < p o x 2 + x2 2 [ cone fv f gg is not closed, (DRSP ) is not solvable and inf(rsp ) = p 2 = sup(drsp ) > sup(odp ) = : (The equality inf(rsp ) = sup(drsp ) comes from [5, Theorem 8.(v)].) 3 Robust Moment Cones: Convexity and Closure We say that (RSP ) satis es the convexity condition if for every t 2 T; a t () is a ne, i.e., a t (v t ) = (a t (v t ); : : : ; a n t (v t )) and each a j t() is an a ne function, j = ; : : : ; n, and b t () is concave. Proposition Let U be convex-valued. Suppose that (RSP ) satis es the convexity condition. Then the robust moment cone M is convex. Proof. Let a ; a 2 2 M and 2 [; ]. Let a := a +( )a 2 and denote a = (z; ) 2 R n R, with a = (z ; ) 2 R n R and a 2 = (z 2 ; 2 ) 2 R n R. Then, there exist u = (vt ; wt ) 2 U; = ( t ) 2 R (T ) +, and such that (z ; ) = t (a t (vt ); b t (wt )) + (; ): Similarly, there exist u 2 = (v 2 t ; w 2 t ) 2 U; 2 = ( 2 t ) 2 R (T ) + and 2 such that (z 2 ; 2 ) = 2 t (a t (v 2 t ); b t (w 2 t )) + (; 2 ):
9 Robust linear semi-in nite programming duality under uncertainty 9 Then, we have z + ( )z 2 = t a t (v t ) + ( ) 2 t a t (v 2 t ) and + ( ) 2 = t b t (w t ) + ( ) 2 t b t (w 2 t ) + + ( ) 2 : We associate with t 2 T the scalar t := t + ( ) 2 t and the vector (v t ; w t ) := Then (v t ; w t ) 2 U t and ( (v t ; w t ); if t = ; t t (v t ; w t ) + ( )2 t t (v 2 t ; w 2 t ); if t > : t (v t ; w t ) + ( ) 2 t (v 2 t ; w 2 t ) = t (v t ; w t ): By our convexity assumption, we see that, for each t 2 T, and t a t (v t ) + ( ) 2 t a t (v 2 t ) = t a t (v t ); (9) t b t (w t ) + ( ) 2 t b t (w 2 t ) t b t (w t ): () Then, there will exist such that a = (z; ) = (z ; ) + ( )(z 2 ; 2 ) = (z + ( )z 2 ; + ( ) 2 )! = t a t (v t ); t b t (w t ) + ( n ; + ( ) 2 + ) = t (a t (v t ); b t (w t )) + ( ( ) 2 )( n ; ); and this implies that a = (z; ) 2 M: In particular, the robust moment cone M is convex in the important a nely data parametrization case [2], i.e. U t = f(a t ; b t ) = (a t ; b t ) + q u j t(a j t; b j t) : (u t ; : : : ; u q t ) 2 Z t g; j= where Z t is closed and convex for each t 2 T. In this case, U is convex-valued and the convexity condition holds with b t () being also a ne. It is easy to see from Example that M may not be convex when U is not convex-valued. In fact, in this example, U = V fg is not even connected.
10 Goberna M.A. et al. The set-valued mapping U : T R q ; with (T; d) being a metric space, is said to be (Hausdor ) upper semicontinuous at t 2 T if for any > there exists > such that U s U t + B q 8 s 2 T with d(s; t) : In particular, U is uniformly upper semicontinuous on T if for any > there exists > such that U s U t + B q 8 s; t 2 T with d(s; t) : If, additionally, T is compact, then there exists a nite set ft ; :::; t m g T such that d (t; ft ; :::; t m g) < for all t 2 T: Then, U s S i=;:::;m (U t i + B q ) 8 s 2 T; so that gph U is bounded whenever U is compact-valued, i.e., for each t 2 T, U t is a compact set. We say that (RSP ) satis es the Slater condition when there exists x 2 R n (called Slater point) such that ha t (v t ); x i > b t (w t ) for all (t; u t ) 2 gph U; i.e. when there exists a strict solution of the constraint system of (RSP ): Proposition 2 Suppose that the following three assumptions hold: (i) T is a compact metric space; (ii) U is compact-valued and uniformly upper semicontinuous on T ; (iii) the mapping gph U 3 (t; u t ) 7! (a t (v t ) ; b t (w t )) 2 R n+ () is continuous on gph U; (iv) (RSP ) satis es the Slater condition. Then, the robust moment cone M is closed. Remark (before the proof) (ii) and (iii) conjointly imply that a t (V t ) and b t (W t ) are compact. From now on we shall call (iii) continuity condition. Proof. Let (z k ; r k ) 2 M = [ co conef(a t (v t ); b t (w t )) [ ( n ; ) : t 2 T g; k = ; 2; :::; u2u such that (z k ; r k )! (z; r). Then, for each k, there exists u k u k t = (vt k ; wt k ) 2 U t for all t 2 T, such that 2 U; with (z k ; r k ) 2 co conef(a t (v k t ); b t (w k t )) [ ( n ; ) : t 2 T g: From the Carathéodory theorem, we can nd k i, i = ; : : : ; n + 2, k, ft k ; : : : ; t k n+2g T and (vi k; wk i ) 2 U t, i = ; : : : ; n + 2, such that k i n+2 (z k ; r k ) = k i (a t k i (vi k ); b t k i (wi k )) + k ( n ; ): (2) i= As T is compact, we may assume that t k i! t i 2 T, i = ; : : : ; n + 2.
11 Robust linear semi-in nite programming duality under uncertainty Fix i = ; : : : ; n + 2. Since we are assuming that U is uniformly upper semicontinuous and so, for any >, there exists > such that U t U ti + B q ; for all t such that d(t; t i ) : It follows that d((v k i ; w k i ); U ti )! as k! : Since U ti is compact, we may assume the existence of (v i ; w i ) 2 U ti such that As (RSP ) satis es (iii) (v k i ; w k i )! (v i ; w i ) as k! : (3) (a t k i (v k i ); b t k i (w k i ))! (a ti (v i ); b ti (w i )) as k! : Now, we show that l k := P n+2 i= k i + k is bounded. Granting this, by passing to subsequence if necessary, we may assume that k i! i 2 R + and k! 2 R + ; as each k i and k are non-negative. Then, passing to the limit in (2) we have n+2 (z; r) = i (a ti (v i ); b ti (w i )) + ( n ; ) 2 M: i= Therefore, the robust moment cone M is closed. To show the boundedness of l k, we proceed by the method of contradiction and assume without loss of generality that l k := P n+2 i= k i + k! +: By passing to subsequence if necessary, we may assume that k i l k! i 2 R +, k l k! 2 R + and n+2 i + = : (4) i= Dividing by l k both members of (2) and passing to the limit, we obtain that n+2 ( n ; ) = i (a ti (v i ); b ti (w i )) + ( n ; ): i= So, we have P n+2 i= ia ti (v i ) = n and P n+2 i= ib ti (w i ) = and so, taking a Slater point x ; we have n+2 i (ha ti (v i ); x i b ti (w i )) = : i=
12 2 Goberna M.A. et al. On the other hand, since (v i ; w i ) 2 U ti, assumption (iii) implies that ha ti (v i ); x i b ti (w i ) > for all i = ; : : : ; n + 2. Note that ( ; : : : ; n+2 ) 6= n+2 (otherwise, = P n+2 i= ir i = and so, ( ; : : : ; n+2 ; ) = n+3 which contradicts (4)). This implies that n+2 i (ha ti (v i ); x i b ti (w i )) > : i= This is a contradiction and so, fl k g is a bounded sequence. Example violates assumptions (ii) and (iii) in Proposition 2 because U is neither compact nor convex, U is not upper semicontinuous at ; and the function in () is not continuous. In fact, if we consider the sequence (t k ; u tk ) = (=k; ( 2 ; )) which converges to (; ( 2 ; )); we have (a tk (v tk ) ; b tk (w tk )) = ( 2 ; ) which does not converge to (a (v ) ; b (w )) as v = 2 =2 V : As an immediate consequence of the previous results, we obtain the following su cient condition for robust duality. In the special case when jt j < +, this result collapses to the robust strong duality result for linear programming problems in []. Corollary Suppose that the following assumptions hold: (i) T is a compact metric space; (ii) U is compact-convex-valued and uniformly upper semicontinuous on T ; (iii) (RSP ) satis es the convexity, the continuity and the Slater conditions. Then, the robust duality holds, i.e. inf(rsp ) = max(odp ). Proof. The conclusion follows from Theorem, Proposition, and Proposition 2. We now present an example verifying Corollary. Example 2 Let T = [; ] and consider the following uncertain linear SIP problem: inf x s.t. a t x b t ; t 2 T; where the data a t ; b t are uncertain, a t 2 [ 2t; + 2t] and b t. This uncertain problem can be captured by our model as inf x s.t. a t (v t )x b t (w t ); t 2 T; where (v t ; w t ) are the uncertain parameter, a t (v t ) := + 2v t, v t 2 V t := [ t; t] and b t (w t ) :=. Let U t := V t fg: Then the robust counterpart is inf x s.t. a t (v t )x b t (w t ); 8 (t; u t ) 2 gph U:
13 Robust linear semi-in nite programming duality under uncertainty 3 t : It can be veri ed that the feasible set is [ ; =3] : So, the optimal value of the robust counterpart is. The optimistic counterpart of the dual problem is (ODP ) sup f 2R (T ) + ; u2u + t ( + 2v t ) = g: Let 2 R (T ) + such that = and t = for all t 2 T nfg. Let u = (v; ) 2 U such that v = : Then + P t( + 2v t ) = + ( + 2v ) = P t = : So, max(odp ) = and the robust strong dual- and ity holds. In fact, M = co cone f( 3; ) ; ( ; )g is closed and convex. Finally, one can see that all the conditions in the preceding corollary are satis ed. The following theorem shows that our assumption is indeed a characterization for robust strong duality in the sense that the convexity and closedness of the robust moment cone hold if and only if the robust strong duality holds for each linear objective function of (RSP ). Theorem 2 The following statements are equivalent to each other: (i) For all c 2 R n, ( ) inffhc; xi : x 2 F g = t a t (v t ) = : max 2R (T ) + ; u2u t b t (w t ) : c + (ii) The robust moment cone M is closed and convex. Proof. [(ii) ) (i)] It follows by Theorem. [(i) ) (ii)] We proceed by contradiction and let (c ; r ) 2 (cl co M ) n M: So, (6) implies that ( c ; r ) 2 epi F where F := fx : g(x) g and Thus, we have So, for every x 2 F, It follows that g(x) = sup f F ( c ) r : hc ; xi r : ha t (v t ); xi + b t (w t )g: r inffhc ; xi : ha t (v t ); xi b t (w t ); 8 (t; u t ) 2 gph Ug: Thus, the statement (i) gives that ( r max 2R (T ) + ;u2u t b t (w t ) : c + t a t (v t ) = ) :
14 4 Goberna M.A. et al. and so, there exists 2 R (T ) + and (v t ; w t ) 2 U t for all t 2 T; with c + P ta t (v t ) = and such that r t b t (w t ): This shows that (z ; r ) 2 co conef(a t (v t ); b t (w t )); t 2 T ; (; )g Mg; which constitutes a contradiction. 4 Robust Semi-in nite Farkas Lemma In this Section, as consequences of robust duality results of previous Sections, we derive two forms of robust Farkas lemma for a system of uncertain semi-in nite linear inequalities. Related results may be found in [8, 8 2]. Corollary 2 (Robust Farkas Lemma: Characterization I) The following statements are equivalent to each other: (i) For all c 2 R n, the following statements are equivalent: ) [ha t (v t ); xi b t (w t ); 8 (t; u t ) 2 gph U] ) hc; xi r 2) 9 = ( t ) 2 R (T ) + and (v t ; w t ) 2 U t ; t 2 T; P c + such that ta t (v t ) = and P tb t (w t ) r (ii) The robust moment cone M is closed and convex. Proof. The conclusion follows immediately from Theorem 2. Next we compare the previous results with similar ones involving the characteristic cone K de ned in (8) and the standard dual (DRSP ) introduced in (7) instead of M and (ODP ), respectively. Recall that, the assumptions in Proposition and 2 guarantee that the robust moment cone M is convex and closed (and so, the characteristic cone K is also closed). In the following, we show that the assumptions in Proposition 2 alone ensure that the characteristic cone K is closed. Proposition 3 Under the same assumptions as in Proposition 2, the characteristic cone K is closed and inf(rsp ) = max(drsp ) Proof. We rst prove that the characteristic cone K of the robust linear SIP problem is closed. Condition (ii) in Proposition 2 guarantees the closedness of the index set gph U: In fact, let f(t r ; v r ; w r )g gph U be a sequence such that (t r ; v r ; w r )! (t; v; w) 2 T R q+q2 : Then (v r ; w r ) 2 U tr for all r 2 N; t r! t; and (v r ; w r )! (v; w) : Assume that (t; v; w) =2 gph U; i.e. that (v; w) =2 U t : Since U t is closed, there exists > such that (v; w) =2 U t +B q :
15 Robust linear semi-in nite programming duality under uncertainty 5 Let > be such that U s U t + 2 B q for any s 2 T with d(s; t) : We have d(t r ; t) and d ((v r ; w r ) ; (v; w)) < 2 for su ciently large r; so that (v r ; w r ) 2 U tr U t + 2 B q and (v; w) 2 U t + B q (contradiction). We have also seen that condition (ii) implies the boundedness of gph U; which turns out to be compact. On the other hand, condition (iii) states that the mapping from gph U to R n+ such that (t; u t ) 7! (a t (v t ) ; b t (w t )) is continuous and so, the set f(a t (v t ); b t (w t )); (t; u t ) 2 gph Ug is compact. As we are assuming that the Slater condition holds, K is closed by [5, Theorem 5.3 (ii)]. Finally, the closedness of K and [5, (8.5)-(8.6)] imply inf(rsp ) = max(drsp ): We have seen that, under the assumptions of Proposition 2, the characteristic cone K is closed, and this entails that any Slater point is an interior point of F ([5, Theorem 5.9 (iv)]). Thus, F is full dimensional. Proposition 4 The following statements are equivalent to each other: (i) For all c 2 R n, n P inffhc; xi : x 2 F g = max (gph U) (t;ut)2gph U (t;u t)b (t;ut)(w (t;ut)) : 2R + c + P o (t;u t)a (t;ut)(v (t;ut)) = : (ii) The characteristic cone K is closed. Proof. It is straightforward consequence of [5, Theorem 8.4]. Corollary 3 (Robust Farkas Lemma: Characterization II) The following statements are equivalent to each other: (i) For all c 2 R n, the following statements are equivalent: ) [ha t (v t ); xi b t (w t ); 8 (t; u t ) 2 gph U] ) hc; xi r: (gph U) 2 ) 9 = ( t ) 82 R + >< c + such that >: and P P (t;ut)a (t;ut)(v (t;ut)) = ; (t;ut)b (t;ut)(w (t;ut)) r: (ii) The characteristic cone K is closed. Proof. It is straightforward consequence of Proposition 4. 5 Uncertainty in all the data In this section, we consider linear SIP problems where uncertainty occurs in both objective function and in the constraints. This situation can be modeled as the parameterized linear SIP problem ( ]USP ) inf x2r n hc (v s ) ; xi s.t. ha t (v t ); xi b t (w t ); 8t 2 T; (5)
16 6 Goberna M.A. et al. where the uncertain parameter v s ranges on some set Z R q3 and c : Z! R n. For convenience, we always assume that s =2 T. The problem ( ]USP ) can be equivalently rewritten as inf (x;y)2rn R y s.t. ha t (v t ); xi b t (w t ); 8t 2 T; y hc (v s ) ; xi So, the robust (or pessimistic) counterpart of ( ]USP ) can be formulated as ( ]RSP ) inf (x;y)2rn R y s.t. ha t (v t ); xi b t (w t ); 8 (t; u t ) 2 gph U; y hc (v s ) ; xi ; 8v s 2 Z; (6) (7) whose decision space is R R n : In other words, the robust counterpart ( ]RSP ) is indeed a linear SIP problem with n+ decision variables y; x ; :::; x n and deterministic objective function as follows: ( ]RSP ) inf (x;y)2rn R h(; n ) ; (y; x)i s.t. hea t (v t ); (y; x)i e b t (w t ); 8 (t; u t ) 2 gph e U; (8) where x = (x ; :::; x n ) ; T e := T [fsg (as s =2 T ), q := q +q 2 +q 3 ; U e : T e R q is the extension of U : T R q to T e which results of de ning U e s := Z fg ; and the functions ea t : V t! R n+ and e b t : W t! R are (; c (vs )) ; if t = s; ea t (v t ) := (; a t (v t )) ; otherwise, and e bt (w t ) := ; if t = s; b t (w t ); otherwise. The constraint system of the optimistic counterpart for ( ]RSP ), say (^ODP ), is t + = ; a t (v t ) c (v s ) where v t 2 V t ; t 2 T; v s 2 Z; 2 R (T ) + ; and 2 R + : Eliminating = we get ( ) (^ODP ) sup u2u;v s2z;2r (T ) + t b t (w t ) : c (v s ) + Finally, the robust moment cone of ( ]RSP ) is fm = S co conef(ea t (v t ); e b t (w t )); t 2 T e ; (; )g = u2 e U S u=(v t;w t) 2U v s2z t a t (v t ) = co conef(; a t (v t ); b t (w t )); t 2 T ; (; c (v s ) ; ) ; (; ; )g: :
17 Robust linear semi-in nite programming duality under uncertainty 7 Proposition 5 Suppose that U is convex-valued, that Z is a convex set, and that all the components of c () and of a t (), t 2 T; are a ne whereas the functions b t (); t 2 T; are concave. Then the robust moment cone f M is convex. Proof. By assumption, U e t = U t is convex for all t 2 T and U e s = Z fg is a convex too, so that U e is convex-valued. Moreover, ( ]RSP ) satis es the convexity condition. The conclusion follows from Proposition. It easily follows from Proposition 5 that the robust moment cone f M is convex in the case where the data (a t ; b t ; c) are a ne. Proposition 6 Suppose that the following assumptions hold: (i) T is a compact metric space; (ii) U is compact-valued and uniformly upper semicontinuous on T, and Z is compact; (iii) c : Z! R n is continuous and the mapping from gph U in R n+ such that (t; u t ) 7! (a t (v t ) ; b t (w t )) 2 R n+ is continuous on gph U; (iv) there exists x 2 R n such that ha t (v t ); x i > b t (w t ) for all (t; u t ) 2 gph U: Then, the robust moment cone f M is closed. Proof. By assumption (i), we can take a scalar greater than the diameter of T: We extend the distance d to T e by de ning d (s; t) = d(t; s) = for all t 2 T and d (s; s) = : Obviously, ( T e ; d) is a compact metric space. By assumption (ii), U e is compact-valued since U is compact-valued and eu s = Z fg. Given > ; there exists > such that U t U t + B q for all t ; t 2 T with d(t ; t) < : So, if t ; t 2 T e are such that t 6= s 6= t; we have U e t U e t + B q : Otherwise, d(t ; t) < implies that t = t = s; so that eu t U e t + B q trivially holds. So, U e is uniformly upper semicontinuous on et : By (iii), and by the isolation of s in T e ; the mapping gph e U 3 (t; u t ) 7! (ea t (v t ) ; e b t (w t )) 2 R n+2 is continuous on gph e U: Moreover, (y ; x ) is a Slater point for ( ]RSP ) whenever y > max vs2z hc (v s ) ; x i : The conclusion follows from Proposition 2 applied to ( ]RSP ) and f M: Theorem 3 Suppose that the following assumptions hold: (i) T is a compact metric space; (ii) U is compact-convex-valued and uniformly upper semicontinuous on T; and Z is a compact and convex subset of R q3 ; (iii) c : Z! R n is continuous and the mapping from gph U in R n+ such that (t; u t ) 7! (a t (v t ) ; b t (w t )) 2 R n+ is continuous; (iv) The components of c () and of a t (), t 2 T; are a ne whereas the functions b t (); t 2 T; are concave;
18 8 Goberna M.A. et al. (v) There exists x 2 R n such that ha t (v t ); x i > b t (w t ) for all (t; u t ) 2 gph U: Then, the robust duality holds, i.e. inf( ]RSP ) = max(^odp ): Proof From Proposition 5 and Proposition 6, we see that the robust moment cone ~ M is closed convex. Thus the conclusion follows from Theorem. Uncertainty in the objective function In the particular case of uncertainty in the objective and deterministic constraints, the parameterized associated problem is ( [USP ) inf hc(v s ); xi s.t. ha t ; xi b t ; 8t 2 T; where c : Z! R n ; Z R q3 ; and a t 2 R n ; b t 2 R for all t 2 T, s =2 T: Its robust counterpart is the particular case of ( ]RSP ) in (8) in which eu t = Z fg ; if t = s; ftg ftg ; otherwise, (so that V t = ftg and W t = ftg), (; c (vs )) ; if t = s; ea t (v t ) := (; a t ) ; otherwise, e bt (w t ) := ; if t = s; b t ; otherwise, the robust moment cone is fm = S co conef(; a t ; b t ); t 2 T ; (; c (v s ) ; ) ; (; ; )g; v s2z and nally, the optimistic counterpart is ( (^ODP ) sup v s2z;2r (T ) + t b t : c (v s ) + t a t = As a consequence of Proposition 5 and 6, we obtain robust duality for ( [USP ). Corollary 4 Suppose that the following assumptions hold: (i) T is a compact metric space and the functions t 7! a t and t 7! b t are continuous on T ; (ii) Z is compact and convex, and c : Z! R n is continuous; (iii) all the components of c () are a ne; (iv) there exists x 2 R n such that ha t ; x i > b t for all t 2 T: Then, the robust duality holds, i.e. inf( ]RSP ) = max(^odp ): Proof The conclusion follows from Proposition 4., Proposition 4.2 and Theorem 3. ) :
19 Robust linear semi-in nite programming duality under uncertainty 9 6 Appendix In this Section, we provide a technical lemma which is used in the proof of Theorem. This lemma provides a characterization for the convex hull of the robust moment cone. Lemma Let T be an arbitrary index set, a t : V t! R n ; b t : W t! R; V t R q ; W t R q2, t 2 T and q ; q 2 2 N: Let u t = (v t ; w t ), t 2 T, and let the robust moment cone M be de ned as in (2). Then, we have co M = [ [ (a t (v t ); b t (w t )) + fg ( ; ] A : Proof. [] Let (z; r) 2 [ [ (a t (v t ); b t (w t ))+fg( ; ]. Then, there exists, s 2 T and (v s ; w s ) 2 U s such that (z; r) 2 (a s (v s ); b s (w s )) + fg ( ; ]: So, Letting = b s (w s ) z = a s (v s ) and r b s (w s ): r, this implies that (z; r) = (a s (v s ); b s (w s )) + (; ) [ 2 co conef(a t (v t ); b t (w t )); t 2 T ; (; u=(v t;w t) 2U )g: Thus, the de nition of M gives us that [ [ (a t (v t ); b t (w t )) + fg ( ; ] M; and so, [ [ (a t (v t ); b t (w t )) + fg ( ; ] A co M: [] Let (z; r) 2 M. Then, there exists u = (v t ; w t ) 2 gph U such that (z; r) 2 co conef(a t (v t ); b t (w t )); t 2 T ; (; )g: Note that conef(a t (v t ); b t (w t )) [ (; ) : t 2 T g [ [ (a t (v t ); b t (w t )) + fg ( ; ] :
20 2 Goberna M.A. et al. This gives us that (z; r) 2 [ Thus, we have M [ and so, co M [ [ [ [ (a t (v t ); b t (w t )) + fg ( (a t (v t ); b t (w t )) + fg ( (a t (v t ); b t (w t )) + fg ( ; ] A : ; ] A : ; ] A : References. Beck, A., Ben-Tal, A.: Duality in robust optimization: Primal worst equals dual best. Operations Research Letters 37, -6 (29) 2. Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton Series in Applied Mathematics, Princeton (29) 3. Ben-Tal, A., Boyd, S., Nemirovski, A.: Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems. Math. Program. 7, (26) 4. Ben-Tal, A., Nemirovski, A.: Robust solutions of linear programming problems contaminated with uncertain data. Math. Program. 88, (2) 5. Ben-Tal, A.,Nemirovski, A.: Selected topics in robust convex optimization. Math. Program. 2B, (28) 6. Bertsimas, D., BrownD.: Constructing uncertainty sets for robust linear optimization. Oper. Res. 57, (29) 7. Birge, J.R., Louveaux, F.: Stochastic Programming. Springer, Berlin (997) 8. B ot, R.I., Wanka, G.: An alternative formulation for a new closed cone constraint quali cation. Nonlinear Anal. 64, (26) 9. Burachik, R.S., Jeyakumar, V.: A new geometric condition for Fenchel s duality in in nite dimensional spaces. Math. Program. 4B, (25).. Dinh, N., Goberna, M.A., López, M.A.: From linear to convex systems: consistency, Farkas lemma and applications. J. Convex Anal. 3, (26). Dinh, N., Goberna, M.A.. López, M.A., Son, T.Q.: New Farkas-type constraint quali cations in convex in nite programming. ESAIM: Control Optim. Cal. Var. 3, (27) 2. El Ghaoui, L., Lebret, H.: Robust solutions to least-squares problems with uncertain data. SIAM J. Matrix Anal. Appl. 8, (997) 3. Goberna, M.A.: Linear semi-in nite optimization: recent advances. In: Jeyakumar, V., Rubinov, A.M. (eds.) Continuous Optimization, pp Springer, NewYork (25)
21 Robust linear semi-in nite programming duality under uncertainty 2 4. Goberna, M.A., Jeyakumar, V., López, M.A.: Necessary and su cient constraint quali cations for solvability of systems of in nite convex inequalities. Nonlinear Anal. 68, (28). 5. Goberna, M.A., López, M.A.: Linear Semi-in nite Optimization. J. Wiley, Chichester (998) 6. Jeroslow, R.G.: Uniform duality in semi-in nite convex optimization. Math. Program. 27, (983) 7. Jeyakumar, V.: Farkas Lemma: Generalizations. In: Floudas, C.A. Pardalos, P.M. (eds.) Encyclopedia of Optimization, Vol.2, pp Kluwer, Boston (2) 8. Jeyakumar, V., Lee, G.M.: Complete characterizations of stable Farkas lemma and cone-convex programming duality. Math. Program. 4, (28) 9. Jeyakumar, V., Li, G.: Characterizing robust set containments and solutions of uncertain linear programs without quali cations. Oper. Res. Lett. 38, (2) 2. Jeyakumar, V., Li, G.: Robust Farkas lemma for uncertain linear systems with applications. Positivity, in press. DOI:.7/s Jeyakumar, V., Li, G.: Strong duality in robust convex programming: complete characterizations. SIAM J. Optim. 2, (2) 22. Jeyakumar, V., Wolkowicz, H.: Generalizations of Slater s constraint quali - cation for in nite convex programs. Math. Program. 57B, 85 (992) 23. Li, G., Ng, K.F.: On extension of Fenchel duality and its application. SIAM J. Optim. 9, (28). 24. Shapiro, A., Dentcheva, D., Ruszczynski, A.: Lectures on Stochastic Programming: Modeling and Theory. SIAM, Philadelphia (29)
Robust Farkas Lemma for Uncertain Linear Systems with Applications
Robust Farkas Lemma for Uncertain Linear Systems with Applications V. Jeyakumar and G. Li Revised Version: July 8, 2010 Abstract We present a robust Farkas lemma, which provides a new generalization of
More informationStrong Duality in Robust Semi-Definite Linear Programming under Data Uncertainty
Strong Duality in Robust Semi-Definite Linear Programming under Data Uncertainty V. Jeyakumar and G. Y. Li March 1, 2012 Abstract This paper develops the deterministic approach to duality for semi-definite
More informationRobust Solutions to Multi-Objective Linear Programs with Uncertain Data
Robust Solutions to Multi-Objective Linear Programs with Uncertain Data M.A. Goberna yz V. Jeyakumar x G. Li x J. Vicente-Pérez x Revised Version: October 1, 2014 Abstract In this paper we examine multi-objective
More informationA Robust von Neumann Minimax Theorem for Zero-Sum Games under Bounded Payoff Uncertainty
A Robust von Neumann Minimax Theorem for Zero-Sum Games under Bounded Payoff Uncertainty V. Jeyakumar, G.Y. Li and G. M. Lee Revised Version: January 20, 2011 Abstract The celebrated von Neumann minimax
More informationRobust Duality in Parametric Convex Optimization
Robust Duality in Parametric Convex Optimization R.I. Boţ V. Jeyakumar G.Y. Li Revised Version: June 20, 2012 Abstract Modelling of convex optimization in the face of data uncertainty often gives rise
More informationSome Contributions to Convex Infinite-Dimensional Optimization Duality
Some Contributions to Convex Infinite-Dimensional Optimization Duality Marco A. López Alicante University King s College London Strand Campus June 2014 Introduction Consider the convex infinite programming
More information1. Introduction. Consider the deterministic multi-objective linear semi-infinite program of the form (P ) V-min c (1.1)
ROBUST SOLUTIONS OF MULTI-OBJECTIVE LINEAR SEMI-INFINITE PROGRAMS UNDER CONSTRAINT DATA UNCERTAINTY M.A. GOBERNA, V. JEYAKUMAR, G. LI, AND J. VICENTE-PÉREZ Abstract. The multi-objective optimization model
More informationCONVEX OPTIMIZATION VIA LINEARIZATION. Miguel A. Goberna. Universidad de Alicante. Iberian Conference on Optimization Coimbra, November, 2006
CONVEX OPTIMIZATION VIA LINEARIZATION Miguel A. Goberna Universidad de Alicante Iberian Conference on Optimization Coimbra, 16-18 November, 2006 Notation X denotes a l.c. Hausdorff t.v.s and X its topological
More informationSTABLE AND TOTAL FENCHEL DUALITY FOR CONVEX OPTIMIZATION PROBLEMS IN LOCALLY CONVEX SPACES
STABLE AND TOTAL FENCHEL DUALITY FOR CONVEX OPTIMIZATION PROBLEMS IN LOCALLY CONVEX SPACES CHONG LI, DONGHUI FANG, GENARO LÓPEZ, AND MARCO A. LÓPEZ Abstract. We consider the optimization problem (P A )
More informationRobust linear optimization under general norms
Operations Research Letters 3 (004) 50 56 Operations Research Letters www.elsevier.com/locate/dsw Robust linear optimization under general norms Dimitris Bertsimas a; ;, Dessislava Pachamanova b, Melvyn
More informationExact SDP Relaxations for Classes of Nonlinear Semidefinite Programming Problems
Exact SDP Relaxations for Classes of Nonlinear Semidefinite Programming Problems V. Jeyakumar and G. Li Revised Version:August 31, 2012 Abstract An exact semidefinite linear programming (SDP) relaxation
More informationA Note on Nonconvex Minimax Theorem with Separable Homogeneous Polynomials
A Note on Nonconvex Minimax Theorem with Separable Homogeneous Polynomials G. Y. Li Communicated by Harold P. Benson Abstract The minimax theorem for a convex-concave bifunction is a fundamental theorem
More informationDUALITY AND FARKAS-TYPE RESULTS FOR DC INFINITE PROGRAMMING WITH INEQUALITY CONSTRAINTS. Xiang-Kai Sun*, Sheng-Jie Li and Dan Zhao 1.
TAIWANESE JOURNAL OF MATHEMATICS Vol. 17, No. 4, pp. 1227-1244, August 2013 DOI: 10.11650/tjm.17.2013.2675 This paper is available online at http://journal.taiwanmathsoc.org.tw DUALITY AND FARKAS-TYPE
More informationA Dual Condition for the Convex Subdifferential Sum Formula with Applications
Journal of Convex Analysis Volume 12 (2005), No. 2, 279 290 A Dual Condition for the Convex Subdifferential Sum Formula with Applications R. S. Burachik Engenharia de Sistemas e Computacao, COPPE-UFRJ
More informationTopics in Mathematical Economics. Atsushi Kajii Kyoto University
Topics in Mathematical Economics Atsushi Kajii Kyoto University 25 November 2018 2 Contents 1 Preliminary Mathematics 5 1.1 Topology.................................. 5 1.2 Linear Algebra..............................
More informationCharacterizing 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 informationOn Semicontinuity of Convex-valued Multifunctions and Cesari s Property (Q)
On Semicontinuity of Convex-valued Multifunctions and Cesari s Property (Q) Andreas Löhne May 2, 2005 (last update: November 22, 2005) Abstract We investigate two types of semicontinuity for set-valued
More informationTopics in Mathematical Economics. Atsushi Kajii Kyoto University
Topics in Mathematical Economics Atsushi Kajii Kyoto University 26 June 2018 2 Contents 1 Preliminary Mathematics 5 1.1 Topology.................................. 5 1.2 Linear Algebra..............................
More informationSome 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 informationSubdifferential representation of convex functions: refinements and applications
Subdifferential representation of convex functions: refinements and applications Joël Benoist & Aris Daniilidis Abstract Every lower semicontinuous convex function can be represented through its subdifferential
More informationRobust Optimization for Risk Control in Enterprise-wide Optimization
Robust Optimization for Risk Control in Enterprise-wide Optimization Juan Pablo Vielma Department of Industrial Engineering University of Pittsburgh EWO Seminar, 011 Pittsburgh, PA Uncertainty in Optimization
More informationOn Kusuoka Representation of Law Invariant Risk Measures
MATHEMATICS OF OPERATIONS RESEARCH Vol. 38, No. 1, February 213, pp. 142 152 ISSN 364-765X (print) ISSN 1526-5471 (online) http://dx.doi.org/1.1287/moor.112.563 213 INFORMS On Kusuoka Representation of
More informationOperations Research Letters
Operations Research Letters 37 (2009) 1 6 Contents lists available at ScienceDirect Operations Research Letters journal homepage: www.elsevier.com/locate/orl Duality in robust optimization: Primal worst
More informationRobust Solutions to Multi-Objective Linear Programs with Uncertain Data
Robust Solutions to Multi-Objective Linear Programs with Uncertain Data arxiv:1402.3095v1 [math.oc] 13 Feb 2014 M.A. Goberna, V. Jeyakumar, G. Li, and J. Vicente-Pérez December 9, 2013 Abstract In this
More informationOn 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 informationLecture 5. The Dual Cone and Dual Problem
IE 8534 1 Lecture 5. The Dual Cone and Dual Problem IE 8534 2 For a convex cone K, its dual cone is defined as K = {y x, y 0, x K}. The inner-product can be replaced by x T y if the coordinates of the
More informationLECTURE 25: REVIEW/EPILOGUE LECTURE OUTLINE
LECTURE 25: REVIEW/EPILOGUE LECTURE OUTLINE CONVEX ANALYSIS AND DUALITY Basic concepts of convex analysis Basic concepts of convex optimization Geometric duality framework - MC/MC Constrained optimization
More informationOn Linear Systems Containing Strict Inequalities in Reflexive Banach Spaces
Applied Mathematical Sciences, Vol. 3, 2009, no. 43, 2119-2132 On Linear Systems Containing Strict Inequalities in Reflexive Banach Spaces E. Naraghirad Department of Mathematics of Yasouj University Yasouj,
More informationThe Kuhn-Tucker Problem
Natalia Lazzati Mathematics for Economics (Part I) Note 8: Nonlinear Programming - The Kuhn-Tucker Problem Note 8 is based on de la Fuente (2000, Ch. 7) and Simon and Blume (1994, Ch. 18 and 19). The Kuhn-Tucker
More informationTranslative Sets and Functions and their Applications to Risk Measure Theory and Nonlinear Separation
Translative Sets and Functions and their Applications to Risk Measure Theory and Nonlinear Separation Andreas H. Hamel Abstract Recently defined concepts such as nonlinear separation functionals due to
More informationLecture 6: Conic Optimization September 8
IE 598: Big Data Optimization Fall 2016 Lecture 6: Conic Optimization September 8 Lecturer: Niao He Scriber: Juan Xu Overview In this lecture, we finish up our previous discussion on optimality conditions
More informationStability in Linear Optimization: applications
Stability in Linear Optimization: applications Virginia N Vera de Serio Universidad Nacional de Cuyo Argentina ization Problems and Related Topics September 12-16, 2011, Borovets, Bulgaria Outline of the
More informationSemidefinite and Second Order Cone Programming Seminar Fall 2012 Project: Robust Optimization and its Application of Robust Portfolio Optimization
Semidefinite and Second Order Cone Programming Seminar Fall 2012 Project: Robust Optimization and its Application of Robust Portfolio Optimization Instructor: Farid Alizadeh Author: Ai Kagawa 12/12/2012
More informationHandout 8: Dealing with Data Uncertainty
MFE 5100: Optimization 2015 16 First Term Handout 8: Dealing with Data Uncertainty Instructor: Anthony Man Cho So December 1, 2015 1 Introduction Conic linear programming CLP, and in particular, semidefinite
More information1 Selected Homework Solutions
Selected Homework Solutions Mathematics 4600 A. Bathi Kasturiarachi September 2006. Selected Solutions to HW # HW #: (.) 5, 7, 8, 0; (.2):, 2 ; (.4): ; (.5): 3 (.): #0 For each of the following subsets
More informationTrust Region Problems with Linear Inequality Constraints: Exact SDP Relaxation, Global Optimality and Robust Optimization
Trust Region Problems with Linear Inequality Constraints: Exact SDP Relaxation, Global Optimality and Robust Optimization V. Jeyakumar and G. Y. Li Revised Version: September 11, 2013 Abstract The trust-region
More informationConstraint qualifications for convex inequality systems with applications in constrained optimization
Constraint qualifications for convex inequality systems with applications in constrained optimization Chong Li, K. F. Ng and T. K. Pong Abstract. For an inequality system defined by an infinite family
More informationCharacterizations of the solution set for non-essentially quasiconvex programming
Optimization Letters manuscript No. (will be inserted by the editor) Characterizations of the solution set for non-essentially quasiconvex programming Satoshi Suzuki Daishi Kuroiwa Received: date / Accepted:
More informationRobust portfolio selection under norm uncertainty
Wang and Cheng Journal of Inequalities and Applications (2016) 2016:164 DOI 10.1186/s13660-016-1102-4 R E S E A R C H Open Access Robust portfolio selection under norm uncertainty Lei Wang 1 and Xi Cheng
More informationNear convexity, metric convexity, and convexity
Near convexity, metric convexity, and convexity Fred Richman Florida Atlantic University Boca Raton, FL 33431 28 February 2005 Abstract It is shown that a subset of a uniformly convex normed space is nearly
More informationEconomics Bulletin, 2012, Vol. 32 No. 1 pp Introduction. 2. The preliminaries
1. Introduction In this paper we reconsider the problem of axiomatizing scoring rules. Early results on this problem are due to Smith (1973) and Young (1975). They characterized social welfare and social
More informationLecture 8: Basic convex analysis
Lecture 8: Basic convex analysis 1 Convex sets Both convex sets and functions have general importance in economic theory, not only in optimization. Given two points x; y 2 R n and 2 [0; 1]; the weighted
More informationStationarity 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 informationOptimization 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 informationSHORT COMMUNICATION. Communicated by Igor Konnov
On Some Erroneous Statements in the Paper Optimality Conditions for Extended Ky Fan Inequality with Cone and Affine Constraints and Their Applications by A. Capătă SHORT COMMUNICATION R.I. Boţ 1 and E.R.
More informationOn duality gap in linear conic problems
On duality gap in linear conic problems C. Zălinescu Abstract In their paper Duality of linear conic problems A. Shapiro and A. Nemirovski considered two possible properties (A) and (B) for dual linear
More informationCHARACTERIZATION OF (QUASI)CONVEX SET-VALUED MAPS
CHARACTERIZATION OF (QUASI)CONVEX SET-VALUED MAPS Abstract. The aim of this paper is to characterize in terms of classical (quasi)convexity of extended real-valued functions the set-valued maps which are
More informationAW -Convergence and Well-Posedness of Non Convex Functions
Journal of Convex Analysis Volume 10 (2003), No. 2, 351 364 AW -Convergence Well-Posedness of Non Convex Functions Silvia Villa DIMA, Università di Genova, Via Dodecaneso 35, 16146 Genova, Italy villa@dima.unige.it
More informationAn alternative theorem for generalized variational inequalities and solvability of nonlinear quasi-p M -complementarity problems
Applied Mathematics and Computation 109 (2000) 167±182 www.elsevier.nl/locate/amc An alternative theorem for generalized variational inequalities and solvability of nonlinear quasi-p M -complementarity
More informationJae Hyoung Lee. Gue Myung Lee
数理解析研究所講究録第 2011 巻 2016 年 8-16 8 On Approximate Solutions for Robust Convex optimization Problems Jae Hyoung Lee Department of Applied Mathematics Pukyong National University Gue Myung Lee Department of
More informationStability in linear optimization under perturbations of the left-hand side coefficients 1
Stability in linear optimization under perturbations of the left-hand side coefficients 1 A. Daniilidis, M.-A. Goberna, M.A. Lopez, R. Lucchetti Abstract. This paper studies stability properties of linear
More informationA Geometric Framework for Nonconvex Optimization Duality using Augmented Lagrangian Functions
A Geometric Framework for Nonconvex Optimization Duality using Augmented Lagrangian Functions Angelia Nedić and Asuman Ozdaglar April 15, 2006 Abstract We provide a unifying geometric framework for the
More informationInterval solutions for interval algebraic equations
Mathematics and Computers in Simulation 66 (2004) 207 217 Interval solutions for interval algebraic equations B.T. Polyak, S.A. Nazin Institute of Control Sciences, Russian Academy of Sciences, 65 Profsoyuznaya
More informationNonlinear Programming (NLP)
Natalia Lazzati Mathematics for Economics (Part I) Note 6: Nonlinear Programming - Unconstrained Optimization Note 6 is based on de la Fuente (2000, Ch. 7), Madden (1986, Ch. 3 and 5) and Simon and Blume
More informationContents: 1. Minimization. 2. The theorem of Lions-Stampacchia for variational inequalities. 3. Γ -Convergence. 4. Duality mapping.
Minimization Contents: 1. Minimization. 2. The theorem of Lions-Stampacchia for variational inequalities. 3. Γ -Convergence. 4. Duality mapping. 1 Minimization A Topological Result. Let S be a topological
More informationRefined optimality conditions for differences of convex functions
Noname manuscript No. (will be inserted by the editor) Refined optimality conditions for differences of convex functions Tuomo Valkonen the date of receipt and acceptance should be inserted later Abstract
More informationLECTURE 12 UNIT ROOT, WEAK CONVERGENCE, FUNCTIONAL CLT
MARCH 29, 26 LECTURE 2 UNIT ROOT, WEAK CONVERGENCE, FUNCTIONAL CLT (Davidson (2), Chapter 4; Phillips Lectures on Unit Roots, Cointegration and Nonstationarity; White (999), Chapter 7) Unit root processes
More informationOn 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 informationthat a broad class of conic convex polynomial optimization problems, called
JOTA manuscript No. (will be inserted by the editor) Exact Conic Programming Relaxations for a Class of Convex Polynomial Cone-Programs Vaithilingam Jeyakumar Guoyin Li Communicated by Levent Tunçel Abstract
More informationEpiconvergence and ε-subgradients of Convex Functions
Journal of Convex Analysis Volume 1 (1994), No.1, 87 100 Epiconvergence and ε-subgradients of Convex Functions Andrei Verona Department of Mathematics, California State University Los Angeles, CA 90032,
More informationCHAPTER 7. Connectedness
CHAPTER 7 Connectedness 7.1. Connected topological spaces Definition 7.1. A topological space (X, T X ) is said to be connected if there is no continuous surjection f : X {0, 1} where the two point set
More informationLocal strong convexity and local Lipschitz continuity of the gradient of convex functions
Local strong convexity and local Lipschitz continuity of the gradient of convex functions R. Goebel and R.T. Rockafellar May 23, 2007 Abstract. Given a pair of convex conjugate functions f and f, we investigate
More informationZERO DUALITY GAP FOR CONVEX PROGRAMS: A GENERAL RESULT
ZERO DUALITY GAP FOR CONVEX PROGRAMS: A GENERAL RESULT EMIL ERNST AND MICHEL VOLLE Abstract. This article addresses a general criterion providing a zero duality gap for convex programs in the setting of
More informationVictoria Martín-Márquez
A NEW APPROACH FOR THE CONVEX FEASIBILITY PROBLEM VIA MONOTROPIC PROGRAMMING Victoria Martín-Márquez Dep. of Mathematical Analysis University of Seville Spain XIII Encuentro Red de Análisis Funcional y
More informationGlobal Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition
Global Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition Guoyin Li Communicated by X.Q. Yang Abstract In this paper, we establish global optimality
More informationBASICS OF CONVEX ANALYSIS
BASICS OF CONVEX ANALYSIS MARKUS GRASMAIR 1. Main Definitions We start with providing the central definitions of convex functions and convex sets. Definition 1. A function f : R n R + } is called convex,
More informationAn introduction to some aspects of functional analysis
An introduction to some aspects of functional analysis Stephen Semmes Rice University Abstract These informal notes deal with some very basic objects in functional analysis, including norms and seminorms
More informationResearch Article A Note on Optimality Conditions for DC Programs Involving Composite Functions
Abstract and Applied Analysis, Article ID 203467, 6 pages http://dx.doi.org/10.1155/2014/203467 Research Article A Note on Optimality Conditions for DC Programs Involving Composite Functions Xiang-Kai
More informationIntroduction 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 informationA comparison of alternative c-conjugate dual problems in innite convex optimization
A comparison of alternative c-conjugate dual problems in innite convex optimization M.D. Fajardo 1, J. Vidal Department of Mathematics University of Alicante, 03080 Alicante, Spain Abstract In this work
More informationOn the simplest expression of the perturbed Moore Penrose metric generalized inverse
Annals of the University of Bucharest (mathematical series) 4 (LXII) (2013), 433 446 On the simplest expression of the perturbed Moore Penrose metric generalized inverse Jianbing Cao and Yifeng Xue Communicated
More informationAdditional Homework Problems
Additional Homework Problems Robert M. Freund April, 2004 2004 Massachusetts Institute of Technology. 1 2 1 Exercises 1. Let IR n + denote the nonnegative orthant, namely IR + n = {x IR n x j ( ) 0,j =1,...,n}.
More informationExtreme 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 informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationOn Gap Functions for Equilibrium Problems via Fenchel Duality
On Gap Functions for Equilibrium Problems via Fenchel Duality Lkhamsuren Altangerel 1 Radu Ioan Boţ 2 Gert Wanka 3 Abstract: In this paper we deal with the construction of gap functions for equilibrium
More informationA New Fenchel Dual Problem in Vector Optimization
A New Fenchel Dual Problem in Vector Optimization Radu Ioan Boţ Anca Dumitru Gert Wanka Abstract We introduce a new Fenchel dual for vector optimization problems inspired by the form of the Fenchel dual
More informationRobust combinatorial optimization with variable budgeted uncertainty
Noname manuscript No. (will be inserted by the editor) Robust combinatorial optimization with variable budgeted uncertainty Michael Poss Received: date / Accepted: date Abstract We introduce a new model
More informationIntegral Jensen inequality
Integral Jensen inequality Let us consider a convex set R d, and a convex function f : (, + ]. For any x,..., x n and λ,..., λ n with n λ i =, we have () f( n λ ix i ) n λ if(x i ). For a R d, let δ a
More information("-1/' .. f/ L) I LOCAL BOUNDEDNESS OF NONLINEAR, MONOTONE OPERA TORS. R. T. Rockafellar. MICHIGAN MATHEMATICAL vol. 16 (1969) pp.
I l ("-1/'.. f/ L) I LOCAL BOUNDEDNESS OF NONLINEAR, MONOTONE OPERA TORS R. T. Rockafellar from the MICHIGAN MATHEMATICAL vol. 16 (1969) pp. 397-407 JOURNAL LOCAL BOUNDEDNESS OF NONLINEAR, MONOTONE OPERATORS
More information2 Interval-valued Probability Measures
Interval-Valued Probability Measures K. David Jamison 1, Weldon A. Lodwick 2 1. Watson Wyatt & Company, 950 17th Street,Suite 1400, Denver, CO 80202, U.S.A 2. Department of Mathematics, Campus Box 170,
More informationResearch Article Existence and Duality of Generalized ε-vector Equilibrium Problems
Applied Mathematics Volume 2012, Article ID 674512, 13 pages doi:10.1155/2012/674512 Research Article Existence and Duality of Generalized ε-vector Equilibrium Problems Hong-Yong Fu, Bin Dan, and Xiang-Yu
More informationPart V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory
Part V 7 Introduction: What are measures and why measurable sets Lebesgue Integration Theory Definition 7. (Preliminary). A measure on a set is a function :2 [ ] such that. () = 2. If { } = is a finite
More informationAgenda. 1 Duality for LP. 2 Theorem of alternatives. 3 Conic Duality. 4 Dual cones. 5 Geometric view of cone programs. 6 Conic duality theorem
Agenda 1 Duality for LP 2 Theorem of alternatives 3 Conic Duality 4 Dual cones 5 Geometric view of cone programs 6 Conic duality theorem 7 Examples Lower bounds on LPs By eliminating variables (if needed)
More informationSolutions for Math 217 Assignment #3
Solutions for Math 217 Assignment #3 (1) Which of the following sets in R n are open? Which are closed? Which are neither open nor closed? (a) {(x, y) R 2 : x 2 y 2 = 1}. (b) {(x, y, z) R 3 : 0 < x + y
More informationTHE UNIQUE MINIMAL DUAL REPRESENTATION OF A CONVEX FUNCTION
THE UNIQUE MINIMAL DUAL REPRESENTATION OF A CONVEX FUNCTION HALUK ERGIN AND TODD SARVER Abstract. Suppose (i) X is a separable Banach space, (ii) C is a convex subset of X that is a Baire space (when endowed
More informationPart III. 10 Topological Space Basics. Topological Spaces
Part III 10 Topological Space Basics Topological Spaces Using the metric space results above as motivation we will axiomatize the notion of being an open set to more general settings. Definition 10.1.
More informationMATH 426, TOPOLOGY. p 1.
MATH 426, TOPOLOGY THE p-norms In this document we assume an extended real line, where is an element greater than all real numbers; the interval notation [1, ] will be used to mean [1, ) { }. 1. THE p
More informationStability of optimization problems with stochastic dominance constraints
Stability of optimization problems with stochastic dominance constraints D. Dentcheva and W. Römisch Stevens Institute of Technology, Hoboken Humboldt-University Berlin www.math.hu-berlin.de/~romisch SIAM
More informationSelected Examples of CONIC DUALITY AT WORK Robust Linear Optimization Synthesis of Linear Controllers Matrix Cube Theorem A.
. Selected Examples of CONIC DUALITY AT WORK Robust Linear Optimization Synthesis of Linear Controllers Matrix Cube Theorem A. Nemirovski Arkadi.Nemirovski@isye.gatech.edu Linear Optimization Problem,
More informationSOME REMARKS ON SUBDIFFERENTIABILITY OF CONVEX FUNCTIONS
Applied Mathematics E-Notes, 5(2005), 150-156 c ISSN 1607-2510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ SOME REMARKS ON SUBDIFFERENTIABILITY OF CONVEX FUNCTIONS Mohamed Laghdir
More informationMath 413/513 Chapter 6 (from Friedberg, Insel, & Spence)
Math 413/513 Chapter 6 (from Friedberg, Insel, & Spence) David Glickenstein December 7, 2015 1 Inner product spaces In this chapter, we will only consider the elds R and C. De nition 1 Let V be a vector
More informationLecture Note 5: Semidefinite Programming for Stability Analysis
ECE7850: Hybrid Systems:Theory and Applications Lecture Note 5: Semidefinite Programming for Stability Analysis Wei Zhang Assistant Professor Department of Electrical and Computer Engineering Ohio State
More informationRevisiting independence and stochastic dominance for compound lotteries
Revisiting independence and stochastic dominance for compound lotteries Alexander Zimper Working Paper Number 97 Department of Economics and Econometrics, University of Johannesburg Revisiting independence
More informationOn the Brézis - Haraux - type approximation in nonreflexive Banach spaces
On the Brézis - Haraux - type approximation in nonreflexive Banach spaces Radu Ioan Boţ Sorin - Mihai Grad Gert Wanka Abstract. We give Brézis - Haraux - type approximation results for the range of the
More informationOPTIMAL SOLUTIONS TO STOCHASTIC DIFFERENTIAL INCLUSIONS
APPLICATIONES MATHEMATICAE 29,4 (22), pp. 387 398 Mariusz Michta (Zielona Góra) OPTIMAL SOLUTIONS TO STOCHASTIC DIFFERENTIAL INCLUSIONS Abstract. A martingale problem approach is used first to analyze
More informationSequential Pareto Subdifferential Sum Rule And Sequential Effi ciency
Applied Mathematics E-Notes, 16(2016), 133-143 c ISSN 1607-2510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ Sequential Pareto Subdifferential Sum Rule And Sequential Effi ciency
More informationOn the sufficiency of finite support duals in semi-infinite linear programming
On the sufficiency of finite support duals in semi-infinite linear programming Amitabh Basu a, Kipp Martin b, Christopher Thomas Ryan b a The Johns Hopkins University b University of Chicago, Booth School
More informationStrong Duality and Dual Pricing Properties in Semi-infinite Linear Programming A Non-Fourier-Motzkin Elimination Approach
Strong Duality and Dual Pricing Properties in Semi-infinite Linear Programming A Non-Fourier-Motzkin Elimination Approach Qinghong Zhang Department of Mathematics and Computer Science Northern Michigan
More informationEconomics 204 Fall 2011 Problem Set 2 Suggested Solutions
Economics 24 Fall 211 Problem Set 2 Suggested Solutions 1. Determine whether the following sets are open, closed, both or neither under the topology induced by the usual metric. (Hint: think about limit
More informationConditions for zero duality gap in convex programming
Conditions for zero duality gap in convex programming Jonathan M. Borwein, Regina S. Burachik, and Liangjin Yao April 14, revision, 2013 Abstract We introduce and study a new dual condition which characterizes
More information