Computational experience with a new class of convex underestimators: Box-constrained NLP problems

Journal of Global Optimization

Volumn 29, Issue 3, 2004, Pages 249-264

  Akrotirianakis, Ioannis G ^a   Floudas, Christodoulos A ^a  

^a Princeton University   (United States)

Author keywords

Branch and bound; Convex underestimators; Global optimization

Indexed keywords

ALGORITHMS; FUNCTIONS; ITERATIVE METHODS; PROBLEM SOLVING; RANDOM PROCESSES; VECTORS;

BRANCH-AND-BOUND; CONVEX UNDERESTIMATORS; NONCONVEX FUNCTIONS; STOCHASTIC ALGORITHM;

OPTIMIZATION;

EID: 6944233968     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:JOGO.0000044768.75992.10     Document Type: Conference Paper

References (25)

1. Adjiman, C.S., Androulakis, I. and Floudas, C. (1998a), A global optimization method, αBB, for general twice-differentiable constrained NLPs II. Implementation and computational results, Computers and Chemical Engineering 22, 1159-1179.
2. Adjiman, C.S., Dallwig, S., Floudas, C.A. and Neumaier, A. (1998b), A global optimization method, αBB, for general twice-differentiable constrained NLPs I: Theoretical aspects, Computers and Chemical Engineering 22(9), 1137-1158.
3. Akrotirianakis, I.G. and Floudas, C.A. (2004), A new class of improved convex underestimators for twice continuously differentiable constrained NLPs, accepted for publication: Journal of Global Optimization.
4. Al-Khayyal, F.H. and Falk, J.E. (1983), Jointly constrained biconvex programming, Mathematics of Operations Research 8, 523.
5. Ali, M.M. and Torn, A. (1999), Population set based global optimization algorithms: Some modifications and numerical studies. Technical report, Department of Computer Science, Abo Academi University, Turku, Finland.
6. Floudas, C.A. (2000), Deterministic Global Optimization: Theory, Methods and Applications. Kluwer Academic Publishers, Dordrecht.
7. Gelatt, C.D., Kirkpatric, S. and Vecchi, M.P. (1983), Optimization by simulated annealing, Science 220, 671.
8. Goldberg, D.E. (1987), Genetic Algorithms in Search, Optimization and Machine Learning. NY. Addison-Welsey, New York.
9. Griewank, A.O. (1981), Generalized descent for global optimization, Journal of Optimization Theory and Applications 34, 11-39.
10. Hansen, E. (1980), Global optimization using inteval analysis: the multidimensional case, Numer. Math. 34, 247-270.
11. Horst, R. and Tuy, H. (1987), On the convergence of global methods in multiextrimal optimization, Journal of Optimization Theory and Applications 54, 283.
12. Jansson, C. and Knuppel, O. (1994), Numerical results for a self-validating global optimization method. Technical Report 94.1, Forschungsshcwerpunkt Informations und Kommunicationstechnik, Technical University of Harburg, Germany.
13. Locatelli, M. and Schoen, F. (1999), Random Linkage: A family of acceptance/rejection algorithms for global optimization, Mathematical Programming 85, 379-396.
14. Maranas, C.D. and Floudas, C.A. (1994), Global minimum potential energy conformations for small molecules, Journal of Global Optimization 4, 135-170.
15. More, J., Garbow, B. and Hillstrom, K. (1981), Testing unconstrained optimization software, ACM Transactions on Mathematical Software 7, 17-41.
16. Rinnoy-Kan, A.H.G. and Timmer, G.T. (1987a), Stochastic global optimization methods. Part I: Clustering methods, Mathematical Programming 39, 27-56.
17. Rinnoy-Kan, A.H.G. and Timmer, G.T. (1987b), Stochastic global optimization, Part II: Multi-level Methods, Mathematical Programming 39, 57-78.
18. Ryoo, H.S. and Sahinidis, N.V. (1996), A Branch-and-Reduce approach to global optimization, Journal of Global Optimization 8(2), 107-139.
19. Schoen, F. (1991), Stochastic techniques for global optimization: a survey of recent Advances, Journal of Global Optimization 1(3), 207-228.
20. Sherali, H.D. and Alameddine, A. (1992), A new reformulation linearization technique for bilinear programming problems, Journal of Global Optimization 2(4), 379.
21. Shubert, B. (1972), A sequential method seeking the global minimum of a function, SIAM Journal of Numerical Analysis 9, 379-388.
22. Trefethen, N. (2002), A hundred-dollar, hundred-digit challenge, SIAM News 35.
23. Tuy, H. (1987), Global minimum of the difference of two convex functions, Mathematical Programming Study 30, 150.
24. van Hentenryck, P., Michel, L. and Deville, Y. (1997), Numerica: A Modeling Language for Global Optimization. MIT Press, Cambridge, MA.
25. Zhu, W. (2002), A sequential convexification method (SCM) for continuous global optimization. Technical Report 02.1, Department of Computer Science and Technology, Fuzhou University, China.