Existence of Solutions and Variational Principles for Generalized Vector Systems

By means of generalized KKM theory, we prove a result on the existence of solutions and we establish general variational principles, that is, vector optimization formulations of set-valued maps for vector generalized systems. A perturbation function is involved in general variational principles. We extend the theory of gap functions for vector variational inequalities to vector generalized systems and we prove that the solution sets of the related vector optimization problems of set-valued maps contain the solution sets of vector generalized systems. A further vector optimization problem is defined in such a way that its solution set coincides with the solution set of a weak vector generalized system. Research carried on within the agreement between National Sun Yat-Sen University of Kaohsiung, Taiwan and Pisa University, Pisa, Italy, 2007. L.C. Ceng research was partially supported by the National Science Foundation of China (10771141), Ph.D. Program Foundation of Ministry of Education of China (20070270004), and Science and Technology Commission of Shanghai Municipality grant (075105118). J.C. Yao research was partially supported by the National Science Center for Theoretical Sciences at Tainan.     

Collusive game solutions via optimization

A Nash-based collusive game among a finite set of players is one in which the players coordinate in order for each to gain higher payoffs than those prescribed by the Nash equilibrium solution. In this paper, we study the optimization problem of such a collusive game in which the players collectively maximize the Nash bargaining objective subject to a set of incentive compatibility constraints. We present a smooth reformulation of this optimization problem in terms of a nonlinear complementarity problem. We establish the convexity of the optimization problem in the case where each player's strategy set is unidimensional. In the multivariate case, we propose upper and lower bounding procedures for the collusive optimization problem and establish convergence properties of these procedures. Computational results with these procedures for solving some test problems are reported. It is with great honor that we dedicate this paper to Professor Terry Rockafellar on the occasion of his 70th birthday. Our work provides another example showing how Terry's fundamental contributions to convex and variational analysis have impacted the computational solution of applied game problems. This author's research was partially supported by the National Science Foundation under grant ECS-0080577. This author's research was partially supported by the National Science Foundation under grant CCR-0098013.     

Hybrid Steepest Descent Methods for Zeros of Nonlinear Operators with Applications to Variational Inequalities

In this paper, the hybrid steepest descent methods are extended to develop new iterative schemes for finding the zeros of bounded, demicontinuous and φ-strongly accretive mappings in uniformly smooth Banach spaces. Two iterative schemes are proposed. Strong convergence results are established and applications to variational inequalities are given. In this research, the first author was partially supported by the National Science Foundation of China (10771141), Ph.D. Program Foundation of Ministry of Education of China (20070270004), and Science and Technology Commission of Shanghai Municipality (075105118). The third author was partially supported by Grant NSC 96-2628-E-110-014-MY3.     

A unified approach to the feasible point method type for nonlinear programming with linear constraints under degeneracy and the convergence properties

In this paper, we introduce a general class of feasible point algorithms for solving nonlinear programming problems with linear constraints under degeneracy. Many wellknown algorithms are its special cases. Also, many new algorithms can be derived from this general class. Under rather simple conditions, we prove the global convergence property for this class of algorithms.This research was partially supported by the National Natural Science Foundation of China. The first author's research was partially also supported by the National Science Foundation of the United States of America under Grant DCR-86-96135.     

On the characterization of strong convergence of an iterative algorithm for a class of multi-valued variational inclusions

This paper introduces an Ishikawa type iterative algorithm for finding approximating solutions of a class of multi-valued variational inclusion problems. Characterization of strong convergence of this iterative method is established. L. C. Ceng’s research partially supported by the Teaching and Research Award Fund for Outstanding Young Teachers in Higher Education Institutions of MOE, China and the Dawn Program Foundation in Shanghai. S. Schaible’s research partially supported by the National Science Council of Taiwan. This research was partially supported by the grant NSC 96-2628-E-110-014-MY3.     

A hybrid extragradient method for general variational inequalities

In this paper, we introduce and study a hybrid extragradient method for finding solutions of a general variational inequality problem with inverse-strongly monotone mapping in a real Hilbert space. An iterative algorithm is proposed by virtue of the hybrid extragradient method. Under two sets of quite mild conditions, we prove the strong convergence of this iterative algorithm to the unique common element of the set of fixed points of a nonexpansive mapping and the set of solutions of the general variational inequality problem, respectively. L. C. Zeng’s research was partially supported by the National Science Foundation of China (10771141), Ph.D. Program Foundation of Ministry of Education of China (20070270004), and Science and Technology Commission of Shanghai Municipality grant (075105118). J. C. Yao’s research was partially supported by a grant from the National Science Council of Taiwan.     

