A review of recent advances in global optimization

This paper presents an overview of the research progress in deterministic global optimization during the last decade (1998–2008). It covers the areas of twice continuously differentiable nonlinear optimization, mixed-integer nonlinear optimization, optimization with differential-algebraic models, semi-infinite programming, optimization with grey box/nonfactorable models, and bilevel nonlinear optimization.     

Optimization of technology parameters for the plane-strain component in the process of gas quenching

The paper introduces an optimization method for the technology parameters of the plane-strain component in the process of gas quenching. Distortion, residual stress, average surface hardness and standard deviation of surface hardness are regarded as the optimization objectives. A new heat transfer coefficient model is presented, five distinct heat transfer coefficients are used at various regions of the model. The five heat transfer coefficients are regarded as the design variables, and four regressive equations are established by using response surface method. The four equations, respectively represent the relations between the four optimization objectives and the design variables. A multi-objectives optimization model is established, and the multi-objectives optimization model is optimized by the non-linear method. The optimized technology parameters are used to simulate the gas quenching process by FEM software. The quenching results after optimization are compared with those before optimization. The comparison shows that the quenching quality after optimization is better than that before optimization. After optimization, the four optimization objectives are all improved.     

Bio-inspired optimization of fuzzy logic controllers for robotic autonomous systems with PSO and ACO

In this paper we describe the use of bio-inspired optimization techniques, such as ant colony optimization and particle swarm optimization, for the design of optimal fuzzy logic controllers of autonomous wheeled mobile robots. The results obtained by the simulations with ant colony optimization and particle swarm optimization are statistically compared with previous optimization results obtained with genetic algorithms in order to find out the best optimization technique for a particular robotics problem.     

A filled function method for constrained global optimization

In this paper, a filled function method for solving constrained global optimization problems is proposed. A filled function is proposed for escaping the current local minimizer of a constrained global optimization problem by combining the idea of filled function in unconstrained global optimization and the idea of penalty function in constrained optimization. Then a filled function method for obtaining a global minimizer or an approximate global minimizer of the constrained global optimization problem is presented. Some numerical results demonstrate the efficiency of this global optimization method for solving constrained global optimization problems.     

Successive Optimization Method via Parametric Monotone Composition Formulation*

In this paper a successive optimization method for solving inequality constrained optimization problems is introduced via a parametric monotone composition reformulation. The global optimal value of the original constrained optimization problem is shown to be the least root of the optimal value function of an auxiliary parametric optimization problem, thus can be found via a bisection method. The parametric optimization subproblem is formulated in such a way that it is a one-parameter problem and its value function is a monotone composition function with respect to the original objective function and the constraints. Various forms can be taken in the parametric optimization problem in accordance with a special structure of the original optimization problem, and in some cases, the parametric optimization problems are convex composite ones. Finally, the parametric monotone composite reformulation is applied to study local optimality.     

哈明距离下的网络逆问题研究综述

逆优化问题研究的是如何改变原问题中的权参数,使得某些给定的解是问题在新的权参数下的最优解,且使总的改造费用尽可能少.作为逆优化问题中相对较新的一个分支,哈明距离下的网络逆问题具有较大的理论研究及实际应用价值.此文首先介绍了逆优化问题和哈明距离下的网络逆问题以及它们的应用,然后详细介绍了哈明距离下的网络逆问题的研究动态及使用的研究方法.最后给出了该领域中的一些值得研究的问题.     

基于群智能算法的预防性维修周期优化

分析将蚁群优化算法应用于预防性维修周期工程寻优问题时遇到的算法参数选择困难等问题,提出将粒子群优化算法和空间划分方法引入该过程以改进原蚁群算法的寻优规则和历程.建立混合粒子群和蚁群算法的群智能优化策略:PS_ACO(Particle Swarm and Ant Colony Optimization),并将其应用于混联系统预防性维修周期优化过程中,以解决由于蚁群算法中参数选择不当和随机产生维修周期解值带来的求解精度差、寻优效率低等问题.算法的寻优结果对比分析表明:该PS_ACO算法应用于预防性维修周期优化问题,在寻优效率及寻优精度上有部分改进,且可相对削弱算法参数选择对优化结果的影响.     

Global optimization method using adaptive and parallel ensemble of surrogates for engineering design optimization

