A relaxed projection method for variational inequalities

This paper presents a modification of the projection methods for solving variational inequality problems. Each iteration of the proposed algorithm consists of projection onto a halfspace containing the given closed convex set rather than the latter set itself. The algorithm can thus be implemented very easily and its global convergence to the solution can be established under suitable conditions.This work was supported in part by Scientific Research Grant-in-Aid from the Ministry of Education, Science and Culture, Japan.     

Convergent computational method for relaxed optimal control problems

A class of relaxed optimal control problems for ordinary differential equations with a state-space constraint is considered. The discretization by the control parametrization method, formerly proposed by Teo and Goh (Refs. 1, 2), is modified by admitting a tolerance in the state constraint, which enables one to prove a conditional convergence under certain additional qualification on the dynamics. Also, a counterexample is constructed, showing that the original, nonmodified discretization need not approximate the continuous problem.The author is grateful to Professor K. L. Teo for useful comments on this paper.     

A relaxed cutting plane method for semi-infinite semi-definite programming

In this paper, we develop two discretization algorithms with a cutting plane scheme for solving combined semi-infinite and semi-definite programming problems, i.e., a general algorithm when the parameter set is a compact set and a typical algorithm when the parameter set is a box set in the m-dimensional space. We prove that the accumulation point of the sequence points generated by the two algorithms is an optimal solution of the combined semi-infinite and semi-definite programming problem under suitable assumption conditions. Two examples are given to illustrate the effectiveness of the typical algorithm.     

A relaxed version of Bregman's method for convex programming

A new type of relaxation for Bregman's method, an iterative primal-dual algorithm for linearly constrained convex programming, is presented. It is shown that the new relaxation procedure generalizes the usual concept of relaxation and preserves the convergence properties of Bregman's algorithm for a suitable choice of the relaxation parameters. For convergence, Bregman's method requires that the objective function satisfy certain conditions. A sufficient and easily checkable condition for these requirements to hold is also given.     

Attracting cycles for the relaxed Newton’s method

We study the relaxed Newton’s method applied to polynomials. In particular, we give a technique such that for any n≥2, we may construct a polynomial so that when the method is applied to a polynomial, the resulting rational function has an attracting cycle of period n. We show that when we use the method to extract radicals, the set consisting of the points at which the method fails to converge to the roots of the polynomial p(z)=z^m−c (this set includes the Julia set) has zero Lebesgue measure. Consequently, iterate sequences under the relaxed Newton’s method converge to the roots of the preceding polynomial with probability one.     

Dynamic block GMRES: an iterative method for block linear systems

We present variants of the block-GMRES() algorithms due to Vital and the block-LGMRES(,) by Baker, Dennis and Jessup, obtained with replacing the standard QR factorization by a rank-revealing QR factorization in the Arnoldi process. The resulting algorithm allows for dynamic block deflation whenever there is a linear dependency between the Krylov vectors or the convergence of a right-hand-side occurs. implementations of the algorithms were tested on a number of test matrices and the results show that in some cases a substantial reduction of the execution time is obtained. Also a parallel implementation of our variant of the block-GMRES() algorithm, using and was tested on parallel computer, showing good parallel efficiency. This work was carried out while the author was at IM/UFRGS.     

缺失数据的插补调整

插补是另一类对缺失数据进行调整 ,以减小估计偏差的方法。本文介绍的插补方法有 :演绎估计 ,均值插补 ,随机插补 ,回归插补和多重插补     

The relaxed Newton method derivative: Its dynamics and non-linear properties

The dynamic behaviour of the one-dimensional family of maps f(x)=_c2[(a−1)x+_c1]^{−λ/(α−1)}$f\left(x\right)=c_2{[(a-1)x+c_1]}^{-\lambda /(\alpha -1)}$ is examined, for representative values of the control parameters a,_c1$a,c_1$, _c2$c_2$ and λ$\lambda$. The maps under consideration are of special interest, since they are solutions of the relaxed Newton method derivative being equal to a constant a$a$. The maps f(x)$f\left(x\right)$ are also proved to be solutions of a non-linear differential equation with outstanding applications in the field of power electronics. The recurrent form of these maps, after excessive iterations, shows, in an _xn$x_n$ versus λ$\lambda$ plot, an initial exponential decay followed by a bifurcation. The value of λ$\lambda$ at which this bifurcation takes place depends on the values of the parameters a,_c1$a,c_1$ and _c2$c_2$. This corresponds to a switch to an oscillatory behaviour with amplitudes of f(x)$f\left(x\right)$ undergoing a period doubling. For values of a$a$ higher than 1 and at higher values of λ$\lambda$ a reverse bifurcation occurs. The corresponding branches converge and a bleb is formed for values of the parameter _c1$c_1$ between 1 and 1.20. This behaviour is confirmed by calculating the corresponding Lyapunov exponents.     

A computational method for a class of optimal relaxed control problems

In the present paper, we propose a computational scheme for solving a class of optimal relaxed control problems, using the concept of control parametrization. Furthermore, some important convergence properties of the proposed computational scheme are investigated. For illustration, a numerical example is also included.     

An extragradient method for relaxed cocoercive variational inequality and equilibrium problems

