ON THE CONVERGENCE OF MULTIPLICATIVE ITERATIVE ALGORITHMS WITH INEXACT LINE SEARCH

1.IntroductionIntillspaperweanalyzetheconvergenceonmultiplicativeiterativealgorithmsfortheIninimizationofadiffcrentiablefunctiondefinedonthepositiveorthantofR".ThealgorithmissllggestedbyEggermolltl'],andisrelatedtotheEM[2](Expextation--Maximization)algoritllnlforPositronemissiontonlography[']andimagereconstructi..14].Wecollsidertheproblenl"linf(x)s.t.x20.Themultiplicativeiterativealgorithmshavethel'orlniforj=l,2,',n,withAhdeterminedthroughalinesearch.Whilelusem[5]establishedanelegantconv…     

A stochastic algorithm using one sample point per iteration and diminishing stepsizes

A stochastic algorithm for finding stationary points of real-valued functions defined on a Euclidean space is analyzed. It is based on the Robbins-Monro stochastic approximation procedure. Gradient evaluations are done by means of Monte Carlo simulations. At each iteratex _i , one sample point is drawn from an underlying probability space, based on which the gradient is approximated. The descent direction is against the approximation of the gradient, and the stepsize is 1/i. It is shown that, under broad conditions, w.p.1 if the sequence of iteratesx ₁,x ₂,...generated by the algorithm is bounded, then all of its accumulation points are stationary.     

On the optimal allocation of two active redundancies in a two-component series system

Components C₁ and C₂ form a series system. Suppose we can allocate the spare R₁ in parallel with C₁ and the spare R₂ in parallel with C₂, or otherwise, allocate R₁ with C₂ and R₂ with C₁. In this paper, we compare these two options using hazard rate ordering.     

一种基于GIS的选址问题及算法

本文考虑了选址区域内存在地理阻断情况下的一种基于GIS的选址问题.对单配送中心选址模型,以GIS返回的任意两点间的最短可行路径的长度作为修正距离函数,分析了目标函数在凸形选址区域上非凸非连续的性质.进一步,采用给出了一种近似搜索算法并通过一个实例计算与重心法进行了比较.     

Stochastic techniques for global optimization: A survey of recent advances

In this paper stochastic algorithms for global optimization are reviewed. After a brief introduction on random-search techniques, a more detailed analysis is carried out on the application of simulated annealing to continuous global optimization. The aim of such an analysis is mainly that of presenting recent papers on the subject, which have received only scarce attention in the most recent published surveys. Finally a very brief presentation of clustering techniques is given.     

A search technique for global optimization in a chaotic environment

We describe a new algorithm which uses the trajectories of a discrete dynamical system to sample the domain of an unconstrained objective function in search of global minima. The algorithm is unusually adept at avoiding nonoptimal local minima and successfully converging to a global minimum. Trajectories generated by the algorithm for objective functions with many local minima exhibit chaotic behavior, in the sense that they are extremely sensitive to changes in initial conditions and system parameters. In this context, chaos seems to have a beneficial effect: failure to converge to a global minimum from a given initial point can often be rectified by making arbitrarily small changes in the system parameters.     

A priori tests of a stochastic mode reduction strategy

Several a priori tests of a systematic stochastic mode reduction procedure recently devised by the authors [Proc. Natl. Acad. Sci. 96 (1999) 14687; Commun. Pure Appl. Math. 54 (2001) 891] are developed here. In this procedure, reduced stochastic equations for a smaller collections of resolved variables are derived systematically for complex nonlinear systems with many degrees of freedom and a large collection of unresolved variables. While the above approach is mathematically rigorous in the limit when the ratio of correlation times between the resolved and the unresolved variables is arbitrary small, it is shown here on a systematic hierarchy of models that this ratio can be surprisingly big. Typically, the systematic reduced stochastic modeling yields quantitatively realistic dynamics for ratios as large as 1/2. The examples studied here vary from instructive stochastic triad models to prototype complex systems with many degrees of freedom utilizing the truncated Burgers–Hopf equations as a nonlinear heat bath. Systematic quantitative tests for the stochastic modeling procedure are developed here which involve the stationary distribution and the two-time correlations for the second and fourth moments including the resolved variables and the energy in the resolved variables. In an important illustrative example presented here, the nonlinear original system involves 102 degrees of freedom and the reduced stochastic model predicted by the theory for two resolved variables involves both nonlinear interaction and multiplicative noises. Even for large value of the correlation time ratio of the order of 1/2, the reduced stochastic model with two degrees of freedom captures the essentially nonlinear and non-Gaussian statistics of the original nonlinear systems with 102 modes extremely well. Furthermore, it is shown here that the standard regression fitting of the second-order correlations alone fails to reproduce the nonlinear stochastic dynamics in this example.