On coderivatives and Lipschitzian properties of the dual pair in optimization

In this paper, we apply the concept of coderivative and other tools from the generalized differentiation theory for set-valued mappings to study the stability of the feasible sets of both the primal and the dual problem in infinite-dimensional linear optimization with infinitely many explicit constraints and an additional conic constraint. After providing some specific duality results for our dual pair, we study the Lipschitz-like property of both mappings and also give bounds for the associated Lipschitz moduli. The situation for the dual shows much more involved than the case of the primal problem.     

Coderivatives of normal cone mappings and Lipschitzian stability of parametric variational inequalities

In this paper, we provide a comprehensive study of coderivative formulas for normal cone mappings. This allows us to derive necessary and sufficient conditions for the Lipschitzian stability of parametric variational inequalities in reflexive Banach spaces. Our development not only gives an answer to the open questions raised in Yao and Yen (2009) [11], but also establishes generalizations and complements of the results given in Henrion et al. (2010) [4] and Yao and Yen (2009) [11] and [12].     

Convergence of set-valued mappings: Equi-outer semicontinuity

The concept of equi-outer semicontinuity allows us to relate the pointwise and the graphical convergence of set-valued-mappings. One of the main results is a compactness criterion that extends the classical Arzelà-Ascolì theorem for continuous functions to this new setting; it also leads to the exploration of the notion of continuous convergence. Equi-lower semicontinuity of functions is related to the outer semicontinuity of epigraphical mappings. Finally, some examples involving set-valued mappings are re-examined in terms of the concepts introduced here.Research supported in part by a grant of the National Science Foundation.     

Stability of the intersection of solution sets of semi-infinite systems

Many mathematical programming models arising in practice present a block structure in their constraint systems. Consequently, the feasibility of these problems depends on whether the intersection of the solution sets of each of those blocks is empty or not. The existence theorems allow to decide when the intersection of non-empty sets in the Euclidean space, which are the solution sets of systems of (possibly infinite) inequalities, is empty or not. In those situations where the data (i.e., the constraints) can be affected by some kind of perturbations, the problem consists of determining whether the relative position of the sets is preserved by sufficiently small perturbations or not. This paper focuses on the stability of the non-empty (empty) intersection of the solutions of some given systems, which can be seen as the images of set-valued mappings. We give sufficient conditions for the stability, and necessary ones as well; in particular we consider (semi-infinite) convex systems and also linear systems. In this last case we discuss the distance to ill-posedness.     

Strong convergence of iterative methods by strictly pseudocontractive mappings in Banach spaces

In this paper we deal with fixed point computational problems by strongly convergent methods involving strictly pseudocontractive mappings in smooth Banach spaces. First, we prove that the S-iteration process recently introduced by Sahu in [14] converges strongly to a unique fixed point of a mapping T, where T is κ-strongly pseudocontractive mapping from a nonempty, closed and convex subset C of a smooth Banach space into itself. It is also shown that the hybrid steepest descent method converges strongly to a unique solution of a variational inequality problem with respect to a finite family of λ_i-strictly pseudocontractive mappings from C into itself. Our results extend and improve some very recent theorems in fixed point theory and variational inequality problems. Particularly, the results presented here extend some theorems of Reich (1980) [1] and Yamada (2001) [15] to a general class of λ-strictly pseudocontractive mappings in uniformly smooth Banach spaces.     

Nonconvex differential calculus for infinite-dimensional multifunctions

The paper is concerned with generalized differentiation of set-valued mappings between Banach spaces. Our basic object is the so-called coderivative of multifunctions that was introduced earlier by the first author and has had a number of useful applications to nonlinear analysis, optimization, and control. This coderivative is a nonconvex-valued mapping which is related to sequential limits of Fréchet-like graphical normals but is not dual to any tangentially generated derivative of multifunctions. Using a variational approach, we develop a full calculus for the coderivative in the framework of Asplund spaces. The latter class is sufficiently broad and convenient for many important applications. Some useful calculus results are also obtained in general Banach spaces.This research was partially supported by the National Science Foundation under grants DMS-9206989 and DMS-9404128, by the USA-Israel grant 94-00237, and by the NATO contract CRG-950360.     

Variational sets: Calculus and applications to nonsmooth vector optimization

We develop elements of calculus of variational sets for set-valued mappings, which were recently introduced in Khanh and Tuan (2008) [1] and [2] to replace generalized derivatives in establishing optimality conditions in nonsmooth optimization. Most of the usual calculus rules, from chain and sum rules to rules for unions, intersections, products and other operations on mappings, are established. Direct applications in stability and optimality conditions for various vector optimization problems are provided.     

