Discrete filled function method for discrete global optimization

Computational Optimization and Applications

Volumn 31, Issue 1, 2005, Pages 87-115

  Ng, Chi Kong ^a   Zhang, Lian Sheng ^b   Li, Duan ^a   Tian, Wei Wen ^b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b SHANGHAI UNIVERSITY   (China)

Author keywords

Discrete filled function method; Discrete global optimization; Linear integer programming; Nonlinear integer programming; Quadratic integer programming

Indexed keywords

COMBINATORIAL MATHEMATICS; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; MATHEMATICAL MODELS; OPTIMIZATION; QUADRATIC PROGRAMMING;

DISCRETE FILLED FUNCTION METHOD; DISCRETE GLOBAL OPTIMIZATION; LINEAR INTEGER PROGRAMMING; NONLINEAR INTEGER PROGRAMMING; QUADRATIC INTEGER PROGRAMMING;

FUNCTION EVALUATION;

EID: 18844451467     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10589-005-0985-7     Document Type: Article

References (32)

1. A. Beck and M. Teboulle, "Global optimality conditions for quadratic optimization problems with binary constraints," SIAM Journal on Optimization, vol. 11, no. 1, pp. 179-188, 2000.
2. W. Conley, Computer Optimization Techniques, Petrocelli Books Inc.: New York, 1980.
3. M.W. Cooper, "A survey of methods for pure nonlinear programming," Management Science, vol. 27, no. 3, pp. 353-361, 1981.
4. M.W. Cooper, "Nonlinear integer programming for various forms of constraints," Naval Research Logistics Quarterly, vol. 29, no. 4, pp. 585-592, 1983.
5. L.C.W. Dixon, J. Gomulka, and S.E. Herson, "Reflection on global optimization problems," in Optimization in Action: Proceedings of the Conference on Optimization in Action held at the University of Bristol in January 1975, L.C.W. Dixon (Ed.), New York, 1976 pp. 398-435.
6. M.L. Fisher, "The Lagrangian relaxation method for solving integer programming problems," Management Science, vol. 27, no. 1, pp. 1-18, 1981.
7. R.-P. Ge, "A filled function method for finding a global minimizer of a function of several variables," Mathematical Programming, vol. 46, no. 2, pp. 191-204, 1990.
8. R.-P. Ge and C.-B. Huang, "A continuous approach to nonlinear integer programming," Applied Mathematics and Computation, vol. 34, no. 1, pp. 39-60, 1989.
9. R.-P. Ge and Y.-F. Qin, "A class of filled functions for finding global minimizers of a function of several variables," Journal of Optimization Theory and Applications, vol. 54, no. 2, pp. 241-252, 1987.
10. A.M. Geoffirion, "Lagrangian relaxation for integer programming," Mathematical Programming Study, vol. 2, pp. 82-114, 1974.
11. A.A. Goldstein and J.F. Price, "On descent from local minima," Mathematics of Computation, vol. 25, no. 115, pp. 569-574, 1971.
12. O.K. Gupta and A. Ravindran, "Branch and bound experiments in convex nonlinear integer programming," Management Science, vol. 31, no. 12, pp. 1533-1546, 1985.
13. Q.-M. Han and J.-Y. Han, "Revised filled function methods for global optimization," Applied Mathematics and Computation, vol. 119, nos. 2/3, pp. 217-228, 2001.
14. W. Hock and K. Schittkowski, Test Examples for Nonlinear Programming Codes, Springer-Verlag, New York, 1981.
15. F. Körner, "A new branching rule for the branch and bound algorithm for solving nonlinear integer programming problems," BIT, vol. 28, no. 3, pp. 701-708, 1988.
16. A.V. Levy and A. Montalvo, "The tunneling algorithm for the global minimization of functions," SIAM Journal on Scientific and Statistical Computing, vol. 6, no. 1, pp. 15-29, 1985.
17. D. Li and X.-L. Sun, "Success guarantee of dual search in integer programming: pth power Lagrangian method," Journal of Global Optimization, vol. 18, pp. 235-254, 2000.
18. D. Li and D.J. White, "pth power Lagrangian method for integer programming," Annals of Operations Research, vol. 98, pp. 151-170, 2000.
19. V.V. Litinetski and B.M. Abramzon, "MARS - A multi-start adaptive random search method for global constrained optimization in engineering applications," Engineering Optimization, vol. 30, pp. 125-154, 1998.
20. X. Liu, "Finding global minima with a computable filled function," Journal of Global Optimization, vol. 19, no. 2, pp. 151-161, 2001.
21. R. Luus and T.H.I. Jaakola, "Optimization by direct search and systematic reduction of the size of the search region," AIChE Journal, vol. 19, no. 4, pp. 760-765, 1973.
22. C. Mohan and H.T. Nguyen, "A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems," Computational Optimization and Applications, vol. 14, pp. 103-132, 1999.
23. J.J. Moré, B.S. Garbow, and K.E. Hillstrom, "Testing unconstrained optimization software," ACM Transactions on Mathematical Software, vol. 7, no. 1, pp. 17-41, 1981.
24. W.L. Price, "Global optimization by controlled random search," Journal of Optimization: Theory and Applications, vol. 40, pp. 333-348, 1983.
25. K. Schittkowski, More Test Examples for Nonlinear Programming Codes, Springer-Verlag, 1987.
26. X.-L. Sun and D. Li, "Asymptotic strong duality for bounded integer programming: A logarithmic-exponential dual formulation," Mathematics of Operations Research, vol. 25, pp. 625-644, 2000.
27. Z. Xu, H.-X. Huang, P.M. Pardalos, and C.-X. Xu, "Filled functions for unconstrained global optimization," Journal of Global Optimization, vol. 20, no. 1, pp. 49-65, 2001.
28. X.Q. Yang and C.J. Goh, "A nonlinear Lagrangian function for discrete optimization problems," in From Local to Global Optimization, A. Migdalas, P. M. Pardalos, and P. Värbrand (Eds.), Kluwer Academic Publishers, Dordrecht, 2001.
29. L.-S. Zhang, F. Gao, and W.-X. Zhu, "Nonlinear integer programming and global optimization," Journal of Computational Mathematics, vol. 17, no. 2, pp. 179-190, 1999.
30. L.-S. Zhang, C.-K. Ng, D. Li, and W.-W. Tian, "A new filled function method for global optimization," Journal of Global Optimization, vol. 28, no. 1, pp. 17-43, 2004.
31. Q. Zheng and D.-M. Zhuang, "'Integral global minimization: Algorithms, implementations and numerical tests," Journal of Global Optimization, vol. 7, no. 4, pp. 421-454, 1995.
32. W.-X. Zhu, "An approximate algorithm for nonlinear integer programming," Applied Mathematics and Computation, vol. 93, nos. 2/3, pp. 183-193, 1998.