Generalization of an Existence Theorem for Variational Inequalities

By using the concept of exceptional family of elements, Zhao proposed a new existence theorem for variational inequalities over a general nonempty closed convex set (Ref. 1, Theorem 2.3), which is a generalization of the well-known Moré's existence theorem for nonlinear complementarity problems. The proof of Theorem 2.3 in Ref. 1 depends strongly on the condition 0∈K. Since this condition is rather strict for a general variational inequality, Zhao proposed an open question at the end of Ref. 1: Can the condition 0∈K in Theorem 2.3 be removed? In this paper, we answer this open question. Furthermore, we present the new notion of exceptional family of elements and establish a theorem of the alternative, by which we develop two new existence theorems for variational inequalities. Our results generalize the Zhao existence result.     

Optimality conditions in multiobjective differentiable programming

A theorem stated in Ref. 1 is corrected.     

Generalized KKM theorems,minimax inequalities,and their applications

This paper extends the well-known KKM theorem and variational inequalities by relaxing the closedness of values of a correspondence and lower semicontinuity of a function. The approach adopted is based on Michael's continuous selection theorem. As applications, we provide theorems for the existence of maximum elements of a binary relation, a price equilibrium, and the complementarity problem. Thus our theorems, which do not require the openness of lower sections of the preference correspondences and the lower semicontinuity of the excess demand functions, generalize many of the existence theorems such as those in Sonnenschein (Ref. 1), Yannelis and Prabhakar (Ref. 2), and Border (Ref. 3).The author is grateful to Professor Franco Giannessi for helpful comments and suggestions.     

On convex vectorial optimization in linear spaces

We give a new method of scalarization for convex vectorial optimization problems, with applications to best vectorial approximation and to scalar problems of optimization and best approximation.This research was supported in part by NCR A-8108, FCAC 74-09, and GETMA. The results of this paper have been obtained during the second author's visit, from May to September 1974, to the Département d'Informatique, Université de Montréal. The authors thank Dr. G. Godini for valuable remarks which simplified the original proof of the main result of this paper.     

Functions Without Exceptional Family of Elements and Complementarity Problems

In Ref. 1, Isac, Bulavski, and Kalashnikov introduced the concept of exceptional family of elements for a continuous function f: R ⁿR ⁿ. It is known that, if there does not exist an exceptional family of elements for f, then the corresponding complementarity problem has a solution. In this paper, we show that several classes of nonlinear functions, known in complementarity theory or other domains, are functions without exceptional family of elements and consequently the corresponding complementarity problem is solvable. It is evident that the notion of exceptional family of elements provides an alternative way of determining whether or not the complementarity problem has a solution.     

An Extension of the Coordinate Transformation Method for Open-Loop Nash Equilibria

In Leitmann (Ref. 1), a coordinate transformation method was introduced to obtain global solutions for free problems in the calculus of variations. This direct method was extended and broadened in Carlson (Ref. 2) and later in Leitmann (Ref. 3). The applicability of the original work of Leitmann (Ref. 1) was further developed in Dockner and Leitmann (Ref. 4) to include the class of open-loop dynamic games. In the present work, we improve the results of Ref. 4 in two directions. First, we enlarge the class of open-loop dynamic games to permit coupling among the dynamic equations via the states of the players; second, we incorporate the modifications given in Refs. 2 and 3. Our results greatly increase the applicability of this method. An example arising from the harvesting of a renewable resource is presented to illustrate the utility of our results.     

On the variational process in parameter optimization

This is a technical reply to the technical comment of Ref. 2 associated with the tutorial paper of Ref. 1.     

A critical condition for the cost density in the circular city model

Two inequalities in Ref. 1 are modified.     

On the Probability of Existence of Pure Equilibria in Matrix Games

In a recent paper (Ref. 1), Papavassilopoulos obtained results on the probability of the existence of pure equilibrium solutions in stochastic matrix games. We report a similar result, but where the payoffs are drawn from a finite set of numbers N. In the limiting case, as N tends to infinity, our result and that of Papavassilopoulos are identical. We also cite similar results obtained independently by others, some of which were already independently brought to the notice of Papavassilopoulos by Li Calzi as reported in Papavassilopoulos (Ref. 2). We cite a much earlier result obtained by Goldman (Ref. 3). We also cite our related work (Ref. 4), in which we derive the conditions for the existence of mixed strategy equilibria in two-person zero-sum games.     

