Generalized Quasi-Variational Inequalities in Infinite-Dimensional Normed Spaces

In this paper, we deal with the following problem: given a real normed space E with topological dual E*, a closed convex set XE, two multifunctions :X2^X and , find such that We extend to the above problem a result established by Ricceri for the case (x)X, where in particular the multifunction is required only to satisfy the following very general assumption: each set (x) is nonempty, convex, and weakly-star compact, and for each yX–:X the set is compactly closed. Our result also gives a partial affirmative answer to a conjecture raised by Ricceri himself.     

Generalized Quasi-Variational Inequalities Without Continuities

Given a nonempty set and two multifunctions , we consider the following generalized quasi-variational inequality problem associated with X, : Find such that . We prove several existence results in which the multifunction is not supposed to have any continuity property. Among others, we extend the results obtained in Ref. 1 for the case (x(X.     

On the Solution Existence of Generalized Quasivariational Inequalities with Discontinuous Multifunctions

We study the following generalized quasivariational inequality problem: given a closed convex set X in a normed space E with the dual E ^*, a multifunction and a multifunction Γ:X→2 ^X , find a point such that , . We prove some existence theorems in which Φ may be discontinuous, X may be unbounded, and Γ is not assumed to be Hausdorff lower semicontinuous. The authors express their sincere gratitude to the referees for helpful suggestions and comments. This research was partially supported by a grant from the National Science Council of Taiwan, ROC. B.T. Kien was on leave from National University of Civil Engineering, Hanoi, Vietnam.     

An existence theorem for generalized quasi-variational inequalities

In this paper, we deal with the following generalized quasi-variational inequality problem: given a closed convex subsetX ⁿ , a multifunction :X 2 ⁿ and a multifunction :X 2 ^X , find a point ( ) X × ⁿ such that We prove an existence theorem in which, in particular, the multifunction is not supposed to be upper semicontinuous.     

Discontinuous implicit generalized quasi-variational inequalities in Banach spaces

We consider the following implicit quasi-variational inequality problem: given two topological vector spaces E and F, two nonempty sets X E and C F, two multifunctions Γ : X → 2 ^X and Ф : X → 2 ^C , and a single-valued map ψ : , find a pair such that , Ф and for all . We prove an existence theorem in the setting of Banach spaces where no continuity or monotonicity assumption is required on the multifunction Ф. Our result extends to non-compact and infinite-dimensional setting a previous results of the authors (Theorem 3.2 of Cubbiotti and Yao [15] Math. Methods Oper. Res. 46, 213–228 (1997)). It also extends to the above problem a recent existence result established for the explicit case (C = E ^* and ).     

On a General Projection Algorithm for Variational Inequalities

Let H be a real Hilbert space with norm and inner product denoted by and . Let K be a nonempty closed convex set of H, and let f be a linear continuous functional on H. Let A, T, g be nonlinear operators from H into itself, and let be a point-to-set mapping. We deal with the problem of finding uK such that g(u)K(u) and the following relation is satisfied: , where >0 is a constant, which is called a general strong quasi-variational inequality. We give a general and unified iterative algorithm for finding the approximate solution to this problem by exploiting the projection method, and prove the existence of the solution to this problem and the convergence of the iterative sequence generated by this algorithm.     

Lagrangian Globalization Methods for Nonlinear Complementarity Problems

This paper extends the Lagrangian globalization (LG) method to the nonsmooth equation arising from a nonlinear complementarity problem (NCP) and presents a descent algorithm for the LG phase. The aim of this paper is not to present a new method for solving the NCP, but to find such that when the NCP has a solution and is a stationary point but not a solution.     

An open mapping theorem for measures

LetX andY be Hausdorff spaces and denote byM (X) andM (Y) the corresponding spaces of finite and non-negative Borel measures, endowed with the weak topology. A Borel map :XY induces the map :M (X)M (Y). We give necessary and sufficient conditions for to be open. In case of being a surjection between Suslin spaces, is open if and only if is.     

Characterization of Smoothness of Multivariate Refinable Functions and Convergence of Cascade Algorithms of Nonhomogeneous Refinement Equations

This paper concerns multivariate homogeneous refinement equations of the form

On the Normal Order of ϕk+1(n)/ϕk(n), where ϕk is the k-Fold Iterate of Euler's Function

Let be the j-fold iterated function of . Let and > 0 be fixed, Q be a prime, and let N _k(Q|x) denote the number of those nx for which Q . We give the asymptotics of N _k(Q|x) in the range .     

Mathematical Properties of Optimization Problems Defined by Positively Homogeneous Functions

We consider the nonlinear programming problem

An Intersection Theorem on an Unbounded Set and Its Application to the Fair Allocation Problem

We prove the following theorem. Let m and n be any positive integers with mn, and let be a subset of the n-dimensional Euclidean space ⁿ . For each i=1, . . . , m, there is a class of subsets M _i ^j of ^Tn . Assume that for each i=1, . . . , m, that M _i ^j is nonempty and closed for all i, j, and that there exists a real number B(i, j) such that and its jth component _{xjB(i, j)} imply . Then, there exists a partition of {1, . . . , n} such that for all i and We prove this theorem based upon a generalization of a well-known theorem of Birkhoff and von Neumann. Moreover, we apply this theorem to the fair allocation problem of indivisible objects with money and obtain an existence theorem.     

Study on a memory gradient method for the minimization of functions

A new accelerated gradient method for finding the minimum of a functionf(x) whose variables are unconstrained is investigated. The new algorithm can be stated as follows: where x is the change in the position vectorx, g(x) is the gradient of the functionf(x), and and are scalars chosen at each step so as to yield the greatest decrease in the function. The symbol denotes the change in the position vector for the iteration preceding that under consideration.For a nonquadratic function, initial convergence of the present method is faster than that of the Fletcher-Reeves method because of the extra degree of freedom available. For a test problem, the number of iterations was about 40–50% that of the Fletcher-Reeves method and the computing time about 60–75% that of the Fletcher-Reeves method, using comparable search techniques.This research, supported by the Office of Scientific Research, Office of Aerospace Research, United States Air Force, Grant No. AF-AFOSR-828-67, is a condensed version of the investigation described in Ref. 1. Portions of this paper were presented by the senior author at the International Symposium on Optimization Methods, Nice, France, 1969.     

Application of Upper Hemi-Continuous Operators on Generalized Bi-quasi-variational Inequalities in Locally Convex Topological Vector Spaces

Let and be Hausdorff topological vector spaces over the field , let be a bilinear functional, and let be a non-empty subset of . Given a set-valued map and two set-valued maps , the generalized bi-quasi-variational inequality (GBQVI) problem is to find a point and a point such that and for all and for all or to find a point a point and a point such that and for all . The generalized bi-quasi-variational inequality was introduced first by Shih and Tan [8] in 1989. In this paper we shall obtain some existence theorems of generalized bi-quasi-variational inequalities as application of upper hemi-continuous operators [4] in locally convex topological vector spaces on compact sets.     

C*-Modular Vector States

Let be a C*-algebra and X a Hilbert C* -module. If is a projection, let be the p-sphere of X. For φ a state of with support p in and consider the modular vector state φ_x of given by The spheres provide fibrations

Multivariate interpolation in odd-dimensional euclidean spaces using multiquadrics

Let or . Givenf: ⁿ , we establish convergence orders of interpolation where the cardinal functionx withx(j)=_0j is a linear combination of integer shifts, of a fast decaying function

Quadratic Integer Programming with Application to the Chaotic Mappings of Complete Multipartite Graphs

Let be a permutation of the vertex set V(G) of a connected graph G. Define the total relative displacement of in G by be

Sequential gradient-restoration algorithm for optimal control problems

This paper considers the problem of minimizing a functionalI which depends on the statex(t), the controlu(t), and the parameter . Here,I is a scalar,x ann-vector,u anm-vector, and ap-vector. At the initial point, the state is prescribed. At the final point, the statex and the parameter are required to satisfyq scalar relations. Along the interval of integration, the state, the control, and the parameter are required to satisfyn scalar differential equations. Asequential algorithm composed of the alternate succession of gradient phases and restoration phases is presented. This sequential algorithm is contructed in such a way that the differential equations and boundary conditions are satisfied at the end of each iteration, that is, at the end of a complete gradient-restoration phase; hence, the value of the functional at the end of one iteration is comparable with the value of the functional at the end of any other iteration.In thegradient phase, nominal functionsx(t),u(t), satisfying all the differential equations and boundary conditions are assumed. Variations x(t), u(t), leading to varied functions (t),(t), are determined so that the value of the functional is decreased. These variations are obtained by minimizing the first-order change of the functional subject to the linearized differential equations, the linearized boundary conditions, and a quadratic constraint on the variations of the control and the parameter.Since the constraints are satisfied only to first order during the gradient phase, the functions (t),(t), may violate the differential equations and/or the boundary conditions. This being the case, a restoration phase is needed prior to starting the next gradient phase. In thisrestoration phase, the functions (t),(t), are assumed to be the nominal functions. Variations (t), (t), leading to varied functions (t),û(t), consistent with all the differential equations and boundary conditions are determined. These variations are obtained by requiring the least-square change of the control and the parameter subject to the linearized differential equations and the linearized boundary conditions. Of course, the restoration phase must be performed iteratively until the cumulative error in the differential equations and boundary conditions becomes smaller than some preselected value.If the gradient stepsize is , an order-of-magnitude analysis shows that the gradient corrections are x=O(), u=O(), =O(), while the restoration corrections are . Hence, for sufficiently small, the restoration phase preserves the descent property of the gradient phase: the functionalI decreases between any two successive iterations.Methods to determine the gradient stepsize in an optimal fashion are discussed. Examples are presented for both the fixed-final-time case and the free-final-time case. The numerical results show the rapid convergence characteristics of the sequential gradient-restoration algorithm.The portions of this paper dealing with the fixed-final-time case were presented by the senior author at the 2nd Hawaii International Conference on System Sciences, Honolulu, Hawaii, 1969. The portions of this paper dealing with the free-final-time case were presented by the senior author at the 20th International Astronautical Congress, Mar del Plata, Argentina, 1969. This research, supported by the NASA-Manned Spacecraft Center, Grant No. NGR-44-006-089, Supplement No. 1, is a condensation of the investigations presented in Refs. 1–5. The authors are indebted to Professor H. Y. Huang for helpful discussions.     

Self-bounded controlled invariant subspaces: A straightforward approach to constrained controllability

A lattice-type structure is shown to exist in a particular subset of the set of all (A, )-controlled invariants contained in and containing , whereA denotes a linear map inR ⁿ ; , are arbitrary subspaces ofR ⁿ ; andD is an arbitrary subspace ofJ, the maximum (A, )-controlled invariant contained in . In linear system theory, this property can be used for a more direct theoretical and algorithmic approach to constrained controllability and disturbance rejection problems.     

Interpolation theorems for a family of spanning subgraphs

Let G be a graph with order p, size q and component number . For each i between p – and q, let be the family of spanning i-edge subgraphs of G with exactly components. For an integer-valued graphical invariant if H H is an adjacent edge transformation (AET) implies |(H)-(H^')|1 then is said to be continuous with respect to AET. Similarly define the continuity of with respect to simple edge transformation (SET). Let M _j() and m _j() be the invariants defined by . It is proved that both M _p–() and m _p–(;) interpolate over , if is continuous with respect to AET, and that M _j() and m _j() interpolate over , if is continuous with respect to SET. In this way a lot of known interpolation results, including a theorem due to Schuster etc., are generalized.