Progressive global random search of continuous functions

A sequential random search method for the global minimization of a continuous function is proposed. The algorithm gradually concentrates the random search effort on areas neighboring the global minima. A modification is included for the case that the function cannot be exactly evaluated. The global convergence and the asymptotical optimality of the sequential sampling procedure are proved for both the stochastic and deterministic optimization problem.The research is sponsored in part by the Air Force under Grant AFOSR-72-2371.     

Parallel primal-dual methods for the minimum cost flow problem

In this paper we discuss the parallel asynchronous implementation of the classical primaldual method for solving the linear minimum cost network flow problem. Multiple augmentations and price rises are simultaneously attempted starting from several nodes with possibly outdated price and flow information. The results are then merged asynchronously subject to rather weak compatibility conditions. We show that this algorithm is valid, terminating finitely to an optimal solution. We also present computational results using an Encore MULTIMAX that illustrate the speedup that can be obtained by parallel implementation.This work supported in part by the BM/C3 Technology branch of the United States Army Strategic Defense Command.     

Orbits and Lattices for Linear Random Number Generators with Composite Moduli

In order to analyze certain types of combinations of multiple recursive linear congruential generators (MRGs), we introduce a generalized spectral test. We show how to apply the test in large dimensions by a recursive procedure based on the fact that such combinations are subgenerators of other MRGs with composite moduli. We illustrate this with the well-known RANMAR generator. We also design an algorithm generalizing the procedure to arbitrary random number generators.

     

An example of irregular convergence in some constrained optimization methods that use the projected hessian

In this paper we give examples illustrating the behavior of the Coleman-Conn horizontal vertical method and of successive quadratic programming with a Hessian approximation exact on the tangent space of the constraints. One example shows that these methods in general are not one-step superlinearly convergent.This research was supported by National Science Foundation Grant MCS-8115475.     

燃气轮机总能系统特性模拟与优化的新思路探讨

符号表a，b时间区限e如燃烧室效率土时间。fco压气机设计效率Gi（t）即时燃料量ti。设计进气温度efto透平设计效率H。燃料热值取。t全工况效率ef。机械效率Ne（t即时功率。压比efe发电效率风设计进气压力1前言对热力系统及其部件特性的研究，前人已作了很多工作，但多以设计工况下的机组的热力性能与经济性来考虑设计和应用选型等问题，由于种种变工况因素，在设计工况下，机组的热力性能参数匹配及其它性能指标可能处于优化区域，而实际运行中，却处于非最佳运行工况。鉴于上述分析，对装置除了解其设计工况的性能外，还必须对其变工况乃…     

X波段渡越管振荡器的粒子模拟和优化设计

 提出了一种新型的渡越管谐振腔结构，通过全电磁2.5维相对论粒子模拟程序证实电子束可以与这种谐振腔结构发生互作用；基于该谐振腔结构，用全电磁2.5维相对论粒子模拟程序设计优化了可工作在X波段的渡越管振荡器，其输出功率大约1.7GW，束波转换效率约37%。     

A fast and robust unconstrained optimization method requiring minimum storage

This paper describes a new unconstrained optimisation procedure employing conjugate directions and requiring only threen-dimensional vectors. The method has been tested for computational efficiency and stability on a large set of test functions and compared with numerical data of other major methods. Results show that the method possesses strong superiority over other existing conjugate gradient methods on all problems and can out-perform or is at least as efficient as quasi-Newton methods on many tested problems.     

Optimal sensor locations for structural vibration measurements

This paper is concerned with the determination of optimal sensor locations for structural vibration measurements. An efficient method based on the uniform design theory is presented in this paper, which is very different from the empirical method and is accurate and simple for implementation. A cantilever beam is used as an example to illustrate the effectiveness and application of the proposed method. It is shown through the example that in comparison with the conventional method, the use of the present method results in the reduction of workload above 90%.     

TOPOLOGICAL STRUCTURE OF EFFICIENT SET OF OPTIMIZATION PROBLEM OF SET－VALUED MAPPING

ＴＯＰＯＬＯＧＩＣＡＬ ＳＴＲＵＣＴＵＲＥ ＯＦ ＥＦＦＩＣＩＥＮＴ ＳＥＴ ＯＦ ＯＰＴＩＭＩＺＡＴＩＯＮ ＰＲＯＢＬＥＭ ＯＦ ＳＥＴ－ＶＡＬＵＥＤ ＭＡＰＰＩＮＧ ￥ＬＩＹＵＡＮＸＩＡｂｓｔｒａｃｔ：Ｔｈｉｓｐａｐｅｒｉｓｃｏｎｃｅｒｎｅｄｗｉ...     

Optimized pump scheduling in water distribution systems

A method based on nonlinear programming for determining the optimal operation of general water distribution systems containing multiple sources and reservoirs is presented. The problem is formulated and solved so that, given the forecasted demands for the coming 24 hours, the initial and final conditions in the reservoirs, the unit and maximum demand electricity charge, and the constraints in the hydraulic properties of all system components, an optimized pumping schedule is found. An optimization algorithm which employs the generalized reduced gradient method and the nonlinear sensitivity analysis has been developed for a basic scheduling problem in which only unit charges are considered. The maximum demand charge, which is weighted by varying degrees from day to day, is incorporated into the scheduling problem. The algorithm uses a feasible initial solution as the starting solution and iterates so that all the interim solutions are feasible.The work described here was undertaken at Brunel University and the University of Durham, UK. The authors are grateful to SERC for dunding the project and also thank Professor Uri Shamir, Department of Civil Engineering, Israel Institute of Technology for his review and many useful comments.