跳到主要导航 跳到搜索 跳到主要内容

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

  • Chinese University of Hong Kong
  • Shanghai University

科研成果: 期刊稿件 › 文章 › 同行评审

摘要

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 × 10104 feasible points have demonstrated the applicability and efficiency of the proposed method.

源语言英语
页(从-至)357-379
页数23
期刊Journal of Global Optimization
卷37
期3
DOI
出版状态已出版 - 3月 2007
已对外发布是

学术指纹

探究 'Discrete global descent method for discrete global optimization and nonlinear integer programming' 的科研主题。它们共同构成独一无二的学术指纹。

引用此