A likelihood-MPEC approach to target classification

In this paper we develop a method for classifying an unknown data vector as belonging to one of several classes. This method is based on the statistical methods of maximum likehood and borrowed strength estimation. We develop an MPEC procedure (for Mathematical Program with Equilibrium Constraints) for the classification of a multi-dimensional observation, using a finite set of observed training data as the inputs to a bilevel optimization problem. We present a penalty interior point method for solving the resulting MPEC and report numerical results for a multispectral minefield classification application. Related approaches based on conventional maximum likehood estimation and a bivariate normal mixture model, as well as alternative surrogate classification objective functions, are described. Received: October 26, 1998 / Accepted: June 11, 2001?Published online March 24, 2003 RID="***" ID="***"The authors of this work were all partially supported by the Wright Patterson Air Force Base via Veda Contract F33615-94-D-1400. The first and third author were also supported by the National Science Foundation under grant DMS-9705220. RID="*" ID="*"The work of this author was based on research supported by the U.S. National Science Foundation under grant CCR-9624018. RID="**" ID="**"The work of this author was supported by the Office of Naval Research under grant N00014-95-1-0777.     

Generalized Differential Properties of the Auslender Gap Function for Variational Inequalities

In this note, the Auslender gap function, which is used to formulate a variational inequality into an equivalent minimization problem, is shown to be differentiable in the generalized sense and has a lower contingent derivative under suitable conditions. This enables us to establish necessary and sufficient conditions for the existence of a solution to problems of variational inequalities.This research was partially supported by the National Natural Science Foundation of China and the Research Committee of Hong Kong Polytechnic University. Communicated by F. Giannessi     

Epi-convergent discretization of the generalized Bolza problem in dynamic optimization

The paper is devoted to well-posed discrete approximations of the so-called generalized Bolza problem of minimizing variational functionals defined via extended-real-valued functions. This problem covers more conventional Bolza-type problems in the calculus of variations and optimal control of differential inclusions as well of parameterized differential equations. Our main goal is find efficient conditions ensuring an appropriate epi-convergence of discrete approximations, which plays a significant role in both the qualitative theory and numerical algorithms of optimization and optimal control. The paper seems to be the first attempt to study epi-convergent discretizations of the generalized Bolza problem; it establishes several rather general results in this direction. Research of B. S. Mordukhovich was partially supported by the USA National Science Foundation under grants DMS-0304989 and DMS-0603846 and by the Australian Research Council under grant DP-0451168. Research of T. Pennanen was supported by the Finnish Academy of Sciences under contract No. 3385.     

Complementarity formulations and existence of solutions of dynamic multi-rigid-body contact problems with coulomb friction

In this paper, we study the problem of predicting the acceleration of a set of rigid, 3-dimensional bodies in contact with Coulomb friction. The nonlinearity of Coulomb's law leads to a nonlinear complementarity formulation of the system model. This model is used in conjunction with the theory of quasi-variational inequalities to prove for the first time that multi-rigid-body systems with all contacts rolling always has a solution under a feasibility-type condition. The analysis of the more general problem with sliding and rolling contacts presents difficulties that motivate our consideration of a relaxed friction law. The corresponding complementarity formulations of the multi-rigid-body contact problem are derived and existence of solutions of these models is established. The research of this author was based on work supported by the National, Science Foundation under grants DDM-9104078 and CCR-9213739. The research of this author was partially supported by the National Science Foundation under grant IRI-9304734, by the Texas Advanced Research Program grant 999903-078, and by the Texas Advanced Technology Program under grant 999903-095.     

Solution differentiability and continuation of Newton's method for variational inequality problems over polyhedral sets

In this paper, we derive some further differentiability properties of solutions to a parametric variational inequality problem defined over a polyhedral set. We discuss how these results can be used to establish the feasibility of continuation of Newton's method for solving the variational problem in question.This work was based on research supported by the National Science Foundation under Grant No. ECS-87-17968.     

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.     

