On Linear Programming Duality and Necessary and Sufficient Conditions in Minimax Theory

In this paper we discuss necessary and sufficient conditions for different minimax results to hold using only linear programming duality and the finite intersection property for compact sets. It turns out that these necessary and sufficient conditions have a clear interpretation within zero-sum game theory. We apply these results to derive necessary and sufficient conditions for strong duality for a general class of optimization problems. The authors like to thank the comments of the anonymous referees for their remarks, which greatly improved the presentation of this paper.     

拓扑交性质与极大极小定理

本文得到一个一般的拓扑型有限交性质,并将所得结果应用于研究拓扑型极大极小定理     

Adaptive methods for solvings minimax problems ∗

We consider finite-dimensional minimax problems for two traditional models: firstly,with box constraints at variables and,secondly,taking into account a finite number of tinear inequalities. We present finite exact primal and dual methods. These methods are adapted to a great extent to the specific structure of the cost function which is formed by a finite number of linear functions. During the iterations of the primal method we make use of the information from the dual problem, thereby increasing effectiveness. To improve the dual method we use the “long dual step” rule (the principle of ullrelaxation).The results are illustrated by numerical experiments.     

Optimality Conditions and Duality in Nondifferentiable Minimax Fractional Programming with Generalized Convexity

We establish sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems involving (F, α, ρ, d)-convexity. Subsequently, we apply the optimality conditions to formulate two types of dual problems and prove appropriate duality theorems. The authors thank the referee for valuable suggestions improving the presentation of the paper.     

Some Intersection Theorems and Minimax Inequalities

This paper proves some intersection theorems. The proofs are new in the sense that they do not require the finite intersection property. As an application, some of the Fan minimax inequalities are proved.     

Inequalities and Nash equilibria

This paper concentrates on the problem of the existence of equilibrium points for non-cooperative generalized N-person games, N-person games of normal form and their related inequalities. We utilize the K-K-M lemma to obtain a theorem and then use it to obtain a new Fan-type inequality and minimax theorems. Various new equilibrium point theorems are derived, with the necessary and sufficient conditions and with strategy spaces with no fixed point property. Examples are given to demonstrate that these existence theorems cover areas where other existence theorems break down.     

Mixed duality without a constraint qualification for minimax fractional programming

Without the need of a constraint qualification, we establish the necessary and sufficient optimality conditions for minimax fractional programming. Using these optimality conditions, we construct a mixed dual model which unifies the Mond–Weir dual, Wolfe dual and a parameter dual models. Several duality theorems are established. Consequently, this article partly solves the problem posed by Lai et al. [H.C. Lai, J.C. Liu and K. Tanaka (1999). Duality without a constraint qualification for minimax fractional programming. Journal of Optimization Theory and Applications, 101, 109–125.].     

Necessary and Sufficient Conditions for Minimax Fractional Programming

We establish the necessary and sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems solving generalized convex functions. Subsequently, we apply the optimality conditions to formulate one parametric dual problem and we prove weak duality, strong duality, and strict converse duality theorems.     

Nondifferentiable Minimax Fractional Programming Problems with (C, α, ρ, d)-Convexity

In this paper, we present necessary optimality conditions for nondifferentiable minimax fractional programming problems. A new concept of generalized convexity, called (C, α, ρ, d)-convexity, is introduced. We establish also sufficient optimality conditions for nondifferentiable minimax fractional programming problems from the viewpoint of the new generalized convexity. When the sufficient conditions are utilized, the corresponding duality theorems are derived for two types of dual programs. This research was partially supported by NSF and Air Force grants     

二次损失下任意秩有限总体中的线性Minimax预测

本文对通常的二次损失作了适当的修改,在此基础上研究了一个预测在齐次线性预测函数类中的极大极小性。得到了任意秩有限总体中线性可预测变量的唯一线性Minimax预测(有关唯一性在几乎处处意义下理解)。     

Generalized KKM theorems on hyperconvex metric spaces and some applications

In this work, we establish the intersection property for a family of admissible subsets in a hyperconvex metric space, and we apply this intersection property to get generalized KKM theorems, coincidence theorems, variational inequality theorems and minimax inequality theorems.     

矩阵损失下有限总体中的局部线性Minimax预测

