Discrete global descent method for discrete global optimization and nonlinear integer programming

Journal of Global Optimization

Volumn 37, Issue 3, 2007, Pages 357-379

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

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b SHANGHAI UNIVERSITY   (China)

Author keywords

Discrete global descent method; Discrete global optimization; Integer programming; Nonlinear integer programming

Indexed keywords

FUNCTION EVALUATION; INTEGER PROGRAMMING; NONLINEAR PROGRAMMING; PROBLEM SOLVING; RELIABILITY;

DISCRETE GLOBAL DESCENT METHOD; DISCRETE GLOBAL OPTIMIZATION; LOCAL SEARCH METHODS; NONLINEAR INTEGER PROGRAMMING;

GLOBAL OPTIMIZATION;

EID: 33846599209     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-006-9053-9     Document Type: Article

References (31)

1. Borghi, C.A., Casadei, D., Febbri, M., Serra, G.: Reduction of the torque ripple in permanent magnet actuators by a multi-objective minimization technique. IEEE Trans. Magnet. 34(5), 2869-2872 (1998)
2. Borghi, C.A., Fabbri, M.: A combined technique for the global optimization of the inverse electromagnetic problem solution. IEEE Trans. Magnet. 33(2), 1947-1950 (1997)
3. Borghi, C.A., Febbri, M., Di Barba, P., Savini, A.: A comparative study of loneys solenoid by different techniques of global optimization. Int. J. Appl. Electromagnet. Mech. 10(5), 417-423 (1999)
4. Conley, W.: Computer Optimization Techniques. Petrocelli Books Inc, New York (1980)
5. Fisher, M.L.: The Lagrangian relaxation method for solving integer programming problems. Manage. Sci. 27(1), 1-18 (1981)
6. Ge, R.-P.: A filled function method for finding a global minimizer of a function of several variables. Math. Program. 46(2), 191-204 (1990)
7. Ge, R.-R, Huang, C.-B.: A continuous approach to nonlinear integer programming. Appl. Mathe. Comput. 34(1), 39-60 (1989)
8. Ge, R.-P., Qin, Y.-F.: A class of filled functions for finding global minimizers of a function of several variables. J. Optim. Theory Appl. 54(2), 241-252 (1987)
9. Geoffirion, A.M.: Lagrangian relaxation for integer programming. Mathe. Program. Study 2, 82-114 (1974)
10. Goldstein, A.A., Price, J.F.: On descent from local minima. Mathe. Comput. 25 (115), 569-574 (1971)
11. Gupta, O.K., Ravindran, A.: Branch and bound experiments in convex nonlinear integer programming. Manage. Scie 31(12), 1533-1546 (1985)
12. Hock, W., Schittkowski, K.: Test Examples for Nonlinear Programming Codes. Springer-Verlag, New York (1981.)
13. Körner, F.: A new branching rule for the branch and bound algorithm for solving nonlinear integer programming problems. BIT 28(3), 701-708 (1988)
14. Li, D., Sun, X.-L.: Success guarantee of dual search in integer programming: pth power Lagrangian method. J. Global Optim. 18, 235-254 (2000)
15. Li, D., Sun, X.: Nonlinear Integer Programming. Springer, Boston (2006)
16. Li, D., White, D.J.: pth Power Lagrangian method for integer programming. Ann. Operat. Res. 98, 151-170 (2000)
17. Liu, X.: Finding global minima with a computable filled function. J. Global Optim. 19(2), 151-161 (2001)
18. Liu, X., Xu, W.: A new filled function applied to global optimization. Comp. Operat. Res. 31(1), 61-80 (2004)
19. Mohan, C., Nguyen, H.T.: A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems. Comput. Optim. Appl. 14, 103-132 (1999)
20. Moré, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Software 7(1), 17-41 (1981)
21. Ng, C.-K.: High performance continuous/discrete global optimization methods. Ph.D. Dissertation, Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Hong Kong S.A.R., P.R.China (2003)
22. Ng, C.-K., Li, D., Zhang, L.-S.: Riled function approaches to nonlinear integer programming: a survey. In: Hou, S.H., Yang, X.M., Chen, G.Y. (eds.) Frontiers in Optimization and Control. Kluwer Academic Publishers. To appear (2005a)
23. Ng, C.-K., Zhang, L.-S., Li, D., Tian, W.-W.: Discrete filled function method for discrete global optimization. Comput. Optim. Appl. 31(1), 87-115 (2005b)
24. Schittkowski, K.: More Test Examples for Nonlinear Programming Codes. Springer-Verlag (1987)
25. Sun, X.-L., Li, D.: Asymptotic strong duality for bounded integer programming: a logarithmic-exponential dual formulation. Math. Operat. Res. 25, 625-644 (2000)
26. Xu, Z., Huang, H.-X., Pardalos, P.M., Xu, C.-X.: Filled functions for unconstrained global optimization. J. Global Optim. 20(1), 49-65 (2001)
27. Yang, X.Q., Goh, C.J.: A nonlinear Lagrangian function for discrete optimization problems. In: Migdalas, A., Pardalos, P.M., and Värbrand, P. (eds.) From Local to Global Optimization. Kluwer Academic Publishers, Dordrecht (2001)
28. Zhang, L.-S., Gao, F., Zhu, W.-X.: Nonlinear integer programming and global optimization. J. Comput. Math. 17(2), 179-190 (1999)
29. Zhang, L.-S., Ng, C.-K., Li, D., Tian, W.-W.: A new filled function method for global optimization. J. Global Optim. 28(1), 17-43 (2004)
30. Zheng, Q., Zhuang, D.-M.: Integral global minimization: algorithms, implementations and numerical tests. J. Global Optim 7(4), 421-454 (1995)
31. Zhu, W.-X.: An approximate algorithm for nonlinear integer programming. Appl. Math. Comput. 93(2-3), 183-193 (1998)