A CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE
|
|
- Walter Bryan
- 5 years ago
- Views:
Transcription
1 Journal of Applied Analysis Vol. 6, No. 1 (2000), pp A CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE A. W. A. TAHA Received June 18, 1999 and, in revised form, December 27, 1999 Abstract. We present a new version of first order necessary optimality conditions for a static minmax problem with inequality constraints in the parametric constraint case. These conditions, after some modification, turn out to characterize strict local minimizers of order one for the given problem. 1. Introduction The concept of a strict local minimizer of order m was considered by Cromme, under the name strongly unique minimizer, in a study of iterative numerical methods (see [2]). Such minimizers play an important role in stability studies (see, e.g., [5], [8]). Some results concerning characterizations of such minimizers for standard nonlinear programming problems with both inequality and equality constraints have been obtained, for m = 1 or m = 2, in [7], [9], [12]. These results were derived under the presence 1991 Mathematics Subject Classification. 49K35, 49J52. Key words and phrases. Minmax problem, optimality conditions, Clarke s subdifferential. ISSN c Heldermann Verlag.
2 140 A. W. A. Taha of constraint qualifications, leading to statements in which there is no gap between the necessary and sufficient conditions. Consider the following nonlinear programming problem: min {f(x) x S}, (1.1) where f :R n R and S is a nonempty subset of Rn defined by S := { x Rn gi(x) 0, i I }, (1.2) with I := {1,..., p} and g i :Rn R (i I). A special problem of the form (1.1) (1.2) is the static minmax problem in the parametric constraint case in which the objective function f is given by where φ :Rn Rm R, and f(x) := sup φ(x, y) y Z(x) Z(x) := { y Rm (x,y) 0, w(x,y) =0 }, for some d :Rn Rm Rk, w :Rn Rm Rl. In particular, if Z (x) and the sup above is attained at some point, we can write f as We can formulate problem (1.1) (1.3) as follows: f(x) := max φ(x, y). (1.3) y Z(x) min x S max y Z(x) φ(x, y), as a typical two-stage minmax problem, in which the maximizing playery Z(x) acts after the minimizing player-x S and with full knowledge of the choice of the minimizing player. Such problems arise in operations research (see [3], [4], [6]) In problem (1.1) (1.3), if the constraint set Z(x) does not depend on x (i.e., if for some set Y, Z(x) = Y, x S), then the problem becomes much simpler and is called the static minmax problem in the nonparametric constraint case. Recently, a characterization of strict local minimizers of order one for a nonsmooth static minmax problem with inequality constraints, in the nonparametric constraint case, has been investigated by Studniarski and the author in [10]. In this paper, we apply the ideas of [10] to derive a similar characterization for the more general problem (1.1) (1.3) (i.e., in the parametric constraint case). However, this will require imposing differentiability assumptions on the maximization problem which are stated below. max {φ (x, y) y Z (x)}, (1.4)
3 A characterization of strict local minimizers 141 For problem (1.4), we define the Lagrangian L(x, y, u, v) := φ(x, y) u T d(x, y) v T w(x, y), and we denote by P (x) and K(x, y ), respectively, the set of maximal solutions and the set of Kuhn-Tucker vectors associated with y P (x): P (x) := {y Z(x) φ(x, y ) = f(x)}, K(x, y ) := {(u, v ) Rk Rl yl(x,y,u,v ) =0, u T (x,y ) =0, d(x, y ) 0, w(x, y ) = 0, u 0}. We also define the index set of active inequality constraints I(x, y) := {i {1,..., k} d i (x, y) = 0}. For a given point x 0 Rn, let us assume that: (a 1 ) φ, d, w are continuously differentiable on Rn Rm ; (a 2 ) Z(x 0 ) is not empty, and Z is uniformly compact at x 0 (see [6, p. 17]); (a 3 ) for every y P (x 0 ), the gradients y d i (x 0, y ), i I(x 0, y ), y w i (x 0, y ), i = 1,..., l, are linearly independent. Let us note that conditions (a 1 ) (a 2 ) ensure that, for each x in some neighborhood of x 0, the maximum in (1.4) is attained at some point y Z(x) and condition (a 3 ) implies that the Kuhn-Tucker vector set K(x 0, y ) is a singleton set for each y P (x 0 ) (see [6, Proposition 6.5.1]). Before stating the following theorem, we will need some notations and definitions which can be found in [1, Chapter 2]. For a locally Lipschitzian function f :Rn R, we denote by f(x) the generalized gradient of f at x. We say that f is regular (or subdifferentially regular) at x if the usual one-sided directional derivative f (x; d) exists for all d and is equal to the generalized directional derivative f (x; d). Below, the symbol co A denotes the convex hull of the set A and the dot between two vectors denotes the usual inner product in Rn. Theorem 1 ([6, Proposition 9.2.1]). Under assumptions (a 1 ) (a 3 ), f is locally Lipschitzian at x 0 and directionally differentiable at x 0, so we have f (x 0 ; d) = f (x 0 ; d) = f(x 0 ) = co max y P (x 0 ) xl(x 0, y, u, v ) d, d Rn, (1.5) y P (x 0 ) where (u, v ) is the unique element of K(x 0, y ). x L(x 0, y, u, v ), (1.6)
4 142 A. W. A. Taha We consider problem (1.1) (1.3) in which the objective function (1.3) satisfies assumptions (a 1 ) (a 3 ), while the functions defining inequality constraints (g i, i I) are locally Lipschitzian and regular in Clarke s sense. Section 2 is devoted to necessary optimality conditions which are satisfied by all local minimizers (not necessarily strict) for problem (1.1) (1.3). These conditions include a restriction on the number of nonzero multipliers. In Section 3, we show that the previous necessary conditions can be modified so as to obtain a characterization of strict local minimizers of order one. We conclude this section with a compilation of some notations and definitions that will be useful in the sequel. For x 0 Rn and δ > 0, we denote B(x0, δ) := {x Rn x x0 δ}. We say that x 0 S is a local minimizer for problem (1.1) if there exists ε > 0 such that f(x) f(x 0 ) for all x S B(x 0, ε). Let m 1 be an integer. We say that x 0 S is a strict local minimizer of order m for problem (1.1) if there exist ε > 0, β > 0 such that f(x) f(x 0 ) + β x x 0 m for all x S B(x 0, ε). Throughout the paper, we will use the following notations for a given x Rn : I(x) := {i I g i (x) = 0}, I 0 (x) := {0} I (x). 2. First order necessary optimality conditions It was shown in [6, Theorem 9.2.2] that Theorem 1 can be used to derive first order necessary optimality conditions for the static minmax problem (1.1) (1.3) in which the functions φ, d, w and g i are continuously differentiable. These conditions do not include a restriction on the number of nonzero multipliers. Therefore, in this section, we present a detailed proof of first order necessary optimality conditions for problem (1.1) (1.3), in which the functions φ, d, w are continuously differentiable and g i, i I, are locally Lipschitzian, with appropriate modifications which allow us to obtain the mentioned restriction. Let x 0 S. Consider the following unconstrained optimization problem: where h :Rn R is defined by min { h(x) x Rn }, (2.1) h(x) := max {f(x) f(x 0 ), g i (x) i I}. (2.2)
5 A characterization of strict local minimizers 143 Observe that h(x 0 ) = 0. The relationship between problems (1.1) (1.2) and (2.1) (2.2) is given in the following lemma. Lemma 2. If x 0 is a local minimizer for (1.1) (1.2), then x 0 is also a local minimizer for (2.1) (2.2). Proof. The proof is elementary (see, e.g., [11, Theorem 2.1]). The following lemma will be used in the proof of Theorem 4 below. Lemma 3. For any subsets A, B of Rn, we have Proof. See [10, Lemma 2]. co((co A) B) = co(a B). The following result is a generalization of [6, Theorem 9.2.2]. Theorem 4. Let x 0 be a local minimizer for (1.1) (1.3). Suppose that assumptions (a 1 ) (a 3 ) are satisfied and the functions g j, j I, are locally Lipschitzian and regular. Then there exists a positive integer q, vectors y i P (x 0 ) together with scalars λ i 0, i = 1,..., q, µ j 0, j I, such that q 0 λ i x L(x 0, y i, u i, v i ) + µ j g j (x 0 ) (2.3) where (u i, v i ) is the unique element of K(x 0, y i ), i = 1,..., q, and µ j g j (x 0 ) = 0, j I. (2.4) Furthermore, if α is the number of nonzero λ i, and β is the number of nonzero µ j, then 1 α + β n + 1. (2.5) Proof. Let x 0 be a local minimizer for (1.1) (1.3); then x 0 is a local minimizer for (2.1) (2.2) by Lemma 2. Define g 0 (x) := f(x) f(x 0 ). We have h(x) = max{g i (x) i I 0 (x 0 )} and h(x 0 ) = 0 = g 0 (x 0 ). By assumptions (a 1 ) (a 3 ) and Theorem 1, f is locally Lipschitzian and regular at x 0, so that g 0 has the same properties. Since g j, j I, are locally Lipschitzian and regular at x 0 by hypotheses, then using [1, Propositions and ], we obtain 0 h(x 0 ) = co g j (x 0 ) = co f(x 0) g j (x 0 ). j I 0 (x 0 )
6 144 A. W. A. Taha Now, applying formula (1.6) to f(x 0 ), we deduce 0 co co x L(x 0, y, u, v ) y P (x 0 ) By Lemma 3, this is equivalent to 0 co x L(x 0, y, u, v ) y P (x 0 ) g j (x 0 ). g j (x 0 ). Hence, by Caratheodory s theorem, there exist scalars λ i > 0, i = 1,..., α, η s > 0, s = 1,..., r, such that and 0 = α λ i x L(x 0, y i, u i, v i ) + 1 α + r n + 1 (2.6) r η s w s for some y i P (x 0 ), s=1 w s g j (x 0 ). (2.7) (Here, we allow the case where α = 0, then the set of multipliers λ i is empty; similarly, if r = 0, then there are no multipliers η s ). For each j I(x 0 ), we define J(j) := {s {1,..., r} w s g j (x 0 )\ g t (x 0 )} and ζ j := t I(x 0 ) t<j { ( s J(j) η sw s ) /( s J(j) η s), if J(j), an arbitrary element of g j (x 0 ), if J(j) =, µ j := { s J(j) η s, if J(j), 0, if J(j) =. Then µ j 0 and ζ j g j (x 0 ) (by the convexity of g j (x 0 )) for all j I(x 0 ). Moreover, condition (2.7) implies that α 0 = λ i x L(x 0, y i, u i, v i ) + µ j ζ j. To obtain (2.3) and (2.4), let µ j = 0 for j I\I(x 0 ). Also, if α > 0, then we can take q = α, and all λ i are nonzero. However, if α = 0, then let q = 1, λ 1 = 0, and y 1 an arbitrary element of P (x 0 ).
7 A characterization of strict local minimizers 145 Let β be the number of nonzero µ j. Then it follows from our construction that β is not greater than the number r of all η i. Moreover, if r > 0, then β > 0. Hence, condition (2.6) implies (2.5). 3. Characterizations of strict local minimizers of order one We begin by reviewing some results for the standard nonlinear programming problem (1.1) (1.2). Throughout this section, we assume that the following constraint qualification is satisfied at x 0 : (a 4 ) For each η Rp satisfying the conditions the following implication holds: η i = 0, i I\I(x 0 ); η i 0, i I(x 0 ), z i g i (x 0 ) ( i I), η i zi = 0 η = 0. Theorem 5 ([10, Theorem 7]). Consider problem (1.1) (1.2) where the functions f and g i, i I, are locally Lipschitzian and possess one-sided directional derivatives at x 0 S. Suppose that assumption (a 4 ) holds. Then x 0 is a strict local minimizer of order one for (1.1) (1.2) if and only if where f (x 0 ; d) > 0, d C(x 0 )\{0}, C(x 0 ) := {d Rn g i (x 0; ) 0, i I(x0)}. (3.1) We now formulate the main result of this section. Theorem 6. Consider problem (1.1) (1.3). Suppose that assumptions (a 1 ) (a 4 ) are satisfied and the functions g j, j I, are locally Lipschitzian and regular. Then x 0 is a strict local minimizer of order one for (1.1) (1.3) if and only if the following conditions hold: (a) C(x 0 ) {d Rn \{0} max y P(x0) xl(x0,y,u,v ) = 0} =, where (u, v ) is the unique element of K(x 0, y ); (b) there exists a positive integer α, vectors y i P (x 0 ) together with scalars λ i > 0, i = 1,..., α, scalars µ j 0, j I, such that α 0 λ i x L(x 0, y i, u i, v i ) + µ j g j (x 0 ), (3.2) µ j g j (x 0 ) = 0, j I, (3.3)
8 146 A. W. A. Taha where (u i, v i ) is the unique element of K(x 0, y i ), i = 1,..., α, and 1 α + β n + 1, where β is the number of nonzero µ j. (3.4) Proof. (i) Necessity. Suppose that x 0 is a strict local minimizer of order one for problem (1.1) (1.3). Then it is also a local minimizer for (1.1) (1.3); therefore, Theorem 4 implies that there exists a positive integer q, vectors y i P (x 0 ) together with scalars λ i 0, i = 1,..., q, scalars µ j 0, j I, such that conditions (2.3) (2.5) hold. Suppose that all λ i are zero; then condition (2.3) takes on the form 0 µ j g j (x 0 ). Then it follows from assumption (a 4 ) and equalities (2.4) that all µ j are zero, a contradiction with the left-hand inequality in (2.5). Therefore, at least one λ i must be nonzero, which means that condition (b) holds. Condition (a) follows from Theorem 5 and formula (1.5). (ii) Sufficiency. By Theorem 5 and formula (1.5), it suffices to show that f (x 0 ; d) = max xl(x 0, y, u, v ) d > 0 (3.5) y P (x 0 ) for all d C(x 0 )\{0}. Define ν i := λ i /λ, i = 1,..., α, where λ := α λ i > 0. Then, using condition (3.2) and the equality α ν i = 1, we deduce α 0 λ ν i x L(x 0, y i, u i, v i ) + µ j g j (x 0 ) λco y P (x 0 ) = λ f(x 0 ) + x L(x 0, y, u, v ) + µ j g j (x 0 ), µ j g j (x 0 ) where the last equality follows from (1.6). By (3.3), we have µ j = 0 for all j I\I(x 0 ). Therefore, 0 λ f(x 0 ) + µ j g j (x 0 ). Since f and g j, j I, are regular at x 0 by formula (1.5) and hypotheses, we may apply [1, Corollary 3, p. 40] to obtain 0 (λf + µ j g j )(x 0 ). (3.6)
9 A characterization of strict local minimizers 147 Now, take any d C(x 0 )\{0}. Our assumptions on f and g j imply that the function ψ := λf + µ jg j is regular at x 0 (see [1, Proposition (c)]) Hence, from (3.6) and the definition of generalized gradient, it follows that 0 ψ (x 0 ; d) = ψ (x 0 ; d) = λf (x 0 ; d) + µ j g j(x 0 ; d) = λ max y P (x 0 ) xl(x 0, y, u, v ) d + µ j g j(x 0 ; d) λ max y P (x 0 ) xl(x 0, y, u, v ) d (3.7) where the last inequality is a consequence of (3.1). Now, the desired inequality (3.5) follows from (3.7) and (a). Acknowledgment. The author is extremely grateful to his supervisor Professor Marcin Studniarski for his valuable comments and continuing encouragement. References [1] Clarke, F.H., Optimization and Nonsmooth Analysis, Wiley-Interscience, New York, [2] Cromme, L., Strong uniqueness: a far-reaching criterion for the convergence of iterative procedures, Numer. Math. 29 (1978), [3] Danskin, J.M., The theory of maxmin with applictions, SIAM J. Appl. Math., 14(4) (1966), [4] Danskin, J.M., The Theory of Maxmin and Its Appliction to Weapons Allocation Problems, Springer-Verlag, Berlin, [5] Klatte, D., Stable local minimizers in semi-infinite optimization: regularity and second-order conditions, J. Comput. Appl. Math. 56 (1994), [6] Shimizu, K., Ishizuka, Y. and Bard, J.F., Nondifferentiable and Two-Level Mathematical Programming, Kluwer Academic Publishers, Boston, [7] Still, G. and Streng, M., Optimality conditions in smooth nonlinear programming, J. Optim. Theory Appl. 90 (1996), [8] Studniarski, M., Sufficient conditions for the stability of local minimum points in nonsmooth optimization, Optimization 20 (1989), [9] Studniarski, M., Characterizations of strict local minima for some nonlinear programming problems, Nonlinear Anal. 30 (1997), (Proc. 2nd World Congress of Nonlinear Analysts). [10] Studniarski, M. and Taha, A., A characterization of strict local minimizers of order one for nonsmooth static minmax problems, (submitted for publication). [11] Sutti, C., Monotone generalized differentiability in nonsmooth optimization, Riv. Mat. Sci. Econom. Social. 18 (1995), [12] Ward, D.E., Characterizations of strict local minima and necessary conditions for weak sharp minima, J. Optim. Theory Appl. 80 (1994),
10 148 A. W. A. Taha Abdul Whab A. Taha Faculty of Mathematics University of Lódź S. Banacha Lódź, Poland
The exact absolute value penalty function method for identifying strict global minima of order m in nonconvex nonsmooth programming
Optim Lett (2016 10:1561 1576 DOI 10.1007/s11590-015-0967-3 ORIGINAL PAPER The exact absolute value penalty function method for identifying strict global minima of order m in nonconvex nonsmooth programming
More informationOn Optimality Conditions for Pseudoconvex Programming in Terms of Dini Subdifferentials
Int. Journal of Math. Analysis, Vol. 7, 2013, no. 18, 891-898 HIKARI Ltd, www.m-hikari.com On Optimality Conditions for Pseudoconvex Programming in Terms of Dini Subdifferentials Jaddar Abdessamad Mohamed
More informationON GAP FUNCTIONS OF VARIATIONAL INEQUALITY IN A BANACH SPACE. Sangho Kum and Gue Myung Lee. 1. Introduction
J. Korean Math. Soc. 38 (2001), No. 3, pp. 683 695 ON GAP FUNCTIONS OF VARIATIONAL INEQUALITY IN A BANACH SPACE Sangho Kum and Gue Myung Lee Abstract. In this paper we are concerned with theoretical properties
More informationNew Class of duality models in discrete minmax fractional programming based on second-order univexities
STATISTICS, OPTIMIZATION AND INFORMATION COMPUTING Stat., Optim. Inf. Comput., Vol. 5, September 017, pp 6 77. Published online in International Academic Press www.iapress.org) New Class of duality models
More informationOptimality and Duality Theorems in Nonsmooth Multiobjective Optimization
RESEARCH Open Access Optimality and Duality Theorems in Nonsmooth Multiobjective Optimization Kwan Deok Bae and Do Sang Kim * * Correspondence: dskim@pknu.ac. kr Department of Applied Mathematics, Pukyong
More informationSOME PROPERTIES ON THE CLOSED SUBSETS IN BANACH SPACES
ARCHIVUM MATHEMATICUM (BRNO) Tomus 42 (2006), 167 174 SOME PROPERTIES ON THE CLOSED SUBSETS IN BANACH SPACES ABDELHAKIM MAADEN AND ABDELKADER STOUTI Abstract. It is shown that under natural assumptions,
More informationOptimality 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 informationOn Weak Pareto Optimality for Pseudoconvex Nonsmooth Multiobjective Optimization Problems
Int. Journal of Math. Analysis, Vol. 7, 2013, no. 60, 2995-3003 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2013.311276 On Weak Pareto Optimality for Pseudoconvex Nonsmooth Multiobjective
More informationNumerical 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 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 informationFinite 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 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 informationSolving 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 informationON 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 informationOn constraint qualifications with generalized convexity and optimality conditions
On constraint qualifications with generalized convexity and optimality conditions Manh-Hung Nguyen, Do Van Luu To cite this version: Manh-Hung Nguyen, Do Van Luu. On constraint qualifications with generalized
More informationRelationships between upper exhausters and the basic subdifferential in variational analysis
J. Math. Anal. Appl. 334 (2007) 261 272 www.elsevier.com/locate/jmaa Relationships between upper exhausters and the basic subdifferential in variational analysis Vera Roshchina City University of Hong
More informationEXISTENCE RESULTS FOR QUASILINEAR HEMIVARIATIONAL INEQUALITIES AT RESONANCE. Leszek Gasiński
DISCRETE AND CONTINUOUS Website: www.aimsciences.org DYNAMICAL SYSTEMS SUPPLEMENT 2007 pp. 409 418 EXISTENCE RESULTS FOR QUASILINEAR HEMIVARIATIONAL INEQUALITIES AT RESONANCE Leszek Gasiński Jagiellonian
More informationCentre d Economie de la Sorbonne UMR 8174
Centre d Economie de la Sorbonne UMR 8174 On alternative theorems and necessary conditions for efficiency Do Van LUU Manh Hung NGUYEN 2006.19 Maison des Sciences Économiques, 106-112 boulevard de L'Hôpital,
More informationAN INTERSECTION FORMULA FOR THE NORMAL CONE ASSOCIATED WITH THE HYPERTANGENT CONE
Journal of Applied Analysis Vol. 5, No. 2 (1999), pp. 239 247 AN INTERSETION FORMULA FOR THE NORMAL ONE ASSOIATED WITH THE HYPERTANGENT ONE M. ILIGOT TRAVAIN Received May 26, 1998 and, in revised form,
More informationConstructive Proof of the Fan-Glicksberg Fixed Point Theorem for Sequentially Locally Non-constant Multi-functions in a Locally Convex Space
Constructive Proof of the Fan-Glicksberg Fixed Point Theorem for Sequentially Locally Non-constant Multi-functions in a Locally Convex Space Yasuhito Tanaka, Member, IAENG, Abstract In this paper we constructively
More informationSOME REMARKS ON THE SPACE OF DIFFERENCES OF SUBLINEAR FUNCTIONS
APPLICATIONES MATHEMATICAE 22,3 (1994), pp. 419 426 S. G. BARTELS and D. PALLASCHKE (Karlsruhe) SOME REMARKS ON THE SPACE OF DIFFERENCES OF SUBLINEAR FUNCTIONS Abstract. Two properties concerning the space
More informationThe 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 informationSECOND-ORDER CHARACTERIZATIONS OF CONVEX AND PSEUDOCONVEX FUNCTIONS
Journal of Applied Analysis Vol. 9, No. 2 (2003), pp. 261 273 SECOND-ORDER CHARACTERIZATIONS OF CONVEX AND PSEUDOCONVEX FUNCTIONS I. GINCHEV and V. I. IVANOV Received June 16, 2002 and, in revised form,
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 informationDifferentiability of Convex Functions on a Banach Space with Smooth Bump Function 1
Journal of Convex Analysis Volume 1 (1994), No.1, 47 60 Differentiability of Convex Functions on a Banach Space with Smooth Bump Function 1 Li Yongxin, Shi Shuzhong Nankai Institute of Mathematics Tianjin,
More informationA convergence result for an Outer Approximation Scheme
A convergence result for an Outer Approximation Scheme R. S. Burachik Engenharia de Sistemas e Computação, COPPE-UFRJ, CP 68511, Rio de Janeiro, RJ, CEP 21941-972, Brazil regi@cos.ufrj.br J. O. Lopes Departamento
More informationSECOND ORDER DUALITY IN MULTIOBJECTIVE PROGRAMMING
Journal of Applied Analysis Vol. 4, No. (2008), pp. 3-48 SECOND ORDER DUALITY IN MULTIOBJECTIVE PROGRAMMING I. AHMAD and Z. HUSAIN Received November 0, 2006 and, in revised form, November 6, 2007 Abstract.
More informationOPTIMALITY CONDITIONS AND DUALITY FOR SEMI-INFINITE PROGRAMMING INVOLVING SEMILOCALLY TYPE I-PREINVEX AND RELATED FUNCTIONS
Commun. Korean Math. Soc. 27 (2012), No. 2, pp. 411 423 http://dx.doi.org/10.4134/ckms.2012.27.2.411 OPTIMALITY CONDITIONS AND DUALITY FOR SEMI-INFINITE PROGRAMMING INVOLVING SEMILOCALLY TYPE I-PREINVEX
More informationThe general programming problem is the nonlinear programming problem where a given function is maximized subject to a set of inequality constraints.
1 Optimization Mathematical programming refers to the basic mathematical problem of finding a maximum to a function, f, subject to some constraints. 1 In other words, the objective is to find a point,
More informationA PROJECTED HESSIAN GAUSS-NEWTON ALGORITHM FOR SOLVING SYSTEMS OF NONLINEAR EQUATIONS AND INEQUALITIES
IJMMS 25:6 2001) 397 409 PII. S0161171201002290 http://ijmms.hindawi.com Hindawi Publishing Corp. A PROJECTED HESSIAN GAUSS-NEWTON ALGORITHM FOR SOLVING SYSTEMS OF NONLINEAR EQUATIONS AND INEQUALITIES
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 informationTHE BANG-BANG PRINCIPLE FOR THE GOURSAT-DARBOUX PROBLEM*
THE BANG-BANG PRINCIPLE FOR THE GOURSAT-DARBOUX PROBLEM* DARIUSZ IDCZAK Abstract. In the paper, the bang-bang principle for a control system connected with a system of linear nonautonomous partial differential
More informationExtremal Solutions of Differential Inclusions via Baire Category: a Dual Approach
Extremal Solutions of Differential Inclusions via Baire Category: a Dual Approach Alberto Bressan Department of Mathematics, Penn State University University Park, Pa 1682, USA e-mail: bressan@mathpsuedu
More informationApplied Mathematics Letters
Applied Mathematics Letters 25 (2012) 974 979 Contents lists available at SciVerse ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml On dual vector equilibrium problems
More informationRobust 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 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 informationHigher-order parameter-free sufficient optimality conditions in discrete minmax fractional programming
Higher-order parameter-free sufficient optimality conditions in discrete minmax fractional programming Ram U. Verma 1, G. J. Zalmai 1 International Publications USA, 100 Dallas Drive Suite 91, Denton,
More informationA derivative-free nonmonotone line search and its application to the spectral residual method
IMA Journal of Numerical Analysis (2009) 29, 814 825 doi:10.1093/imanum/drn019 Advance Access publication on November 14, 2008 A derivative-free nonmonotone line search and its application to the spectral
More informationDUALIZATION 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 informationDivision of the Humanities and Social Sciences. Supergradients. KC Border Fall 2001 v ::15.45
Division of the Humanities and Social Sciences Supergradients KC Border Fall 2001 1 The supergradient of a concave function There is a useful way to characterize the concavity of differentiable functions.
More informationOn Total Convexity, Bregman Projections and Stability in Banach Spaces
Journal of Convex Analysis Volume 11 (2004), No. 1, 1 16 On Total Convexity, Bregman Projections and Stability in Banach Spaces Elena Resmerita Department of Mathematics, University of Haifa, 31905 Haifa,
More informationNonlinear Analysis 72 (2010) Contents lists available at ScienceDirect. Nonlinear Analysis. journal homepage:
Nonlinear Analysis 72 (2010) 4298 4303 Contents lists available at ScienceDirect Nonlinear Analysis journal homepage: www.elsevier.com/locate/na Local C 1 ()-minimizers versus local W 1,p ()-minimizers
More informationLocal semiconvexity of Kantorovich potentials on non-compact manifolds
Local semiconvexity of Kantorovich potentials on non-compact manifolds Alessio Figalli, Nicola Gigli Abstract We prove that any Kantorovich potential for the cost function c = d / on a Riemannian manifold
More informationConstrained maxima and Lagrangean saddlepoints
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Topic 10: Constrained maxima and Lagrangean saddlepoints 10.1 An alternative As an application
More informationMathematical Programming Involving (α, ρ)-right upper-dini-derivative Functions
Filomat 27:5 (2013), 899 908 DOI 10.2298/FIL1305899Y Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Mathematical Programming Involving
More informationGlobal Maximum of a Convex Function: Necessary and Sufficient Conditions
Journal of Convex Analysis Volume 13 2006), No. 3+4, 687 694 Global Maximum of a Convex Function: Necessary and Sufficient Conditions Emil Ernst Laboratoire de Modélisation en Mécaniue et Thermodynamiue,
More informationJournal of Inequalities in Pure and Applied Mathematics
Journal of Inequalities in Pure and Applied Mathematics MONOTONE TRAJECTORIES OF DYNAMICAL SYSTEMS AND CLARKE S GENERALIZED JACOBIAN GIOVANNI P. CRESPI AND MATTEO ROCCA Université de la Vallée d Aoste
More information6.254 : Game Theory with Engineering Applications Lecture 7: Supermodular Games
6.254 : Game Theory with Engineering Applications Lecture 7: Asu Ozdaglar MIT February 25, 2010 1 Introduction Outline Uniqueness of a Pure Nash Equilibrium for Continuous Games Reading: Rosen J.B., Existence
More informationShiqian 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 informationWeak sharp minima on Riemannian manifolds 1
1 Chong Li Department of Mathematics Zhejiang University Hangzhou, 310027, P R China cli@zju.edu.cn April. 2010 Outline 1 2 Extensions of some results for optimization problems on Banach spaces 3 4 Some
More informationFIRST ORDER CHARACTERIZATIONS OF PSEUDOCONVEX FUNCTIONS. Vsevolod Ivanov Ivanov
Serdica Math. J. 27 (2001), 203-218 FIRST ORDER CHARACTERIZATIONS OF PSEUDOCONVEX FUNCTIONS Vsevolod Ivanov Ivanov Communicated by A. L. Dontchev Abstract. First order characterizations of pseudoconvex
More informationON DENSITY TOPOLOGIES WITH RESPECT
Journal of Applied Analysis Vol. 8, No. 2 (2002), pp. 201 219 ON DENSITY TOPOLOGIES WITH RESPECT TO INVARIANT σ-ideals J. HEJDUK Received June 13, 2001 and, in revised form, December 17, 2001 Abstract.
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 informationSOME 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 informationA 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 informationFIRST- 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 informationON REGULARITY CONDITIONS FOR COMPLEMENTARITY PROBLEMS
ON REGULARITY CONDITIONS FOR COMPLEMENTARITY PROBLEMS A. F. Izmailov and A. S. Kurennoy December 011 ABSTRACT In the context of mixed complementarity problems various concepts of solution regularity are
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 informationCHARACTERIZATIONS 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 informationConvergence theorems for a finite family. of nonspreading and nonexpansive. multivalued mappings and equilibrium. problems with application
Theoretical Mathematics & Applications, vol.3, no.3, 2013, 49-61 ISSN: 1792-9687 (print), 1792-9709 (online) Scienpress Ltd, 2013 Convergence theorems for a finite family of nonspreading and nonexpansive
More informationInequality 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 informationNecessary and Sufficient Conditions for the Existence of a Global Maximum for Convex Functions in Reflexive Banach Spaces
Laboratoire d Arithmétique, Calcul formel et d Optimisation UMR CNRS 6090 Necessary and Sufficient Conditions for the Existence of a Global Maximum for Convex Functions in Reflexive Banach Spaces Emil
More informationOn the (Non-)Differentiability of the Optimal Value Function When the Optimal Solution Is Unique
On the (Non-)Differentiability of the Optimal Value Function When the Optimal Solution Is Unique Daisuke Oyama Faculty of Economics, University of Tokyo Hongo, Bunkyo-ku, Tokyo 113-0033, Japan oyama@e.u-tokyo.ac.jp
More informationHAIYUN ZHOU, RAVI P. AGARWAL, YEOL JE CHO, AND YONG SOO KIM
Georgian Mathematical Journal Volume 9 (2002), Number 3, 591 600 NONEXPANSIVE MAPPINGS AND ITERATIVE METHODS IN UNIFORMLY CONVEX BANACH SPACES HAIYUN ZHOU, RAVI P. AGARWAL, YEOL JE CHO, AND YONG SOO KIM
More informationPolishness of Weak Topologies Generated by Gap and Excess Functionals
Journal of Convex Analysis Volume 3 (996), No. 2, 283 294 Polishness of Weak Topologies Generated by Gap and Excess Functionals Ľubica Holá Mathematical Institute, Slovak Academy of Sciences, Štefánikovà
More informationCONSTRAINT 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 informationJournal of Inequalities in Pure and Applied Mathematics
Journal of Inequalities in Pure and Applied Mathematics http://jipam.vu.edu.au/ Volume 4, Issue 4, Article 67, 2003 ON GENERALIZED MONOTONE MULTIFUNCTIONS WITH APPLICATIONS TO OPTIMALITY CONDITIONS IN
More informationBrøndsted-Rockafellar property of subdifferentials of prox-bounded functions. Marc Lassonde Université des Antilles et de la Guyane
Conference ADGO 2013 October 16, 2013 Brøndsted-Rockafellar property of subdifferentials of prox-bounded functions Marc Lassonde Université des Antilles et de la Guyane Playa Blanca, Tongoy, Chile SUBDIFFERENTIAL
More informationHIGHER ORDER OPTIMALITY AND DUALITY IN FRACTIONAL VECTOR OPTIMIZATION OVER CONES
- TAMKANG JOURNAL OF MATHEMATICS Volume 48, Number 3, 273-287, September 2017 doi:10.5556/j.tkjm.48.2017.2311 - - - + + This paper is available online at http://journals.math.tku.edu.tw/index.php/tkjm/pages/view/onlinefirst
More informationWEAK LOWER SEMI-CONTINUITY OF THE OPTIMAL VALUE FUNCTION AND APPLICATIONS TO WORST-CASE ROBUST OPTIMAL CONTROL PROBLEMS
WEAK LOWER SEMI-CONTINUITY OF THE OPTIMAL VALUE FUNCTION AND APPLICATIONS TO WORST-CASE ROBUST OPTIMAL CONTROL PROBLEMS ROLAND HERZOG AND FRANK SCHMIDT Abstract. Sufficient conditions ensuring weak lower
More informationPARALLEL SUBGRADIENT METHOD FOR NONSMOOTH CONVEX OPTIMIZATION WITH A SIMPLE CONSTRAINT
Linear and Nonlinear Analysis Volume 1, Number 1, 2015, 1 PARALLEL SUBGRADIENT METHOD FOR NONSMOOTH CONVEX OPTIMIZATION WITH A SIMPLE CONSTRAINT KAZUHIRO HISHINUMA AND HIDEAKI IIDUKA Abstract. In this
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 informationOn the Midpoint Method for Solving Generalized Equations
Punjab University Journal of Mathematics (ISSN 1016-56) Vol. 40 (008) pp. 63-70 On the Midpoint Method for Solving Generalized Equations Ioannis K. Argyros Cameron University Department of Mathematics
More informationConvex 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 informationConvex analysis and profit/cost/support functions
Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m Convex analysts may give one of two
More informationWeak and strong convergence theorems of modified SP-iterations for generalized asymptotically quasi-nonexpansive mappings
Mathematica Moravica Vol. 20:1 (2016), 125 144 Weak and strong convergence theorems of modified SP-iterations for generalized asymptotically quasi-nonexpansive mappings G.S. Saluja Abstract. The aim of
More informationChapter 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 informationCoordinate Update Algorithm Short Course Subgradients and Subgradient Methods
Coordinate Update Algorithm Short Course Subgradients and Subgradient Methods Instructor: Wotao Yin (UCLA Math) Summer 2016 1 / 30 Notation f : H R { } is a closed proper convex function domf := {x R n
More informationDeviation Measures and Normals of Convex Bodies
Beiträge zur Algebra und Geometrie Contributions to Algebra Geometry Volume 45 (2004), No. 1, 155-167. Deviation Measures Normals of Convex Bodies Dedicated to Professor August Florian on the occasion
More informationON 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 informationZangwill s Global Convergence Theorem
Zangwill s Global Convergence Theorem A theory of global convergence has been given by Zangwill 1. This theory involves the notion of a set-valued mapping, or point-to-set mapping. Definition 1.1 Given
More informationTechnische 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 informationJournal of Inequalities in Pure and Applied Mathematics
Journal of Inequalities in Pure and Applied Mathematics EPI-DIFFERENTIABILITY AND OPTIMALITY CONDITIONS FOR AN EXTREMAL PROBLEM UNDER INCLUSION CONSTRAINTS T. AMAHROQ, N. GADHI AND PR H. RIAHI Université
More informationarxiv: v1 [math.oc] 21 Mar 2015
Convex KKM maps, monotone operators and Minty variational inequalities arxiv:1503.06363v1 [math.oc] 21 Mar 2015 Marc Lassonde Université des Antilles, 97159 Pointe à Pitre, France E-mail: marc.lassonde@univ-ag.fr
More informationEXISTENCE OF WEAK SOLUTIONS FOR A NONUNIFORMLY ELLIPTIC NONLINEAR SYSTEM IN R N. 1. Introduction We study the nonuniformly elliptic, nonlinear system
Electronic Journal of Differential Equations, Vol. 20082008), No. 119, pp. 1 10. ISSN: 1072-6691. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ftp ejde.math.txstate.edu login: ftp) EXISTENCE
More informationIdentifying 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 informationBoundary Behavior of Excess Demand Functions without the Strong Monotonicity Assumption
Boundary Behavior of Excess Demand Functions without the Strong Monotonicity Assumption Chiaki Hara April 5, 2004 Abstract We give a theorem on the existence of an equilibrium price vector for an excess
More informationScalar Asymptotic Contractivity and Fixed Points for Nonexpansive Mappings on Unbounded Sets
Scalar Asymptotic Contractivity and Fixed Points for Nonexpansive Mappings on Unbounded Sets George Isac Department of Mathematics Royal Military College of Canada, STN Forces Kingston, Ontario, Canada
More informationITERATIVE SCHEMES FOR APPROXIMATING SOLUTIONS OF ACCRETIVE OPERATORS IN BANACH SPACES SHOJI KAMIMURA AND WATARU TAKAHASHI. Received December 14, 1999
Scientiae Mathematicae Vol. 3, No. 1(2000), 107 115 107 ITERATIVE SCHEMES FOR APPROXIMATING SOLUTIONS OF ACCRETIVE OPERATORS IN BANACH SPACES SHOJI KAMIMURA AND WATARU TAKAHASHI Received December 14, 1999
More informationNONTRIVIAL SOLUTIONS TO INTEGRAL AND DIFFERENTIAL EQUATIONS
Fixed Point Theory, Volume 9, No. 1, 28, 3-16 http://www.math.ubbcluj.ro/ nodeacj/sfptcj.html NONTRIVIAL SOLUTIONS TO INTEGRAL AND DIFFERENTIAL EQUATIONS GIOVANNI ANELLO Department of Mathematics University
More informationGENERAL 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 information8. Constrained Optimization
8. Constrained Optimization Daisuke Oyama Mathematics II May 11, 2018 Unconstrained Maximization Problem Let X R N be a nonempty set. Definition 8.1 For a function f : X R, x X is a (strict) local maximizer
More informationSTRONG CONVERGENCE RESULTS FOR NEARLY WEAK UNIFORMLY L-LIPSCHITZIAN MAPPINGS
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org / JOURNALS / BULLETIN Vol. 6(2016), 199-208 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS
More informationNEW MAXIMUM THEOREMS WITH STRICT QUASI-CONCAVITY. Won Kyu Kim and Ju Han Yoon. 1. Introduction
Bull. Korean Math. Soc. 38 (2001), No. 3, pp. 565 573 NEW MAXIMUM THEOREMS WITH STRICT QUASI-CONCAVITY Won Kyu Kim and Ju Han Yoon Abstract. In this paper, we first prove the strict quasi-concavity of
More informationON THE EXISTENCE OF THREE SOLUTIONS FOR QUASILINEAR ELLIPTIC PROBLEM. Paweł Goncerz
Opuscula Mathematica Vol. 32 No. 3 2012 http://dx.doi.org/10.7494/opmath.2012.32.3.473 ON THE EXISTENCE OF THREE SOLUTIONS FOR QUASILINEAR ELLIPTIC PROBLEM Paweł Goncerz Abstract. We consider a quasilinear
More informationOn John type ellipsoids
On John type ellipsoids B. Klartag Tel Aviv University Abstract Given an arbitrary convex symmetric body K R n, we construct a natural and non-trivial continuous map u K which associates ellipsoids to
More informationSemi-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 information1. Introduction. Consider the following parameterized optimization problem:
SIAM J. OPTIM. c 1998 Society for Industrial and Applied Mathematics Vol. 8, No. 4, pp. 940 946, November 1998 004 NONDEGENERACY AND QUANTITATIVE STABILITY OF PARAMETERIZED OPTIMIZATION PROBLEMS WITH MULTIPLE
More informationLocally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem
56 Chapter 7 Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem Recall that C(X) is not a normed linear space when X is not compact. On the other hand we could use semi
More informationYET MORE ON THE DIFFERENTIABILITY OF CONVEX FUNCTIONS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 103, Number 3, July 1988 YET MORE ON THE DIFFERENTIABILITY OF CONVEX FUNCTIONS JOHN RAINWATER (Communicated by William J. Davis) ABSTRACT. Generic
More information