Optimally Conditions for Pareto Nonsmooth Nonconvex Programming in Banach Spaces

In this paper, we consider a vector optimization problem where all functions involved are defined on Banach spaces. We obtain necessary and sufficient criteria for optimality in the form of Karush–Kuhn–Tucker conditions. We also introduce a nonsmooth dual problem and provide duality theorems.     

Ergodic theory and the duality principle on homogeneous spaces

We prove mean and pointwise ergodic theorems for the action of a lattice subgroup in a connected algebraic Lie group on infinite volume homogeneous algebraic varieties. Under suitable necessary conditions, our results are quantitative, namely we establish rates of convergence in the mean and pointwise ergodic theorems, which can be estimated explicitly. Our results give a precise and in most cases optimal quantitative form to the duality principle governing dynamics on homogeneous spaces. We illustrate their scope in a variety of equidistribution problems.     

Lagrange duality in canonical DC programming

We study Lagrange duality theorems for canonical DC programming problems. We show two types Lagrange duality results by using a decomposition method to infinite convex programming problems and by using a previous result by Lemaire (1998)  [6]. Also we observe these constraint qualifications for the duality theorems.     

Group duality with the topology of precompact convergence

The Pontryagin-van Kampen (P-vK) duality, defined for topological Abelian groups, is given in terms of the compact-open topology. Polar reflexive spaces, introduced by Köthe, are those locally convex spaces satisfying duality when the dual space is equipped with the precompact-open topology. It is known that the additive groups of polar reflexive spaces satisfy P-vK duality. In this note we consider the duality of topological Abelian groups when the topology of the dual is the precompact-open topology. We characterize the precompact reflexive groups, i.e., topological groups satisfying the group duality defined in terms of the precompact-open topology. As a consequence, we obtain a new characterization of polar reflexive spaces. We also present an example of a space which satisfies P-vK duality and is not polar reflexive. Some of our results respond to questions appearing in the literature.     

On grand Lebesgue spaces on sets of infinite measure

We consider grand Lebesgue spaces on sets of infinite measure and study the dependence of these spaces on the choice of the so‐called. We also consider Mikhlin and Marcinkiewicz theorems on Fourier multipliers in the setting of grand spaces.     

Multiobjective DC programs with infinite convex constraints

New results are established for multiobjective DC programs with infinite convex constraints (MOPIC) that are defined on Banach spaces (finite or infinite dimensional) with objectives given as the difference of convex functions. This class of problems can also be called multiobjective DC semi-infinite and infinite programs, where decision variables run over finite-dimensional and infinite-dimensional spaces, respectively. Such problems have not been studied as yet. Necessary and sufficient optimality conditions for the weak Pareto efficiency are introduced. Further, we seek a connection between multiobjective linear infinite programs and MOPIC. Both Wolfe and Mond-Weir dual problems are presented, and corresponding weak, strong, and strict converse duality theorems are derived for these two problems respectively. We also extend above results to multiobjective fractional DC programs with infinite convex constraints. The results obtained are new in both semi-infinite and infinite frameworks.     

Combinatorial covers and vanishing of cohomology

We use a Mayer–Vietoris-like spectral sequence to establish vanishing results for the cohomology of complements of linear and elliptic hyperplane arrangements, as part of a more general framework involving duality and abelian duality properties of spaces and groups. In the process, we consider cohomology of local systems with a general, Cohen–Macaulay-type condition. As a result, we recover known vanishing theorems for rank-1 local systems as well as group ring coefficients and obtain new generalizations.     

Duality theorems for a new class of multitime multiobjective variational problems

In this work, we consider a new class of multitime multiobjective variational problems of minimizing a vector of functionals of curvilinear integral type. Based on the normal efficiency conditions for multitime multiobjective variational problems, we study duals of Mond-Weir type, generalized Mond-Weir-Zalmai type and under some assumptions of (??, b)-quasiinvexity, duality theorems are stated. We give weak duality theorems, proving that the value of the objective function of the primal cannot exceed the value of the dual. Moreover, we study the connection between values of the objective functions of the primal and dual programs, in direct and converse duality theorems. While the results in §1 and §2 are introductory in nature, to the best of our knowledge, the results in §3 are new and they have not been reported in literature.     