Tolerance relations on eventually regular semigroups

A semigroup is called eventually regular if a power of each element is regular. Regular and group-bound semigroups are each eventually regular. A tolerance relation on an eventually regular semigroup is introduced, and Lallement's result for regular semigroups is generalized to eventually regular semigroups. Weakly compatible tolerances on semigroups are studied. This research was partially supported by the National Science Foundation of Qufu Normal University. The author wishes to thank T. E. Hall for his comments and help in preparing this paper for publication.     

An interior point potential reduction method for constrained equations

We study the problem of solving a constrained system of nonlinear equations by a combination of the classical damped Newton method for (unconstrained) smooth equations and the recent interior point potential reduction methods for linear programs, linear and nonlinear complementarity problems. In general, constrained equations provide a unified formulation for many mathematical programming problems, including complementarity problems of various kinds and the Karush-Kuhn-Tucker systems of variational inequalities and nonlinear programs. Combining ideas from the damped Newton and interior point methods, we present an iterative algorithm for solving a constrained system of equations and investigate its convergence properties. Specialization of the algorithm and its convergence analysis to complementarity problems of various kinds and the Karush-Kuhn-Tucker systems of variational inequalities are discussed in detail. We also report the computational results of the implementation of the algorithm for solving several classes of convex programs. The work of this author was based on research supported by the National Science Foundation under grants DDM-9104078 and CCR-9213739 and the Office of Naval Research under grant N00014-93-1-0228. The work of this author was based on research supported by the National Science Foundation under grant DMI-9496178 and the Office of Naval Research under grants N00014-93-1-0234 and N00014-94-1-0340.     

A survey of Markov decision models for control of networks of queues

We review models for the optimal control of networks of queues. Our main emphasis is on models based on Markov decision theory and the characterization of the structure of optimal control policies.This research was partially supported by the National Science Foundation under Grant No. DDM-8719825. The Government has certain rights in this material. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation. The research was also partially supported by the C.I.E.S. (France), while the author was on leave at INRIA, Sophia-Antipolis, 1991–92.     

Topological spaces related to the Banach-Mazur game and the generic well-posedness of optimization problems

The existence of special kind of winning strategies in the Banach-Mazur game in a completely regular topological spaceX is shown to be equivalent to generic stability properties of optimization problems generated by the continuous bounded real-valued functions inX.Research partially supported by the National Foundation for Scientific Research at the Bulgarian Ministry of Education and Science under Grant Number MM-408/94.     

Some more identities of the Rogers-Ramanujan type

In this we paper we prove several new identities of the Rogers-Ramanujan-Slater type. These identities were found as the result of computer searches. The proofs involve a variety of techniques, including series-series identities, Bailey pairs, a theorem of Watson on basic hypergeometric series, generating functions and miscellaneous methods. The research of the first author was partially supported by National Science Foundation grant DMS-0300126.     

Properties of compact complex manifolds carrying closed positive currents

We show that a compact complex manifold is Moishezon if and only if it carries a strictly positive, integral (1, 1)-current. We then study holomorphic line bundles carrying singular hermitian metrics with semi-positive curvature currents, and we give some cases in which these line bundles are big. We use these cases to provide sufficient conditions for a compact complex manifold to be Moishezon in terms of the existence of certain semi-positive, integral (1,1)-currents. We also show that the intersection number of two closed semi-positive currents of complementary degrees on a compact complex manifold is positive when the intersection of their singular supports is contained in a Stein domain. The first author was partially supported by National Science Foundation Grant Nos. DMS-8922760 and DMS-9204273. The second author was partially supported by National Science Foundation Grant Nos. DMS-9001365 and DMS-9204037.     

Connectedness of the Set of Efficient Solutions for Generalized Systems

We introduce the concept of positive proper efficient solutions to the generalized system in this paper. We show that, under some suitable conditions, the set of positive proper efficient solutions is dense in the set of efficient solutions to the generalized system. We discuss also the connectedness of the set of efficient solutions for the generalized system with monotone bifunctions in real locally convex Hausdorff topological vector spaces. This research was partially supported by the National Natural Science Foundation of China (10561007), the Natural Science Foundation of Jiangxi Province, China, and a grant from the National Science Council of ROC.