Theorems of the alternative and optimality conditions

Several corrections to Ref. 1 are pointed out.     

On the Optimum Radius of Robust Stability for Schur Polynomials

A recent paper (Ref. 1) established a new approach to estimate the robust stability radius of a Schur polynomial. This note points out that the approach given in Ref. 1 is not correct and also gives a counterexample to the main result of Ref. 1.     

First-Order Necessary Optimality Conditions for General Bilevel Programming Problems

In Ref. 1, bilevel programming problems have been investigated using an equivalent formulation by use of the optimal value function of the lower level problem. In this comment, it is shown that Ref. 1 contains two incorrect results: in Proposition 2.1, upper semicontinuity instead of lower semicontinuity has to be used for guaranteeing existence of optimal solutions; in Theorem 5.1, the assumption that the abnormal part of the directional derivative of the optimal value function reduces to zero has to be replaced by the demand that a nonzero abnormal Lagrange multiplier does not exist.     

Weak Pareto optimality of multiobjective problems in a locally convex linear topological space

Several corrections to Ref. 1 are pointed out.     

Computational algorithm for a distributed optimal control problem of parabolic type with terminal inequality constraints

A corrigendum to Ref. 1 is given.     

About a Gap between Multiobjective Optimization and Scalar Optimization

We explain the reason for the existence of a gap between multiobjective and scalar optimization proposed in Ref. 1, giving a characterization of this gap.     

Exact controllability of a spherical cap: Numerical implementation of HUM

This paper deals with the numerical implementation of the exact boundary controllability of the Reissner model for shallow spherical shells (Ref. 1). The problem is attacked by the Hilbert uniqueness method (HUM, Refs. 2–4), and we propose a semidiscrete method for the numerical approximation of the minimization problem associated to the exact controllability problem. The numerical results compare well with the results obtained by a finite difference and conjugate gradient method in Ref. 5.This work was done when the first two authors were at CNR-IAC, Rome, Italy as Graduate Students.     

高速扩展平面应力裂纹尖端的各向异性塑性场的补充研究(Ⅰ)

文献[1]的结果对于β≥2的情形不适用,为此,我们用文献[1]和[2]的方法导出了β=2和β>2两者的高速扩展平面应力裂纹尖端的各向异性塑性场的一般表达式.     

Sequential Systems of Linear Equations Algorithm for Nonlinear Optimization Problems with General Constraints

In Ref. 1, a new superlinearly convergent algorithm of sequential systems of linear equations (SSLE) for nonlinear optimization problems with inequality constraints was proposed. At each iteration, this new algorithm only needs to solve four systems of linear equations having the same coefficient matrix, which is much less than the amount of computation required for existing SQP algorithms. Moreover, unlike the quadratic programming subproblems of the SQP algorithms (which may not have a solution), the subproblems of the SSLE algorithm are always solvable. In Ref. 2, it is shown that the new algorithm can also be used to deal with nonlinear optimization problems having both equality and inequality constraints, by solving an auxiliary problem. But the algorithm of Ref. 2 has to perform a pivoting operation to adjust the penalty parameter per iteration. In this paper, we improve the work of Ref. 2 and present a new algorithm of sequential systems of linear equations for general nonlinear optimization problems. This new algorithm preserves the advantages of the SSLE algorithms, while at the same time overcoming the aforementioned shortcomings. Some numerical results are also reported.     

Technical Note Discontinuous Implicit Quasivariational Inequalities in Normed Spaces

In this paper, we consider an implicit quasivariational inequality without continuity assumptions in normed spaces. The main result (Theorem 2.1) provides an infinite-dimensional version of Theorem 3.2 in Ref. 1. To achieve such a goal, we employ Theorem 3.2 in Ref. 1 and the technique of Cubiotti in Ref. 2. In particular, Theorem 3.1 covers a recent result of Cubiotti (Theorem 3.1 of Ref. 2) as a special case. Communicated by F. Giannessi This research was partially supported by the National Science Council of Taiwan, ROC.     

Expected number of steps of a random optimization method

Some explanatory remarks are presented, relevant to the objections by Pang (Ref. 1) to Dorea's paper (Ref. 2).