广义次似凸集值优化的对偶定理

我们讨论了广义次似凸集值优化的对偶定理.首先,我们给出了广义次似凸集值优化的对偶问题.其次,我们给出了广义次似凸集值优化的对偶定理.最后,我们考虑了广义次似凸集值优化问题的标量化对偶,并给出了一系列对偶定理.     

Probabilities of Pure Nash Equilibria in Matrix Games when the Payoff Entries of One Player Are Randomly Selected

The Nash equilibrium in pure strategies represents an important solution concept in nonzero sum matrix games. Existence of Nash equilibria in games with known and with randomly selected payoff entries have been studied extensively. In many real games, however, a player may know his own payoff entries but not the payoff entries of the other player. In this paper, we consider nonzero sum matrix games where the payoff entries of one player are known, but the payoff entries of the other player are assumed to be randomly selected. We are interested in determining the probabilities of existence of pure Nash equilibria in such games. We characterize these probabilities by first determining the finite space of ordinal matrix games that corresponds to the infinite space of matrix games with random entries for only one player. We then partition this space into mutually exclusive spaces that correspond to games with no Nash equilibria and with r Nash equilibria. In order to effectively compute the sizes of these spaces, we introduce the concept of top-rated preferences minimal ordinal games. We then present a theorem which provides a mechanism for computing the number of games in each of these mutually exclusive spaces, which then can be used to determine the probabilities. Finally, we summarize the results by deriving the probabilities of existence of unique, nonunique, and no Nash equilibria, and we present an illustrative example.     

Duality and saddle-points for convex-like vector optimization problems on real linear spaces

Usually, finite dimensional linear spaces, locally convex topological linear spaces or normed spaces are the framework for vector and multiojective optimization problems. Likewise, several generalizations of convexity are used in order to obtain new results. In this paper we show several Lagrangian type duality theorems and saddle-points theorems. From these, we obtain some characterizations of several efficient solutions of vector optimization problems (VOP), such as weak and proper efficient solutions in Benson’s sense. These theorems are generalizations of preceding results in two ways. Firstly, because we consider real linear spaces without any particular topology, and secondly because we work with a recently appeared convexlike type of convexity. This new type, designated GVCL in this paper, is based on a new algebraic closure which we named vector closure. This research for the second author was partially supported by Ministerio de Ciencia y Tecnología (Spain), project BFM2003-02194.     

Infinite dimensional duality and applications

The usual duality theory cannot be applied to infinite dimensional problems because the underlying constraint set mostly has an empty interior and the constraints are possibly nonlinear. In this paper we present an infinite dimensional nonlinear duality theory obtained by using new separation theorems based on the notion of quasi-relative interior, which, in all the concrete problems considered, is nonempty. We apply this theory to solve the until now unsolved problem of finding, in the infinite dimensional case, the Lagrange multipliers associated to optimization problems or to variational inequalities. As an example, we find the Lagrange multiplier associated to a general elastic–plastic torsion problem.     

Boolean-rank-preserving operators and Boolean-rank-1 spaces

We study the extent to which certain theorems on linear operators on field-valued matrices carry over to linear operators on Boolean matrices. We obtain analogues and near analogues of several such theorems. One of these leads us to consider linear spaces of m × n Boolean matrices whose nonzero members all have Boolean rank 1. We obtain a structure theorem for such spaces that enables us to determine the maximum Boolean dimension of such spaces and their maximum cardinality.     

Strong convergence of an iterative algorithm for an infinite family of strict pseudo-contractions in Banach spaces

In this paper, we introduce a new W-mapping and present an iterative algorithm for an infinite family of strict pseudo-contractions. Strong convergence theorems are proved in Banach spaces. Our results improve and extend the corresponding result announced by Cai and Hu [G. Cai, C. Hu, Strong convergence theorems of modified Ishikawa iterative process with errors for an infinite family of strict pseudo-contractions, Nonlinear Anal. 71(12) (2009) 6044-6053].     

