A new discrete filled function algorithm for discrete global optimization

Journal of Computational and Applied Mathematics

Volumn 202, Issue 2, 2007, Pages 280-291

  Yongjian, Yang ^a   Yumei, Liang ^a  

^a SHANGHAI UNIVERSITY   (China)

Author keywords

Discrete global optimization; Filled function method; Nonlinear integer programming

Indexed keywords

ALGORITHMS; DISCRETE TIME CONTROL SYSTEMS; FUNCTION EVALUATION; INTEGER PROGRAMMING; NONLINEAR PROGRAMMING; NUMERICAL METHODS;

DISCRETE GLOBAL OPTIMIZATION; FILLED FUNCTION METHODS;

GLOBAL OPTIMIZATION;

EID: 33847049848     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2006.02.032     Document Type: Article

References (5)

1. Ge R.P. A filled function method for finding a global minimizer of a function of several variables. Math. Programming 46 (1990) 191-204
2. Ge R.P., and Qin Y.F. The globally convexized filled functions for global optimization. Appl. Math. Comput. 35 (1990) 131-158
3. Hock W., and Schittkowski K. Test Examples for Nonlinear Programming Codes (1981), Springer, New York
4. Goldstein A.A., and Price J.F. On descent from local minima. Math. Comput. 115 25 (1971) 569-574
5. Schittkowski K. More Test Examples for Nonlinear Programming Codes (1987), Springer, New York