A comparative study on optimization methods for the constrained nonlinear programming problems

Mathematical Problems in Engineering

Volumn 2005, Issue 2, 2005, Pages 165-173

  Yeniay, Ozgur ^a  

^a HACETTEPE UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 27444438797     PISSN: 1024123X     EISSN: None     Source Type: Journal    
DOI: 10.1155/MPE.2005.165     Document Type: Article

References (22)

1. J. Abadie and J. Carpentier, Generalization of the Wolfe reduced gradient method to the case of nonlinear constraints, Optimization (Sympos., Univ. Keele, Keele, 1968) (R. Fletcher, ed.), Academic Press, London, 1969, with discussion, pp. 37-47.
2. P. T. Boggs and J. W. Tolle, Sequential quadratic programming, Acta Numerica, 1995, Acta Numer., Cambridge University Press, Cambridge, 1995, pp. 1-51.
3. _, Sequential quadratic programming for large-scale nonlinear optimization, J. Comput. Appl. Math. 124 (2000), no. 1-2, 123-137.
4. K. Deb, An efficient constraint handling method for genetic algorithms, Comput. Methods Appl. Mech. Eng. 186 (2000), no. 2-4, 311-338.
5. R. Fletcher, Practical Methods of Optimization, A Wiley-Interscience Publication, John Wiley & Sons, Chichester, 1987.
6. C. A. Floudas and P. M. Pardalos, A Collection of Test Problems for Constrained Global Optimization Algorithms, Lecture Notes in Computer Science, vol. 455, Springer, Berlin, 1990.
7. D. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Massachusetts, 1989.
8. C. Kao, Performance of several nonlinear programming software packages on microcomputers, Comput. Oper. Res. 25 (1998), no. 10, 807-816.
9. A. F. Kuri-Morales and J. Gutiérrez-Garcia, Penalty functions methods for constrained optimization with genetic algorithms: a statistical analysis, Proc. 2nd Mexican International Conference on Artificial Intelligence, Springer-Verlag, Heidelberg, Germany, 2001, pp. 108-117.
10. L. S. Lasdon, A. D. Warren, A. Jain, and M. Ratner, Design and testing of a generalized reduced gradient code for nonlinear programming, ACM Trans. Math. Software 4 (1978), no. 1, 34-50.
11. M. Mathur, S. B. Karale, S. Priye, V. K. Jayaraman, and B. D. Kulkarni, Ant colony approach to continuous function optimization, Ind. Engng. Chem. Res 39 (2000), no. 10, 3814-3822.
12. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer, Berlin, 1994.
13. _, Genetic algorithms, numerical optimization and constraints, Proc. 6th International Conference on Genetic Algorithms (L. J. Eshelman, ed.), Morgan Kaufmann, California, 1995. pp. 151-158.
14. Z. Michalewicz and M. Schoenauer, Evolutionary algorithms for constrained parameter optimization problems, Evolutionary Computation 4 (1996), no. 1, 1-32.
15. K. Miettinen, M. M. Mäkelä, and J. Toivanen, Numerical comparison of some penalty-based constraint handling techniques in genetic algorithms, J. Global Optim. 27 (2003), no. 4, 427-446.
16. H. S. Ryoo and N. V. Sahinidis, Global optimization of nonconvex NLPs and MINLPs with applications in process design, Comput. Oper. Res. 19 (1995), no. 5, 551-566.
17. M. Sakawa and K. Yauchi, Floating point genetic algorithms for nonconvex nonlinear programming problems: revised GENOCOP III, Electron. Comm. Japan 83 (2000), no. 8, 1-9.
18. H. Sarimveis and A. Nikolakopoulos, A line up evolutionary algorithm for solving nonlinear constrained optimization problems, Comput. Oper. Res. 32 (2005), no. 6, 1499-1514.
19. K. Schittkowski, More Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems, vol. 282, Springer, Berlin, 1987.
20. V. S. Summanwar, V. K. Jayaraman, B. D. Kulkarni, H. S. Kusumakar, V. Gupta, and J. Rajesh, Solution of constrained optimization problems by multi-objective genetic algorithm, Comput. Oper. Res. 26 (2002), no. 10, 1481-1492.
21. T. Wang, Global optimization for constrained nonlinear programming, Ph.D. thesis, Department of Computer Science, University of Illinois, Illinois, 2001.
22. L. Yan and D. Ma, Global optimization of non-convex nonlinear programs using line-up competition algorithm, Comput. Oper. Res. 25 (2001), no. 11-12, 1601-1610.