A new discrete filled function algorithm for discrete global optimization

Authors:
Yang Yongjian;Liang Yumei
Affiliations:
Department of Mathematics, Shanghai University, Shanghai 200444, China;Department of Mathematics, Shanghai University, Shanghai 200444, China
Venue:
Journal of Computational and Applied Mathematics
Year:
2007

Citing 4
Cited 0

More test examples for nonlinear programming codes

More test examples for nonlinear programming codes
A filled function method for finding a global minimizer of a function of several variables

Mathematical Programming: Series A and B
The globally convexized filled functions for global optimization

Applied Mathematics and Computation
Test Examples for Nonlinear Programming Codes

Test Examples for Nonlinear Programming Codes

Quantified Score

Hi-index	7.29

Visualization

Abstract

A definition of the discrete filled function is given in this paper. Based on the definition, a discrete filled function is proposed. Theoretical properties of the proposed discrete filled function are investigated, and an algorithm for discrete global optimization is developed from the new discrete filled function. The implementation of the algorithms on several test problems is reported with satisfactory numerical results.