Convex-concave extensions

BIT Numerical Mathematics

Volumn 40, Issue 2, 2000, Pages 291-313

  Jansson, Christian ^a  

^a HAMBURG UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Global optimization; Interval arithmetic; Range of functions

Indexed keywords

EID: 0010457990     PISSN: 00063835     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022343007844     Document Type: Article

References (30)

1. F. A. Al-Khayyal and J. E. Falk, Jointly constrained biconvex programming, Math. Oper. Res., 8:2 (1983), pp. 273-286.
2. G. Alefeld and J. Herzberger, Introduction to Interval Computations, Academic Press, New York, 1983.
3. I. P. Androulakis, C. D. Maranas, and C. A. Floudas, αBB: A global optimization method for general constrained nonconvex problems, J. Global Optim., 7:4 (1995), pp. 337-363.
4. S. Dallwig, A. Neumaier, and H. Schichl, GLOPT - A program for constrained global optimization, in Developments in Global Optimization, I. M. Bomze et al., eds., Proceedings of the 3rd Workshop, Szeged, Hungary, December 10-14, 1995, Kluwer Academic Publishers, Dordrecht, 1997, pp. 19-36.
5. J. E. Falk, Lagrange multipliers and nonconvex programs, SIAM J. Control, 7 (1969), pp. 534-545.
6. C. A. Floudas and P. M. Pardalos, A Collection of Test Problems for Constrained Global Optimization Algorithms, Vol. 455 of Lecture Notes in Computer Science, Springer-Verlag, New York, 1990.
7. J. Garloff, The Bernstein algorithm, Interval Comput., 2 (1993), pp. 154-168.
8. R. E. Gomory, Outline of an algorithm for integer solution to linear programs, Bull. Amer. Math. Soc., 64 (1958), pp. 275-278.
9. A. Griewank and G. F. Corliss, Automatic Differentiation of Algorithms. Theory, Implementation, and Applications, SIAM, Philadelphia, PA, 1991.
10. S. J. Grotzinger, Supports and convex envelopes, Math. Programming, 31 (1985), pp. 339-347.
11. E. R. Hansen, Global Optimization using Interval Analysis, Marcel Dekker, New York, 1992.
12. G. Heindl, A representation of the interval hull of a tolerance polyhedron describing inclusions of function values and slopes, submitted, 1998.
13. R. Horst and P. M. Pardalos, Handbook of Global Optimization, Kluwer Academic Publishers, Dordrecht, 1995.
14. C. Jansson, On self-validating methods for optimization problems, in Topics in Validated Computations, J. Herzberger, ed., Studies in ional Mathematics 5, North-Holland, Amsterdam, 1994, pp. 381-438.
15. C. Jansson, Construction of convex lower and concave upper bound functions, Tech. Report 98.1, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1998.
16. R. B. Kearfott, Rigorous Global Search: Continuous Problems, Kluwer Academic Publishers, Dordrecht, 1996.
17. J. E. Kelly, The cutting plane method for solving convex programs, SIAM J. Indust. Appl. Math., 8 (1960), pp. 703-712.
18. R. Krawczyk and A. Neumaier, Interval slopes for rational functions and associated centered forms, SIAM J. Numer. Anal., 22:3 (1985), pp. 604-616.
19. A. V. Levy, A. Montalvo, S. Gomez, and A. Calderon, Topics in Global Optimization, in Lecture Notes in Mathematics, 909, Springer-Verlag, New York, 1981.
20. C. D. Maranas and C. A. Floudas, Global minimum potential energy conformations of small molecules, J. Global Optim., 4:2 (1994), pp. 135-170.
21. R. E. Moore, Interval Analysis, Prentice-Hall, Englewood Cliffs, NJ, 1966.
22. R. E. Moore, Methods and Applications of Interval Analysis, SIAM, Philadelphia, 1979.
23. A. Neumaier, Interval Methods for Systems of Equations, Encyclopedia of Mathematics and its Applications, Cambridge University Press, 1990.
24. A. Neumaier, NOP - A compact input format for nonlinear optimization problems, in Developments in Global Optimization, I. M. Bomze et al., eds., Proceedings of the 3rd Workshop, Szeged, Hungary, December 10-14, 1995, Kluwer Academic Publishers, Dordrecht, 1997, pp. 1-18.
25. H. Ratschek and J. Rokne, Computer Methods for the Range of Functions, Halsted Press, New York, 1984.
26. H. Ratschek and J. Rokne, New Computer Methods for Global Optimization, Wiley, New York, 1988.
27. S. M. Rump, Expansion and estimation of the range of nonlinear functions, Math. Comp., 65:216 (1996), pp. 1503-1512.
28. K. Schittkowski, NLPQL: A Fortran subroutine solving constrained nonlinear programming problems, Annals Operations Research, 5 (1986), pp. 485-500.
29. C. A. Schnepper and M. A. Stadtherr, Application of a parallel interval newton/generalized bisection algorithm to equation-based chemical process flowsheeting, Interval Comput., 4 (1993), pp. 40-64.
30. P. Van Hentenryck, P. Michel, and Y. Deville, NUMERICA: A Modelling Language for Global Optimization, MIT Press, Cambridge, 1997.