该文在矩阵损失下研究线性预测函数的局部极大极小性．在适当的假设下,得到了任意秩有限总体中的可预测变量的唯一的局部线性Ｍｉｎｉｍａｘ预测．（有关唯一性在几乎处处意义下理解）．     

Some extensions of fan's best approximation theorem

A well-known Ky Fan's best approximation theorem which has been of great importance in nonlinear analysis, game theory, and minimax theorems is extended to a class of factorizable multifunctions.     

非紧的一般化凸空间上不动点定理和supinfsup不等式

利用一般化凸空间上的KKM型定理得到有限交定理,然后作为应用讨论了在没有紧性限制的一般化凸空间上集值映射的不动点的存在问题以及Von Neumann-Fan型supinfsup不等式(等式)问题,最后给出了极大极小等式.     

正态分布下任意秩有限总体中的Minimax预测

对于任意秩有限总体,在二次损失下,有关文献已给出了线性可预测变量在齐次线性预测类中的唯一线性Minimax预测．本文在正态假设下,证明了这个线性Minimax预测也是线性可预测变量在一切预测类中的唯一Minimax预测．     

Fixed point theorems for better admissible multimaps on almost convex sets

We obtain new fixed point theorems on multimaps in the class Bp defined on almost convex subsets of topological vector spaces. Our main results are applied to deduce various fixed point theorems, coincidence theorems, almost fixed point theorems, intersection theorems, and minimax theorems. Consequently, our new results generalize well-known works of Kakutani, Fan, Browder, Himmelberg, Lassonde, and others.     

Measurability and countable separation

We introduce several types of countable separation and we give necessary and sufficient conditions, in terms of measurability of some sets constructed by means of multifunctions, in order that a topological space satisfies such a property. We give a characterization of measurability of multifunctions in terms of their graphs.     

Interpolation by universal,hypercyclic functions

In the present article we study an interpolation problem for classes of analytic functions, in a systematic manner. More precisely, we provide sufficient conditions so that proper and “big”, in the Baire category sense, subclasses of analytic functions have an interpolation property at an infinite set of points. We then apply our main theorems to several classes of universal, hypercyclic functions.     

Stability for trust-region methods via generalized differentiation

We obtain necessary and sufficient conditions for local Lipschitz-like property and sufficient conditions for local metric regularity in Robinson’s sense of Karush–Kuhn–Tucker point set maps of trust-region subproblems in trust-region methods. The main tools being used in our investigation are dual criteria for fundamental properties of implicit multifunctions which are established on the basis of generalized differentiation of normal cone mappings.     

Maximal Monotone Multifunctions of Brøndsted–Rockafellar Type

We consider whether the “inequality-splitting” property established in the Brøndsted–Rockafellar theorem for the subdifferential of a proper convex lower semicontinuous function on a Banach space has an analog for arbitrary maximal monotone multifunctions. We introduce the maximal monotone multifunctions of type (ED), for which an “inequality-splitting” property does hold. These multifunctions form a subclass of Gossez"s maximal monotone multifunctions of type (D); however, in every case where it has been proved that a multifunction is maximal monotone of type (D) then it is also of type (ED). Specifically, the following maximal monotone multifunctions are of type (ED): ? ultramaximal monotone multifunctions, which occur in the study of certain nonlinear elliptic functional equations; ? single-valued linear operators that are maximal monotone of type (D); ? subdifferentials of proper convex lower semicontinuous functions; ? “subdifferentials” of certain saddle-functions. We discuss the negative alignment set of a maximal monotone multifunction of type (ED) with respect to a point not in its graph – a mysterious continuous curve without end-points lying in the interior of the first quadrant of the plane. We deduce new inequality-splitting properties of subdifferentials, almost giving a substantial generalization of the original Brøndsted–Rockafellar theorem. We develop some mathematical infrastructure, some specific to multifunctions, some with possible applications to other areas of nonlinear analysis: ? the formula for the biconjugate of the pointwise maximum of a finite set of convex functions – in a situation where the “obvious” formula for the conjugate fails; ? a new topology on the bidual of a Banach space – in some respects, quite well behaved, but in other respects, quite pathological; ? an existence theorem for bounded linear functionals – unusual in that it does not assume the existence of any a priori bound; ? the 'big convexification" of a multifunction.