Openness properties for parametric set-valued mappings and implicit multifunctions

The aim of this paper is to obtain some openness results in terms of normal coderivative for parametric set-valued mappings acting between infinite dimensional spaces. Then, implicit multifunction results are obtained by simply specializing the openness results. Moreover, we study a kind of metric regularity of the implicit multifunction. The results of the paper generalize several recent results in literature.     

Proto-derivative formulas for basic subgradient mappings in mathematical programming

Subgradient mappings associated with various convex and nonconvex functions are a vehicle for stating optimality conditions, and their proto-differentiability plays a role therefore in the sensitivity analysis of solutions to problems of optimization. Examples of special interest are the subgradients of the max of finitely manyC ² functions, and the subgradients of the indicator of a set defined by finitely manyC ² constraints satisfying a basic constraint qualification. In both cases the function has a property called full amenability, so the general theory of existence and calculus of proto-derivatives of subgradient mappings associated with fully amenable functions is applicable. This paper works out the details for such examples. A formula of Auslender and Cominetti in the case of a max function is improved in particular.This work was supported in part by the Natural Sciences and Engineering Research Council of Canada under grant OGP41983 for the first author and by the National Science Foundation under grant DMS-9200303 for the second author.     

On mappings covering at a nonlinear rate and their perturbation stability

The present paper contains a study of covering (alias, openness) properties at a nonlinear rate for set-valued mappings between metric spaces. Such study is focussed on the stability of these properties in the presence of perturbations. A crucial result valid for linear openness, known as Milyutin’s theorem, is extended to set-valued mappings covering at a nonlinear rate under possibly non-Lipschitz perturbations. Consequently, a Lyusternik type theorem is derived from such extension and a general penalization principle for constrained optimization problems, which exploits nonlinear covering properties, is presented.     

A new method for solving equilibrium problem fixed point problem and variational inequality problem with application to optimization

In this paper, we introduce a new iterative scheme for finding a common element of the set of solutions of an equilibrium problem, the set of common fixed point for a family of infinitely nonexpansive mappings and the set of solutions of the variational inequality for α$\alpha$-inverse-strongly monotone mappings in a Hilbert space. Under suitable conditions, some strong convergence theorems for approximating a common element of the above three sets are obtained. As applications, at the end of the paper we utilize our results to study the optimization problem and some convergence problem for strictly pseudocontractive mappings. The results presented in the paper extend and improve some recent results of Yao and Yao [Y.Y. Yao, J.C. Yao, On modified iterative method for nonexpansive mappings and monotone mappings, Appl. Math. Comput. 186 (2) (2007) 1551–1558], Plubtieng and Punpaeng [S. Plubtieng, R. Punpaeng, A new iterative method for equilibrium problems and fixed point problems of nonlinear mappings and monotone mappings, Appl. Math. Comput. (2007) doi:10.1016/j.amc.2007.07.075], S. Takahashi and W. Takahashi [S. Takahashi, W. Takahashi, Viscosity approximation methods for Equilibrium problems and fixed point problems in Hilbert spaces, J. Math. Anal. Appl. 331 (2006) 506–515], Su, Shang and Qin [Y.F. Su, M.J. Shang, X.L. Qin, An iterative method of solution for equilibrium and optimization problems, Nonlinear Anal. (2007) doi:10.1016/j.na.2007.08.045] and Chang, Cho and Kim [S.S. Chang, Y.J. Cho, J.K. Kim, Approximation methods of solutions for equilibrium problem in Hilbert spaces, Dynam. Systems Appl. (in print)].     

Linearly perturbed polyhedral normal cone mappings and applications

Under a mild regularity assumption, we derive an exact formula for the Fréchet coderivative and some estimates for the Mordukhovich coderivative of the normal cone mappings of perturbed polyhedra in reflexive Banach spaces. Our focus point is a positive linear independence condition, which is a relaxed form of the linear independence condition employed recently by Henrion et al. (2010) [1], and Nam (2010) [3]. The formulae obtained allow us to get new results on solution stability of affine variational inequalities under linear perturbations. Thus, our paper develops some aspects of the work of Henrion et al. (2010) [1] Nam (2010) [3] Qui (in press) [12] and Yao and Yen (2009) [6] and [7].     

Necessary optimality conditions for weak sharp minima in set-valued optimization