As a robust and efficient technique for global optimization, surrogate-based optimization method has been widely used in dealing with the complicated and computation-intensive engineering design optimization problems. It’s hard to select an appropriate surrogate model without knowing the behaviour of the real system a priori in most cases. To overcome this difficulty, a global optimization method using an adaptive and parallel ensemble of surrogates combining three representative surrogate models with optimized weight factors has been proposed. The selection of weight factors is treated as an optimization problem with the desired solution being one that minimizes the generalized mean square cross-validation error. The proposed optimization method is tested by considering several well-known numerical examples and one industrial problem compared with other optimization methods. The results show that the proposed optimization method can be a robust and efficient approach in surrogate-based optimization for locating the global optimum.     

Scalarization of the fuzzy optimization problems

Scalarization of the fuzzy optimization problems using the embedding theorem and the concept of convex cone (ordering cone) is proposed in this paper. Two solution concepts are proposed by considering two convex cones. The set of all fuzzy numbers can be embedded into a normed space. This motivation naturally inspires us to invoke the scalarization techniques in vector optimization problems to solve the fuzzy optimization problems. By applying scalarization to the optimization problem with fuzzy coefficients, we obtain its corresponding scalar optimization problem. Finally, we show that the optimal solution of its corresponding scalar optimization problem is the optimal solution of the original fuzzy optimization problem.     

Necessary Optimality Conditions and New Optimization Methods for Cubic Polynomial Optimization Problems with Mixed Variables

Multivariate cubic polynomial optimization problems, as a special case of the general polynomial optimization, have a lot of practical applications in real world. In this paper, some necessary local optimality conditions and some necessary global optimality conditions for cubic polynomial optimization problems with mixed variables are established. Then some local optimization methods, including weakly local optimization methods for general problems with mixed variables and strongly local optimization methods for cubic polynomial optimization problems with mixed variables, are proposed by exploiting these necessary local optimality conditions and necessary global optimality conditions. A global optimization method is proposed for cubic polynomial optimization problems by combining these local optimization methods together with some auxiliary functions. Some numerical examples are also given to illustrate that these approaches are very efficient.     

Time-dependent reliability-based design optimization with probabilistic and interval uncertainties

Time-dependent reliability-based design optimization with both probabilistic and interval uncertainties is a cost-consuming problem in engineering practice which generally needs huge computational burden. In order to deal with this issue, a sequential single-loop optimization strategy is established in this work. The established sequential single-loop optimization strategy converts the original triple-loop optimization into a sequence of deterministic optimization, the estimations of time instant and interval value that corresponding to the worst case scenario, and the minimum performance target point searching. Two key points in the sequential single-loop optimization strategy guarantee the high efficiency of the proposed strategy. One is that no iterative searching step is needed to find the minimum performance target point at each iteration in the proposed sequential single-loop optimization strategy. The other is that only the correction step needs the reliability analysis to correct the design parameter solutions. In the example section, four minimum performance target point searching techniques are combined with the sequential single-loop optimization strategy to solve the corresponding optimization problems so to illustrate the effectiveness of the established strategy.     

On relaxations of the max k-cut problem formulations

A tight continuous relaxation is a crucial factor in solving mixed integer formulations of many NP-hard combinatorial optimization problems. The (weighted) max k-cut problem is a fundamental combinatorial optimization problem with multiple notorious mixed integer optimization formulations. In this paper, we explore four existing mixed integer optimization formulations of the max k-cut problem. Specifically, we show that the continuous relaxation of a binary quadratic optimization formulation of the problem is: (i) stronger than the continuous relaxation of two mixed integer linear optimization formulations and (ii) at least as strong as the continuous relaxation of a mixed integer semidefinite optimization formulation. We also conduct a set of experiments on multiple sets of instances of the max k-cut problem using state-of-the-art solvers that empirically confirm the theoretical results in item (i). Furthermore, these numerical results illustrate the advances in the efficiency of global non-convex quadratic optimization solvers and more general mixed integer nonlinear optimization solvers. As a result, these solvers provide a promising option to solve combinatorial optimization problems. Our codes and data are available on GitHub.     

不确定信息下分式半无限优化问题的近似最优性刻画

