Abstract
A test problem generator, by means of neural networks nonlinear function approximation capability, is given in this paper which provides test problems, with many predetermined local minima and a global minimum, to evaluate nonlinear programming algorithms that are designed to solve the problem globally.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aarts, E.H.L. and Korst, J.H.M. (1989), Boltzmann machines for travelling salesman problems, European J. of Operational Research 39: 79-95.
Chew, S.H. and Zheng, Q. (1988), Integral Global Optimization, volume 298 of Lecture Notes in Economics and Mathematical Systems, Springer-Verlag.
Cichocki, A. and Unbehauen, A. (1993), Neural Networks for Optimizations and Signal Processing, John Wiley & Sons.
Floudas, C.A. and Pardalos, P.M. (1987), A Collection of Test Problems for Constrained Global Optimization Algorithms, volume 455 of Lecture Notes in Computer Science, Springer-Verlag.
Girosi, F. and Poggio, T. (1991), Networks for Learning-A View from the Theory of Approximation of Functions, Neural Networks Concepts, Applications and Implementations, Vol. 1, Prentice Hall Inc.
Goldstein, A.A. and Price, J.F. (1971), On descent from local minima, Mathematics of Computation 25: 569-574.
Haykin, S. (1994), Neural Networks — A Comprehensive Foundation, Macmillan College Publishing Company.
Horst, R. and Tuy, H. (1990), Global Optimization: Deterministic Approaches, Springer-Verlag.
Horst, R., Pardalos, P.M., and Thoai, N.V. (1995), Introduction to Global Optimization, Kluwer Academic Publishers.
Kirkpatrick, S. (1984), Optimization by simulated annealing: quantitative studies, J. Statist. Physics 34: 974.
Lenard, M.L. and Minkoff, M. (1984), Randomly generated test problems for positive definite quadratic programming, ACM Trans. Math. Soft. 10(1): 86-96.
Mockus, J. (1989), Bayesian Approach to Global Optimization, Kluwer Academic Publishers.
Pardalos, P.M. and Rosen, J.B. (1986), Methods for global concave minimization: A bibliographic survey, SIAM Rev. 28(3): 367-379.
Ratschek, H. and Rokne, J. (1988), New Computer Methods for Global Optimization, Halsted Press.
Schittkowski, K. 91980), Nonlinear Programming Codes, volume 183 of Lecture Notes in Economics and Mathematical Systems, Springer-Verlag.
Schittkowski, K. 91987), More Text Examples for Nonlinear Programming Codes, volume 282 of Lecture Notes in Economics and Mathematical Systems, Springer-Verlag.
Schoen, F. (1991), Stochastic techniques for global optimization: a survey of recent advances, J. of Global Optimization 1(2): 207-228.
Torn, A. and Zilinskas, A. (1989), Global Optimization, volume 350 of Lecture Notes in Computer Science, Springer-Verlag.
Wingo, D.R. (1985), Globally minimizing polynomials without evaluating derivatives, Intern. J. Computer Math. 17: 287-294.
Zhang, X.-S. (1984), A survey on deterministic methods for searching global optimum, Chinese J. of Operations Research 3(2): 1-3 (in Chinese).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Liu, D., Zhang, XS. Test Problem Generator by Neural Network for Algorithms that Try Solving Nonlinear Programming Problems Globally. Journal of Global Optimization 16, 229–243 (2000). https://doi.org/10.1023/A:1008306323448
Issue Date:
DOI: https://doi.org/10.1023/A:1008306323448