-
作者：SAIGAL, R
摘要：We consider an alternative implementation of the interior point methods. In the popular implementations, a variant of sparse Cholesky factorization is integrated with a conjugate gradient type iterative method. In contrast, we set up the problem as an infinitely summable series of vectors. This series is then, iteratively, summed. At each iteration, a procedure based on ''least squares'' is used to obtain an estimate of the ''tail'' of the series. In addition, using Chebychev approximations, w...
-
作者：ZHU, CY
摘要：The asymptotic convergence of the forward-backward splitting algorithm for solving equations of type 0 is an element of T(z) is analyzed, where T is a multivalued maximal monotone operator in the n-dimensional Euclidean space, When the problem has a nonempty solution set, and T is split in the form T = J + h It with J being maximal monotone and h being co-coercive with modulus greater than 1/2, convergence rates are shown, under mild conditions, to be linear, superlinear or sublinear depending...
-
作者：DURIER, R
摘要：The general one center location problem deals with the location of a point in a real normed space X in order to minimize an objective function G which depends on the distances to a finite number of centers and on initial costs. The function G is defined by G(x) = gamma(c(1) + w(1) parallel to x - a(1) parallel to,...,c(n) + w(n) parallel to x - a(n) parallel to), where a(1),...,a(n) are n given points in X, W-1,...,W-n are positive numbers, c(1),..., c(n) are nonnegative initial costs and gamm...
-
作者：POLIQUIN, R; QI, LQ
作者单位：University of New South Wales Sydney
摘要：Recently, several globally convergent model algorithms based on iteration functions have been proposed for solving nonsmooth optimization problems. In particular, Pang, Han and Rangaraj proposed such an algorithm for minimizing a locally Lipschitzian function. We determine properties of iteration functions (calculus, existence); we also identify characteristics of functions that possess iteration functions. We show that a locally Lipschitzian function has a Pang-Han-Rangaraj iteration function...
-
作者：NGUYEN, V
摘要：The subject of this paper is a two-station mixed queueing network with two customer types: ''Open'' customers enter the network at station I and depart the system after receiving service. Meanwhile, a fixed number of ''closed'' customers circulate between stations 1 and 2. Such a mixed queueing network model can represent a single-stage production system that services both make-to-order and make-to-stock customers. We present fluid and diffusion limits for this network under the first-in-first...
-
作者：MANDELBAUM, A; MASSEY, WA
作者单位：AT&T; Nokia Corporation; Nokia Bell Labs
摘要：A time-dependent M(t)/M(t)/1 queue alternates through periods of under-, over-, and critical loading. We derive period-dependent, pathwise asymptotic expansions for its queue length, within the framework of strong approximations. Our main results include time-dependent fluid approximations, supported by a functional strong law of large numbers, and diffusion approximations, supported by a functional central limit theorem. This complements and extends previous work on asymptotic expansions of t...
-
作者：Pflug, GC
摘要：Consider a stochastic program with unique solution. By the notion of epi-convergence in distribution in local coordinates, we define the asymptotic stochastic program associated to it. Stochastic programs may be classified according to the type of the pertaining asymptotic program. In particular, three such types are studied in detail: the normal shift program, the Wiener-type program and the Poisson-hyperplane program. Conditions for the convergence to each of the three types are given.
-
作者：PLOTKIN, SA; SHMOYS, DB; TARDOS, E
作者单位：Cornell University
摘要：This paper presents fast algorithms that find approximate solutions for a general class of problems, which we call fractional packing and covering problems. The only previously known algorithms for solving these problems are based on general linear programming techniques. The techniques developed in this paper greatly outperform the general methods in many applications, and are extensions of a method previously applied to find approximate solutions to multicommodity flow problems. Our algorith...
-
作者：PREATER, J
摘要：Two secretary problems based on relative rank are considered, in which the decision maker has any fixed number of choices. In the first the payoff depends in an arbitrary way on acquisitions of ranks 1 and 2; in the second the aim is to maximise the probability of obtaining the best 3 objects. In each case the existence of an optimal selection policy of time threshold type is established.
-
作者：KASPI, H; MANDELBAUM, A
摘要：We show that a continuous-time Markov process X is Harris recurrent if and only if there exists a nonzero sigma-finite measure nu on its state space such that X surely hits sets with positive nu-measure. This simple criterion is applied to some nonparametric closed queueing networks.