该文研究了一类带不确定参数的多目标分式半无限优化问题。首先借助鲁棒优化方法,引入该不确定多目标分式优化问题的鲁棒对应优化模型,并借助Dinkelbach方法,将该鲁棒对应优化模型转化为一般的多目标优化问题。随后借助一种标量化方法,建立了该优化问题的标量化问题,并刻画了它们的解之间的关系。最后借助一类鲁棒型次微分约束规格,建立了该不确定多目标分式优化问题拟近似有效解的鲁棒最优性条件。     

鲁棒投资组合选择优化问题的研究进展

对近年来投资组合研究优化研究的热点问题——鲁棒投资组合优化研究的现状和发展趋势作了综述性研究．在投资组合选择优化的均值-方差模型的基础上,回顾了鲁棒投资组合选择优化问题的发展历史;详细地介绍了鲁棒投资组合选择优化的研究热点及国内外研究现状,就鲁棒投资组合选择优化问题的未来发展方向和主要研究内容,提出了新的观点,以期为相关领域的研究工作提供参考依据．     

Recent advances in robust optimization: An overview

This paper provides an overview of developments in robust optimization since 2007. It seeks to give a representative picture of the research topics most explored in recent years, highlight common themes in the investigations of independent research teams and highlight the contributions of rising as well as established researchers both to the theory of robust optimization and its practice. With respect to the theory of robust optimization, this paper reviews recent results on the cases without and with recourse, i.e., the static and dynamic settings, as well as the connection with stochastic optimization and risk theory, the concept of distributionally robust optimization, and findings in robust nonlinear optimization. With respect to the practice of robust optimization, we consider a broad spectrum of applications, in particular inventory and logistics, finance, revenue management, but also queueing networks, machine learning, energy systems and the public good. Key developments in the period from 2007 to present include: (i) an extensive body of work on robust decision-making under uncertainty with uncertain distributions, i.e., “robustifying” stochastic optimization, (ii) a greater connection with decision sciences by linking uncertainty sets to risk theory, (iii) further results on nonlinear optimization and sequential decision-making and (iv) besides more work on established families of examples such as robust inventory and revenue management, the addition to the robust optimization literature of new application areas, especially energy systems and the public good.     

基于动力系统的线性不等式组的解法

本文提出了一种新的求解线性不等式组可行解的方法-基于动力系统的方法．假设线性不等式组的可行域为非空,在可行域的相对内域上建立一个非线性关系表达式,进而得到一个结构简单的动力系统模型．同时,定义了穿越方向。文章最后的数值实验结果表明此算法是有效的．     

超越方程的优化解法

针对粒子群算法局部搜索能力差,后期收敛速度慢等缺点,提出了一种改进的粒子群算法,该算法是在粒子群算法后期加入拟牛顿方法,充分发挥了粒子群算法的全局搜索性和拟牛顿法的局部精细搜索性,从而克服了粒子群算法的不足,把超越方程转化为函数优化的问题,利用该算法求解,数值实验结果表明,算法有较高的收敛速度和求解精度。     

Solving air traffic conflict problems via local continuous optimization

This paper first introduces an original trajectory model using B-splines and a new semi-infinite programming formulation of the separation constraint involved in air traffic conflict problems. A new continuous optimization formulation of the tactical conflict-resolution problem is then proposed. It involves very few optimization variables in that one needs only one optimization variable to determine each aircraft trajectory. Encouraging numerical experiments show that this approach is viable on realistic test problems. Not only does one not need to rely on the traditional, discretized, combinatorial optimization approaches to this problem, but, moreover, local continuous optimization methods, which require relatively fewer iterations and thereby fewer costly function evaluations, are shown to improve the performance of the overall global optimization of this non-convex problem.     

Machine learning problems from optimization perspective

Both optimization and learning play important roles in a system for intelligent tasks. On one hand, we introduce three types of optimization tasks studied in the machine learning literature, corresponding to the three levels of inverse problems in an intelligent system. Also, we discuss three major roles of convexity in machine learning, either directly towards a convex programming or approximately transferring a difficult problem into a tractable one in help of local convexity and convex duality. No doubly, a good optimization algorithm takes an essential role in a learning process and new developments in the literature of optimization may thrust the advances of machine learning. On the other hand, we also interpret that the key task of learning is not simply optimization, as sometimes misunderstood in the optimization literature. We introduce the key challenges of learning and the current status of efforts towards the challenges. Furthermore, learning versus optimization has also been examined from a unified perspective under the name of Bayesian Ying-Yang learning, with combinatorial optimization made more effectively in help of learning.