Impact of Partial Separability on Large-Scale Optimization

ELSO is an environment for the solution oflarge-scale optimization problems. With ELSO the user is required to provide only code for the evaluation of a partially separable function. ELSO exploits the partialseparability structure of the function to computethe gradient efficiently using automatic differentiation.We demonstrate ELSO's efficiency by comparing thevarious options available in ELSO.Our conclusion is that the hybrid option in ELSOprovides performance comparable to the hand-coded option, while having the significantadvantage of not requiring a hand-coded gradient orthe sparsity pattern of the partially separable function.In our test problems, which have carefully coded gradients,the computing time for the hybrid AD option is within a factor of two of thehand-coded option.     

Global Optimization of a Quadratic Functional with Quadratic Equality Constraints, Part 2

In this paper, we investigate a constrained optimization problem with a quadratic cost functional and two quadratic equality constraints. It is assumed that the cost functional is positive definite and that the constraints are both feasible and regular (but otherwise they are unrestricted quadratic functions). Thus, the existence of a global constrained minimum is assured. We develop a necessary and sufficient condition that completely characterizes the global minimum cost. Such a condition is of essential importance in iterative numerical methods for solving the constrained minimization problem, because it readily distinguishes between local minima and global minima and thus provides a stopping criterion for the computation. The result is similar to one obtained previously by the authors. In the previous result, we gave a characterization of the global minimum of a constrained quadratic minimization problem in which the cost functional was an arbitrary quadratic functional (as opposed to positive-definite here) and the constraints were at least positive-semidefinite quadratic functions (as opposed to essentially unrestricted here).     

IGCC空气侧整体综合优化的研究

主要符号表X。。氮气回注系数如空分整体化系数E。；c燃气轮机压气机效率G。l回注氮气流量万燃气轮机透平前温尼。”系统相对效率G。。煤气氮气掺混流量Ea；，c空气专用压缩机效率N。”系统相对功率1前言整体煤气化联合循环（IGCC）系统模拟与优化逐步受到重视，开展了许多相关研究［‘－‘］。但是，现有的方法［‘，‘］一个突出的问题，它是在设定的具体流程方案下的数值分析，这常常导致落入“局部优化掩盖了整体最优”的误区。本文是研究以空分系统为中心的空气侧子系统的整体优化，阐述基本概念，尝试新方法，并结合大型商业化装…     

双模含失谐均匀加宽激光的不稳定性与混沌

研究了双模含失谐均匀加宽激光的不稳定与混沌行为，在不同失谐情况下给出了激光经Ｈｏｐｆ分岔而出现洛仑茨不稳定的判据，它与模式跳变不稳定共同构成了激光的不稳定边界，并且模拟发现洛仑茨不稳定在一定条件下将触发激光模式的跳变，从而表现出双模所特有的非稳定现象。     

混沌的模糊神经网络逆系统控制

提出用Sugeno型的模糊推理神经网络建立混沌系统的逆系统模型,并采用逆系统方法进行混沌的控制.这种方法的特点是可以不必建立混沌系统的解析模型,通过模糊神经网络学习混沌系统的运动规律,通过学习获得的规律对混沌进行有效的控制,并且该控制方法可以控制混沌系统以一定精度跟踪连续变化的给定信号.理论分析及针对虫口模型和Henon模型仿真研究证明了该方法的有效性 关键词： 混沌 模糊神经网络 逆系统控制     

Estimation of dynamic properties of attractors observed in hollow copper electrode atmospheric pressure arc plasma system

Understanding of the basic nature of arc root fluctuation is still one of the unsolved problems in thermal arc plasma physics. It has direct impact on myriads of thermal plasma applications being implemented at present. Recently, chaotic nature of arc root behavior has been reported through the analysis of voltages, acoustic and optical signals which are generated from a hollow copper electrode arc plasma torch. In this paper we present details of computations involved in the estimation process of various dynamic properties and show how they reflect chaotic behavior of arc root in the system.     

New Imperfect Conjugate Gradient Algorithm

We present a method which generates conjugate search directions and maintains the quadratic convergence property, when applied to a quadratic function, even when the line searches are not exact. The method is similar to that given by Dixon, but needs one less vector store. When the method is applied to a number of general functions of different dimensionality, results show the efficiency of the method.     

The uv-Decomposition on a Class of D.C. Functions and Optimality Conditions

In this paper,the UV-theory and P-differential calculus are employed to study second-order ex-pansion of a class of D.C.functions and minimization problems.Under certain conditions,some properties ofthe U-Lagrangian,the second-order expansion of this class of functions along some trajectories are formulated.Some first and second order optimality conditions for the class of D.C.optimization problems are given.     

Ant colony optimization: Introduction and recent trends

Ant colony optimization is a technique for optimization that was introduced in the early 1990's. The inspiring source of ant colony optimization is the foraging behavior of real ant colonies. This behavior is exploited in artificial ant colonies for the search of approximate solutions to discrete optimization problems, to continuous optimization problems, and to important problems in telecommunications, such as routing and load balancing. First, we deal with the biological inspiration of ant colony optimization algorithms. We show how this biological inspiration can be transfered into an algorithm for discrete optimization. Then, we outline ant colony optimization in more general terms in the context of discrete optimization, and present some of the nowadays best-performing ant colony optimization variants. After summarizing some important theoretical results, we demonstrate how ant colony optimization can be applied to continuous optimization problems. Finally, we provide examples of an interesting recent research direction: The hybridization with more classical techniques from artificial intelligence and operations research.