On a Polynomial Fractional Formulation for Independence Number of a Graph

In this paper we characterize the local maxima of a continuous global optimization formulation for finding the independence number of a graph. Classical Karush-Kuhn-Tucker conditions and simple combinatorial arguments are found sufficient to deduce several interesting properties of the local and global maxima. These properties can be utilized in developing new approaches to the maximum independent set problem.     

Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms

We investigate subdivision strategies that can improve the convergence and efficiency of some branch and bound algorithms of global optimization. In particular, a general class of so called weakly exhaustive simplicial subdivision processes is introduced that subsumes all previously known radial exhaustive processes. This result provides the basis for constructing flexible subdivision strategies that can be adapted to take advantage of various problem conditions.     

原木随机存贮策略的最优化问题

本主要介绍原木经销商在周期内原木变价销售情况下的最佳期初贮存量的决策方法，在建立期望机会成本的数学模型基础上，探讨原木随机存贮策略的最优化问题。     

Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions

A domain partitioning algorithm for minimizing or maximizing a Lipschitz continuous function is enhanced to yield two new, more efficient algorithms. The use of interval arithmetic in the case of rational functions and the estimates of Lipschitz constants valid in subsets of the domain in the case of others and the addition of local optimization have resulted in an algorithm which, in tests on standard functions, performs well.     

The Cross-Entropy Method for Continuous Multi-Extremal Optimization

In recent years, the cross-entropy method has been successfully applied to a wide range of discrete optimization tasks. In this paper we consider the cross-entropy method in the context of continuous optimization. We demonstrate the effectiveness of the cross-entropy method for solving difficult continuous multi-extremal optimization problems, including those with non-linear constraints.      

A result on sets,with applications to vector optimization

In this paper there is stated a result on sets in ordered linear spaces which can be used to show that some properties of the sets are inherited by their convex hulls under suitable conditions. As applications one gives a characterization of weakly efficient points and a duality result for nonconvex vector optimization problems.     

On the S-procedure and Some Variants

We give a concise review and extension of S-procedure that is an instrumental tool in control theory and robust optimization analysis. We also discuss the approximate S-Lemma as well as its applications in robust optimization.The many suggestions and detailed corrections of an anonymous referee are gratefully acknowledged.     

Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations

In this paper, we review briefly some methods for minimizing a functionF(x), which proceed by follwoing the solution curve of a system of ordinary differential equations. Such methods have often been thought to be unacceptably expensive; but we show, by means of extensive numerical tests, using a variety of algorithms, that the ODE approach can in fact be implemented in such a way as to be more than competitive with currently available conventional techniques.This work was supported by a SERC research studentship for the first author. Both authors are indebted to Dr. J. J. McKeown and Dr. K. D. Patel of SCICON Ltd, the collaborating establishment, for their advice and encouragement.     

解可分离约束双凹规划问题的一种外逼近方法[英文]

在本文中，我们提出了双凹规划问题和更一般的广义凹规划问题。我们给出了双凹规划问题的整体最优性条件，并构造了一个有限终止外逼近算法。     

箱覆盖问题的半定松驰算法

箱覆盖问题是NP困难问题中的经典问题，得到了广泛地研究，九十年代以来，半定松驰策略被用来求解组合优化问题，取得了很好的结果[13]，本文首次给箱覆盖问题的半定松驰算法，算法的理论分析结果表明它适合于求解大规模的箱覆盖问题。