Identifying a global optimizer with filled function for nonlinear integer programming

DOI10.1155/2011/171697MaRDI QIDQ659491zbMATH OpenOpenAlexWikidataFDO

Authors Wei-Xiang Wang, Liansheng Zhang, Youlin Shang

Publication date 23 January 2012

Published in Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2011/171697

Mathematics Subject Classification ID

Integer programming (90C10) Nonlinear programming (90C30)

Review text

Summary: This paper presents a filled function method for finding a global optimizer of integer programming problem. The method contains two phases: the local minimization phase and the filling phase. The goal of the former phase is to identify a local minimizer of the objective function, while the filling phase aims to search for a better initial point for the first phase with the aid of the filled function. A two-parameter filled function is proposed, and its properties are investigated. A corresponding filled function algorithm is established. Numerical experiments on several test problems are performed, and preliminary computational results are reported.

Recommendations

• A filled function method for finding a global minimizer on global integer optimization
• scientific article; zbMATH DE number 5926315
• A new filled function method for nonlinear integer programming problem
• scientific article; zbMATH DE number 2068701
• Modified Filled Function Method for Resolving Nonlinear Integer Programming Problem

Cites work

• pth power Lagrangian method for integer programming
• A class of filled functions for finding global minimizers of a function of several variables
• A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
• A filled function method for finding a global minimizer on global integer optimization
• A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• Discrete filled function method for discrete global optimization
• Discrete global descent method for discrete global optimization and nonlinear integer programming
• scientific article; zbMATH DE number 1558263 (Why is no real title available?)
• scientific article; zbMATH DE number 5056297 (Why is no real title available?)
• Nonlinear integer programming for various forms of constraints

Cited in

(2)

• A filled function method for constrained global integer optimization
• A filled function method for finding a global minimizer on global integer optimization

This page was built for publication: Identifying a global optimizer with filled function for nonlinear integer programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659491)