Discrete global descent method for discrete global optimization and nonlinear integer programming

A novel method, entitled the discrete global descent method, is developed in this paper to solve discrete global optimization problems and nonlinear integer programming problems. This method moves from one discrete minimizer of the objective function f to another better one at each iteration with the help of an auxiliary function, entitled the discrete global descent function. The discrete global descent function guarantees that its discrete minimizers coincide with the better discrete minimizers of f under some standard assumptions. This property also ensures that a better discrete minimizer of f can be found by some classical local search methods. Numerical experiments on several test problems with up to 100 integer variables and up to 1.38 × 10¹⁰⁴ feasible points have demonstrated the applicability and efficiency of the proposed method.     

具有生产性与福利性公共支出的随机内生增长模型

文章建立一个随机内生增长模型来阐明主要政策参数对经济增长与社会福利的影响.若对生产函数、效用函数、偏好及随机干扰作一些特殊的假设,我们证明了主要政策参数的均衡值能被模型参数唯一决定.进一步我们还得到了期望增长率与储蓄的清晰解.文章的最后,我们证明了政府支出直接影响个体决策者的决策:即提高经济增长率将减少福利;反之,增加福利将减少增长率.     

Solving a class of multiplicative programming problems via c-programming

In this note we show that many classes of global optimization problems can be treated most satisfactorily by classical optimization theory and conventional algorithms. We focus on the class of problems involving the minimization of the product of several convex functions on a convex set which was studied recently by Kunoet al. [3]. It is shown that these problems are typical composite concave programming problems and thus can be handled elegantly by c-programming [4]–[8] and its techniques.     

关于半线性热方程整体解的注记

利用Besov空间的热核刻画及压缩映射原理,研究半线性热方程ut-△u＝u|u|a的初值问题,得到了当初值u0∈Lp0(Rn)且||u0||(B·)p-n (1/p0-1/p),∞(Rn)(p0＝na/2,p＞p0)充分小时,整体解的存在性及在一定条件下解的惟一性.     

Pattern Search Method for Discrete <Emphasis Type="Italic">L</Emphasis><Subscript>1</Subscript>–Approximation

We propose a pattern search method to solve a classical nonsmooth optimization problem. In a deep analogy with pattern search methods for linear constrained optimization, the set of search directions at each iteration is defined in such a way that it conforms to the local geometry of the set of points of nondifferentiability near the current iterate. This is crucial to ensure convergence. The approach presented here can be extended to wider classes of nonsmooth optimization problems. Numerical experiments seem to be encouraging. This work was supported by M.U.R.S.T., Rome, Italy.     

Constraint incorporation in optimization

Numerical methods for solving constrained optimization problems need to incorporate the constraints in a manner that satisfies essentially competing interests; the incorporation needs to be simple enough that the solution method is tractable, yet complex enough to ensure the validity of the ultimate solution. We introduce a framework for constraint incorporation that identifies a minimal acceptable level of complexity and defines two basic types of constraint incorporation which (with combinations) cover nearly all popular numerical methods for constrained optimization, including trust region methods, penalty methods, barrier methods, penalty-multiplier methods, and sequential quadratic programming methods. The broad application of our framework relies on addition and chain rules for constraint incorporation which we develop here.     

A system-theoretic framework for a wide class of systems I: Applications to numerical analysis

A system-theoretic framework is proposed, which allows the study of hybrid uncertain systems, which do not satisfy the so-called “semigroup property.” Characterizations of the notion of robust global asymptotic output stability (RGAOS) are given. Based on the provided characterizations, the qualitative behavior of hybrid systems obtained by time-discretization of systems of ordinary differential equations with a globally asymptotically stable equilibrium point, is studied.     

A Nonlinear Drift - Diffusion System with Electric Convection Arising in Electrophoretic and Semiconductor Modeling

A multi-dimensional transient drift-diffusion model for (at most) three charged particles, consisting of the continuity equations for the concentrations of the species and the Poisson equation for the electric potential, is considered. The diffusion terms depend on the concentrations. Such a system arises in electrophoretic modeling of three species (neutrally, positively and negatively charged) and in semiconductor theory for two species (positively charged holes and negatively charged electrons). Diffusion terms of degenerate type are also possible in semiconductor modeling. For the initial boundary value problem with mixed Dirichlet - Neumann boundary conditions and general reaction rates, a global existence result is proved. Uniqueness of solutions follows in the Dirichlet boundary case if the diffusion terms are uniformly parabolic or if the initial and boundary densities are strictly positive. Finally, we prove that solutions exist which are positive uniformly in time and globally bounded if the reaction rates satisfy appropriate growth conditions.     

Protein Conformation of a Lattice Model Using Tabu Search

We apply tabu search techniques to the problem of determining the optimal configuration of a chain of protein sequences on a cubic lattice. The problem under study is difficult to solve because of the large number of possible conformations and enormous amount of computations required. Tabu search is an iterative heuristic procedure which has been shown to be a remarkably effective method for solving combinatorial optimization problems. In this paper, an algorithm is designed for the cubic lattice model using tabu search. The algorithm has been tested on a chain of 27 monomers. Computational results show that our method outperforms previously reported approaches for the same model.     

一个非协调膜元的高精度分析

本文讨论一个四自由度三角形非协调膜元的整体超收敛性，外推和亏量校正。