The aim of the present paper is to get necessary optimality conditions for a general kind of sharp efficiency for set-valued mappings in infinite dimensional framework. The efficiency is taken with respect to a closed convex cone and as the basis of our conditions we use the Mordukhovich generalized differentiation. We have divided our work into two main parts concerning, on the one hand, the case of a solid ordering cone and, on the other hand, the general case without additional assumptions on the cone. In both situations, we derive some scalarization procedures in order to get the main results in terms of the Mordukhovich coderivative, but in the general case we also carryout a reduction of the sharp efficiency to the classical Pareto efficiency which, in addition with a new calculus rule for Fréchet coderivative of a difference between two maps, allows us to obtain some results in Fréchet form.     

General existence theorems, alternative theorems and applications to minimax problems

We establish general theorems on maximal elements, coincidence points and nonempty intersections for set-valued mappings on GFC-spaces and show their equivalence. Applying them we derive equivalent forms of alternative theorems. As applications, we develop in detail general types of minimax theorems. The results obtained improve or include as special cases several recent ones in the literature.     

Dynamic programming for stochastic target problems and geometric flows

Given a controlled stochastic process, the reachability set is the collection of all initial data from which the state process can be driven into a target set at a specified time. Differential properties of these sets are studied by the dynamic programming principle which is proved by the Jankov-von Neumann measurable selection theorem. This principle implies that the reachability sets satisfy a geometric partial differential equation, which is the analogue of the Hamilton-Jacobi-Bellman equation for this problem. By appropriately choosing the controlled process, this connection provides a stochastic representation for mean curvature type geometric flows. Another application is the super-replication problem in financial mathematics. Several applications in this direction are also discussed. Received October 24, 2000 / final version received July 24, 2001?Published online November 27, 2001     

Isoperimetric inequalities,Wulff shape and related questions for strongly nonlinear elliptic operators

We investigate the first eigenvalue of a highly nonlinear class of elliptic operators which includes the p--Laplace operator $\Delta_p u=\sum_i {{\partial}\over{\partial x_i}} (\vert\nabla u \vert^{p-2}{{\partial u}\over{\partial x_i}})$, the pseudo-p-Laplace operator $\tilde\Delta_p u=\sum_i {{\partial}\over{\partial x_i}} (\vert {{\partial u}\over{\partial x_i}} \vert^{p-2} {{\partial u}\over{\partial x_i}})$ and others. We derive the positivity of the first eingefunction, simlicity of the first eigenvalue, Faber-Krahn and Payne-Rayner type inequalities. In another chapter we address the question of symmetry for positive solutions to more general equations. Using a Pohozaev-type inequality and isoperimetric inequalities as well as convex rearrangement methods we generalize a symmetry result of Kesavan and Pacella. Our optimal domains are level sets of a convex function H ^o. They have the so-called Wulff shape associated with H and only in special cases they are Euclidean balls.     

Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets

Motivated by the subsmoothness of a closed set introduced by Aussel et al. (2005) [8], we introduce and study the uniform subsmoothness of a collection of infinitely many closed subsets in a Banach space. Under the uniform subsmoothness assumption, we provide an interesting subdifferential formula on distance functions and consider uniform metric regularity for a kind of multifunctions frequently appearing in optimization and variational analysis. Different from the existing works, without the restriction of convexity, we consider several fundamental notions in optimization such as the linear regularity, CHIP, strong CHIP and property (G) for a collection of infinitely many closed sets. We establish relationships among these fundamental notions for an arbitrary collection of uniformly subsmooth closed sets. In particular, we extend duality characterizations of the linear regularity for a collection of closed convex sets to the nonconvex setting.     

Minimizing the probability of lifetime ruin under borrowing constraints

We determine the optimal investment strategy of an individual who targets a given rate of consumption and who seeks to minimize the probability of going bankrupt before she dies, also known as lifetime ruin. We impose two types of borrowing constraints: First, we do not allow the individual to borrow money to invest in the risky asset nor to sell the risky asset short. However, the latter is not a real restriction because in the unconstrained case, the individual does not sell the risky asset short. Second, we allow the individual to borrow money but only at a rate that is higher than the rate earned on the riskless asset.We consider two forms of the consumption function: (1) The individual consumes at a constant (real) dollar rate, and (2) the individual consumes a constant proportion of her wealth. The first is arguably more realistic, but the second is closely connected with Merton’s model of optimal consumption and investment under power utility. We demonstrate that connection in this paper, as well as include a numerical example to illustrate our results.