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…     

Structural and thermodynamic properties of AlB2 compound

We employ a first-principles plane wave method with the relativistic analytic pseudopotential of Hartwigsen, Goedecker and Hutter (HGH) scheme in the frame of DFT to calculate the equilibrium lattice parameters and the thermodynamic properties of AlB₂ compound with hcp structure. The obtained lattice parameters are in good agreement with the available experimental data and those calculated by others. Through the quasi-harmonic Debye model, obtained successfully are the dependences of the normalized lattice parameters a/a₀ and c/c₀ on pressure P, the normalized primitive cell volume V/V₀ on pressure P, the variation of the thermal expansion α with pressure P and temperature T, as well as the Debye temperature \Theta_D and the heat capacity C_V on pressure P and temperature T.     

Extrusion of pastes with a piston extruder for the determination of the local solid and fluid concentration, the local porosity and saturation and displacement profiles by means of NMR imaging

 Nuclear Magnetic Resonance (NMR) was used to investigate the extrusion behaviour of PTFE pastes in a ram extruder. By means of ¹H-NMR imaging (MRI) it is possible to determine the local proton density and therefore, the local fluid concentration. The ¹⁹F-MRI provides the local solid concentration. Thus the local saturation and the local porosity can be calculated with the information of the local fluid and solid concentration. Furthermore displacement profiles can be derived from NMR images by means of correlation techniques without any preparation or marking of the pastes. Received: 8 May 2000   Accepted: 1 May 2001     

一种基于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.     

Approximation algorithms for dynamic resource allocation

We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility.     

Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.