Optimization Online


A new discrete filled function with generic local searches for global nonlinear integer optimization

J Di Mauro (jdimauro***at***dc.uba.ar)
HD Scolnik (hugo***at***dc.uba.ar)

Abstract: The problem of finding global minima of nonlinear discrete functions arises in many fields of practical matters. In recent years, methods based on discrete filled functions become popular as ways of solving these sort of problems. However, they rely on the steepest descent method for local searches. Here we present an approach that does not depend on a particular local optimization method, and a new discrete filled function with the useful property that a good continuous global optimization algorithm applied to it leads to an approximation of the solution of the nonlinear discrete problem. Numerical results are given showing the efficiency of the new approach

Keywords: Discrete Global Optimization, Discrete Filled Function, Nonlinear Optimization, Approximate Algorithms.

Category 1: Global Optimization (Applications )

Category 2: Global Optimization (Theory )

Category 3: Global Optimization (Applications )

Citation: Computer Science Department, Ciudad Universitaria,C1428EGA,Buenos Aires,Argentina

Download: [PDF]

Entry Submitted: 01/23/2020
Entry Accepted: 01/23/2020
Entry Last Modified: 01/23/2020

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society