A Deterministic Approach to Linear Programs with Several Additional Multiplicative Constraints

We consider a global optimization problem of minimizing a linear function subject to p linear multiplicative constraints as well as ordinary linear constraints. We show that this problem can reduce to a 2p-dimensional reverse convex program, and present an algorithm for solving the resulting problem. Our algorithm converges to a globally optimal solution and yields an -approximate solution in finite time for any > 0. We also report some results of computational experiment.     

Efficiency of Proximal Bundle Methods

We give efficiency estimates for proximal bundle methods for finding f_*min_Xf, where f and X are convex. We show that, for any accuracy <0, these methods find a point x^kX such that f(x^k)–f^* after at most k=O(1/³) objective and subgradient evaluations.     

Singular perturbations in foliations

Summary We define a constraint system , [0,₀), which is a kind of family of vector fields on a manifold. This is a generalized version of the family of the equations , [0,₀),x ^m ,y ⁿ . Finally, we prove a singular perturbation theorem for the system , [0,₀).Dedicated to Professor Kenichi Shiraiwa on his 60th birthday     

On the product of sign vectors and unit vectors

For a fixed unit vectora=(a ₁,...,a _n )S ^n-1, consider the 2 ⁿ sign vectors=(₁,..., _n ){±1{ ⁿ and the corresponding scalar products^·a = _n ⁱ⁼¹ = _i a _i . The question that we address is: for how many of the sign vectors must^.a lie between–1 and 1. Besides the straightforward interpretation in terms of the sums ±a ₂ , this question has appealing reformulations using the language of probability theory or of geometry.The natural conjectures are that at least 1/2 the sign vectors yield |.a|1 and at least 3/8 of the sign vectors yield |.a|<1 (the latter excluding the case when |a _i |=1 for somei). These conjectured lower bounds are easily seen to be the best possible. Here we prove a lower bound of 3/8 for both versions of the problem, thus completely solving the version with strict inequality. The main part of the proof is cast in a more general probabilistic framework: it establishes a sharp lower bound of 3/8 for the probability that |X+Y|<1, whereX andY are independent random variables, each having a symmetric distribution with variance 1/2.We also consider an asymptotic version of the question, wheren along a sequence of instances of the problem satisfying ||a||0. Our result, best expressed in probabilistic terms, is that the distribution of .a converges to the standard normal distribution, and in particular the fraction of sign vectors yielding .a between –1 and 1 tends to 68%.This research was supported in part by the Institute for Mathematics and its Applications with funds provided by the National Science Foundation.     

The poset scheduling problem

Let P and Q be two finite posets and for each pP and qQ let c(p, q) be a specified (real-valued) cost. The poset scheduling problem is to find a function s: PQ such that _pP c(p,s(p)) is minimized, subject to the constraints that p in P implies s(p) in Q. We prove that the poset scheduling problem is NP-hard. This problem with a totally ordered poset Q is proved to be transformable to the closed set problem or the minimum cut problem in a network.This work was done in the fall semester of 1982 when the second author was visiting Cornell University. The first author was his research associate during that period.The first author was supported by National Science Council of Republic of China under Grant NSC73-0208-M008-08 when he wrote the final version of this paper.     

On the existence of wave operators for the Klein-Gordon equation

The problem of existence of wave operators for the Klein-Gordon equation ( _t ² –+²+iV_1t+V₂)u(x,t)=0 (x R ⁿ,t R, n3, >0) is studied where V₁ and V₂ are symmetric operators in L₂(R ⁿ) and it is shown that conditions similar to those of Veseli-Weidmann (Journal Functional Analysis 17, 61–77 (1974)) for a different class of operators are also sufficient for the Klein-Gordon equation.     

Kite-freeP- andQ-polynomial schemes

LetY = (X, {R _i } _oid) denote aP-polynomial association scheme. By a kite of lengthi (2 i d) inY, we mean a 4-tuplexyzu (x, y, z, u X) such that(x, y) R ₁,(x, z) R ₁,(y, z) R ₁,(u, y) R _i–1,(u, z) R _i–1,(u, x) R _i. Our main result in this paper is the following.     

∈-Weak Minimal Solutions of Vector Optimization Problems with Set-Valued Maps

In this paper, we consider cone-subconvexlike vector optimization problems with set-valued maps in general spaces and derive scalarization results, -saddle point theorems, and -duality assertions using -Lagrangian multipliers.     

Reconstructing dimensions of intersections of convex sets

Denoting by dimA the dimension of the affine hull of the setA, we prove that if {K _i:i T} and {K _i ^j :i T} are two finite families of convex sets inR ⁿ and if dim {K _i :i S} = dim {K _i ^j :i S}for eachS T such that|S| n + 1 then dim {K _i :i T} = dim {K _i : {i T}}.     

Connected and alternating vectors: Polyhedra and algorithms

Given a graphG = (V, E), leta ^S, S L, be the edge set incidence vectors of its nontrivial connected subgraphs.The extreme points of = {x R ^E: a^sx |V(S)| - |S|, S L} are shown to be integer 0/± 1 and characterized. They are the alternating vectorsb ^k, k K, ofG. WhenG is a tree, the extreme points ofB 0,b ^kx 1,k K} are shown to be the connected vectors ofG together with the origin. For the four LP's associated with andA, good algorithms are given and total dual integrality of andA proven.On leave from Swiss Federal Institute of Technology, Zurich.     

Aufeinanderfolgende Elemente in multiplikativen Zahlenmengen

LetM be a multiplicative set with 1M andmnM if and only ifmM,nM for (m,n)=1. It is shown by elementary means that there exists the asymptotic density of the setM(M–1) for every multiplicative setM. The density is positive if and only ifM possesses a positive density and 2M for some . This result is slightly generalized to sums over multiplicative functionsf with |f|1.     

On a Test Statistic for Linear Trend

Let {W(s)} _s 0 be a standard Wiener process. The supremum of the squared Euclidian norm Y (t)², of the R²-valued process Y(t)=(1/t W(t), {12/t ³ int_{0 t} s dW (s)– {3/t} W(t)), t [, 1], is the asymptotic, large sample distribution, of a test statistic for a change point detection problem, of appearance of linear trend. We determine the asymptotic behavior P {sup _t [, 1] Y(t)² > u as u , of this statistic, for a fixed (0,1), and for a moving = (u) 0 at a suitable rate as u . The statistical interest of our results lie in their use as approximate test levels.     

Existence of ∈-Minima for Vector Optimization Problems

The -generalized minima for vector optimization problems are defined and a sufficient condition for the existence of -generalized minima for vector optimization problems is established.     

Quotient rings of polynomial rings

Let R be a commutative ring with identity. The multiplicatively closed sets U₂={fR[X]: c(f)–1=R}, (U₂)={fU₂: f is regular} and S={fR[X]: c(f)=R} are studied. By considering various equalities between these sets, many characterizations of Noetherian rings are found. In particular, a Noetherian ring R has depth 1 if and only if S=(U₂): and each maximal ideal of a Noetherian ring is regular if and only if U₂=(U₂).The theory of Prüfer v-multiplication rings (PVMR's) is developed for rings with zero divisors. Six equivalent conditions are given to the statement that an additively regular v-ring R is a PVMR.     

On a family of quasi-arithmetic means

Summary The main goal of this paper is to solve the idempotency equationF(x, x) = x, x [0, 1] for a class of functions of the type convex linear combination of at-norm and at-conorm. In the non-strict Archimedean case and for eachk (0, 1), we obtain a unique solutionF _k for this equation. While these functionsF _k are not associative, we also prove that they satisfy the bisymmetry condition.     

A general descent framework for the monotone variational inequality problem

We present a framework for descent algorithms that solve the monotone variational inequality problem VIP _v which consists in finding a solutionv ^* _v satisfyings(v ^*)^T(v–v ^*)0, for allv _v. This unified framework includes, as special cases, some well known iterative methods and equivalent optimization formulations. A descent method is developed for an equivalent general optimization formulation and a proof of its convergence is given. Based on this unified logarithmic framework, we show that a variant of the descent method where each subproblem is only solved approximately is globally convergent under certain conditions.This research was supported in part by individual operating grants from NSERC.     

On a one-dimensional version of the dynamical Marguerre-Vlasov system

A one-dimensional version of the so-called Marguerre-Vlasov system of equations describing the vibrations of shallow shells is considered. The system depends on a parameter 0 in a singular way and undergoes the effect of damping mechanisms. We show that the system converges to a nonlinear beam equation while the energy decays exponentially uniformly (on 0) as time goes to infinity.     

Convergence of epigraphs and of sublevel sets

Let LSC(X) be the set of the proper lower semicontinuous extended real-valued functions defined on a metric spaceX. Given a sequence f _n in LSC(X) and a functionf LSC(X), we show that convergence of f _n tof in several variational convergence modes implies that for each , the sublevel set at height off is the limit, in the same variational sense, of an appropriately chosen sequence of sublevel sets of thef _n, at height _n approaching . The converse holds true whenever a form of stability of the sublevel sets of the limit function is verified. The results are obtained by regarding a hyperspace topology as the weakest topology for which each member of an appropriate family of excess functionals is upper semicontinuous, and each member of an appropriate family of gap functionals is lower semicontinuous. General facts about the representation of hyperspace topologies in this manner are given.     

Asymptotic behaviour of Gaussian random fields

Summary Let X={X(t), t ^N} be a centred Gaussian random field with covariance X(t)X(s)=r(t–s) continuous on ^N×^N and r(0)=1. Let (t,s)=((X(t)–X(s)) ²)^1/2; (t,s) is a pseudometric on ^N. Assume X is -separable. Let D ₁ be the unit cube in ^N and for 0<k, D _k= {x^N: k ^–1 xD₁}, Z(k)=sup{X(t),tD _k}. If X is sample continuous and ¦r(t)¦ =o(1/log¦t¦) as ¦t¦8 then Z(k)-(2Nlogk) ^1/20 as k a.s.     

Ein Homomorphiesatz und verwandte Operatoren in topologischen Vektorräumen

The following homomorphism theorem is proved: Let E be a sequentially complete topological vector space and let SL(E) be a certain bounded endomorphism on E. (I-S)L(E) is an open map if and only if (I-S)(E) is closed in E. The proof is based on the method of verwandte Operatoren introduced by Pietsch [6].