Groups acting on tree-graded spaces and splittings of relatively hyperbolic groups

Tree-graded spaces are generalizations of R-trees. They appear as asymptotic cones of groups (when the cones have cut-points). Since many questions about endomorphisms and automorphisms of groups, solving equations over groups, studying embeddings of a group into another group, etc. lead to actions of groups on the asymptotic cones, it is natural to consider actions of groups on tree-graded spaces. We develop a theory of such actions which generalizes the well-known theory of groups acting on R-trees. As applications of our theory, we describe, in particular, relatively hyperbolic groups with infinite groups of outer automorphisms, and co-Hopfian relatively hyperbolic groups.     

Some generalizations of Fedorchuk duality theorem—I

Generalizing duality theorem of V.V. Fedorchuk [V.V. Fedorchuk, Boolean δ-algebras and quasi-open mappings, Sibirsk. Mat. Zh. 14 (5) (1973) 1088-1099; English translation: Siberian Math. J. 14 (1973) 759-767 (1974)], we prove Stone-type duality theorems for the following four categories: the objects of all of them are the locally compact Hausdorff spaces, and their morphisms are, respectively, the continuous skeletal maps, the quasi-open perfect maps, the open maps, the open perfect maps. In particular, a Stone-type duality theorem for the category of compact Hausdorff spaces and open maps is obtained. Some equivalence theorems for these four categories are stated as well; two of them generalize the Fedorchuk equivalence theorem [V.V. Fedorchuk, Boolean δ-algebras and quasi-open mappings, Sibirsk. Mat. Zh. 14 (5) (1973) 1088-1099; English translation: Siberian Math. J. 14 (1973) 759-767 (1974)].     

A class of infinite dimensional linear programming problems

We study the infinite dimensional linear programming problem. The previous work done on this subject defined the dual problem in a small space and derived duality results for such pairs of problems. But because of that and of the strong requirements on the functions involved, those theorems do not actually hold in many applications. With our formulation, we define the dual problem in a larger space and obtain new duality results under, generally, mild assumptions. Furthermore, the solutions turn out to be extreme points of the unbounded, but w¹-locally compact, feasibility set. For this purpose, we did not try a constructive proof of our duality results, but instead we examine the problem from a more abstract point of view and derive results using general ideas from the theory of convex analysis in normed spaces [R. T. Rockafellar, “Conjugate Duality and Optimization,” SIAM, Philadelphia, Penn., 1973, and R. Holmes, “Geometric Functional Analysis,” Springer-Verlag, New York, 1975]. Our work extends previous results in this area, which appeared in [N. Levinson, J. Math. Anal. Appl.16 (1965) 73–83, and W. Tundall, SIAM J. Appl. Math.13 (1965), 644–666].     

Approximation by polynomials and smooth functions in Sobolev spaces with respect to measures

The density of polynomials is straightforward to prove in Sobolev spaces W^k,p((a,b)), but there exist only partial results in weighted Sobolev spaces; here we improve some of these theorems. The situation is more complicated in infinite intervals, even for weighted L^p spaces; besides, in the present paper we have proved some other results for weighted Sobolev spaces in infinite intervals.     

多目标分式规划逆对偶研究

考虑了一类可微多目标分式规划问题.首先,建立原问题的两个对偶模型.随后,在相关文献的弱对偶定理基础上,利用Fritz John型必要条件,证明了相应的逆对偶定理.     

Duality in infinite dimensional linear programming

We consider the class of linear programs with infinitely many variables and constraints having the property that every constraint contains at most finitely many variables while every variable appears in at most finitely many constraints. Examples include production planning and equipment replacement over an infinite horizon. We form the natural dual linear programming problem and prove strong duality under a transversality condition that dual prices are asymptotically zero. That is, we show, under this transversality condition, that optimal solutions are attained in both primal and dual problems and their optimal values are equal. The transversality condition, and hence strong duality, is established for an infinite horizon production planning problem.This material is based on work supported by the National Science Foundation under Grant No. ECS-8700836.