The purpose of this paper is to investigate the problem of finding the common element of the set of common fixed points of a countable family of nonexpansivemappings, the set of an equilibrium problem and the set of solutions of the variational inequality problem for a relaxed cocoercive and Lipschitz continuous mapping in Hilbert spaces. Then, we show that the sequence converges strongly to a common element of the above three sets under some parameter controlling conditions, which are connected with Yao, Liou, Yao, Takahashi and many others.     

Dynamic inventory system with pricing adjustment for price-comparison shoppers

With numerous price-comparison websites and applications, consumers today are frequently conducting price-comparison shopping. As a result, retailers face an increasing challenge in predicting consumer demand and determining the optimal product price and inventory level accordingly. To address this issue, this paper proposes an inventory model with joint decisions of price and inventory to optimize the retailer's long-run average profit under price-comparison consumer shopping. We first formulate the demand arrival process for a retailer under price-comparison shopping to be affected by not only its own price but also its competitors'. Based on this demand arrival process, we then formulate the retailer's long-run average profit and derive properties of its optimal solution. Our model focuses on capturing the impact of price-comparison consumers on a retailer's optimal price and inventory decisions. In particular, we allow competitors' prices to affect the retailer's demand via two key factors: the manufacturer's suggested price and the variability of the outside lowest price. According to our results, when the suggested price increases, the retailer should lower its price to obtain more price-comparison customers from competitors, whereas when the variability of outside lowest price increases, the retailer should raise its price to increase per unit profit from nonprice-comparison customers.     

Intrinsic equations for a relaxed elastic line on an oriented surface

Hilbert and Cohn-Vossen [2, p. 221] incorrectly suggested a flexible knitting needle, constrained to conform to a surface, as one model for a geodesic on a surface. This model actually gives a relaxed elastic line on the surface, and is not generally a geodesic unless the surface lies in a plane or on a sphere.In this paper we derive the intrinsic equations for a relaxed elastic line on an oriented surface. This formulation should give a more direct and more geometric approach to questions concerning relaxed elastic lines on a surface. We apply this formulation to give alternate proofs of some results of [3] found by the less direct method of Lagrange multipliers and to give additional results about relaxed elastic lines on various surfaces. For further considerations of a relaxed elastic line on a surface as a model of the DNA molecule, see [3].Partially supported by NIH grant GM 36284-01.     

Strong convergence theorems by a relaxed extragradient method for a general system of variational inequalities

In this paper, we introduce and study a relaxed extragradient method for finding solutions of a general system of variational inequalities with inverse-strongly monotone mappings in a real Hilbert space. First, this system of variational inequalities is proven to be equivalent to a fixed point problem of nonexpansive mapping. Second, by using the demi-closedness principle for nonexpansive mappings, we prove that under quite mild conditions the iterative sequence defined by the relaxed extragradient method converges strongly to a solution of this system of variational inequalities. In addition, utilizing this result, we provide some applications of the considered problem not just giving a pure extension of existing mathematical problems. J.-C. Yao’s research was partially supported by a grant from the National Science Council.     

Edgeworth expansion for an estimator of the adjustment coefficient

We establish an Edgeworth expansion for an estimator of the adjustment coefficient R, directly related to the geometric-type estimator for general exponential tail coefficients, proposed in [Brito, M., Freitas, A.C.M., 2003. Limiting behaviour of a geometric-type estimator for tail indices. Insurance Math. Econom. 33, 211-226].Using the first term of the expansion, we construct improved confidence bounds for R. The accuracy of the approximation is illustrated using an example from insurance (cf. [Schultze, J., Steinebach, J., 1996. On least squares estimates of an exponential tail coefficient. Statist. Dec. 14, 353-372]).     

The Drinfel'd double versus the Heisenberg double for an algebraic quantum group

Let A be a regular multiplier Hopf algebra with integrals. The dual of A, denoted by Â, is a multiplier Hopf algebra so that Â,A is a pairing of multiplier Hopf algebras. We consider the Drinfel'd double, D=ÂA^cop, associated to this pair. We prove that D is a quasitriangular multiplier Hopf algebra. More precisely, we show that the pair Â,A has a “canonical multiplier” WM(ÂA). The image of W in M(DD) is a generalized R-matrix for D. We use this image of W to deform the product of the dual multiplier Hopf algebra via the right action of D on which defines the pair . As expected from the finite-dimensional case, we find that the deformation of the product in is related to the Heisenberg double A#Â.     

Lead time demand for simple exponential smoothing: an adjustment factor for the standard deviation

A new simple formula is found to correct the underestimation of the standard deviation for total lead time demand when using simple exponential smoothing. The traditional formula for the standard deviation of lead time demand is to multiply the standard deviation for the one-period-ahead forecast error (estimated by using the residuals) by the square root of the number of periods in the lead time. It has been shown by others that the traditional formula significantly underestimates variation in the lead time demand when the mean of the process is somewhat changing and simple exponential smoothing is appropriate. This new formula allows one to see readily the significant size of the underestimation of the traditional formula and can easily be implemented in practice. The formula is derived by using a state-space model for simple exponential smoothing.