Complete search in continuous global optimization and constraint satisfaction

Acta Numerica

Volumn 13, Issue , 2004, Pages 271-369

  Neumaier, Arnold ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 2942655185     PISSN: 09624929     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0962492904000194     Document Type: Review

References (347)

1. E. H. L. Aarts and J. K. Lenstra, eds (1997), Local Search in Combinatorial Optimization, Wiley, Chichester.
2. C. S. Adjiman, I. P. Androulakis, C. D. Maranas and C. A. Floudas (1996), 'A global optimization method αBB for process design', Comput. Chem. Engin. 20, 419-424.
3. C. S. Adjiman, S. Dallwig, C. A. Floudas and A. Neumaier (1998a) 'A global optimization method, αBB, for general twice-differentiable constrained NLPs, I: Theoretical advances', Comput. Chem. Engin. 22, 1137-1158.
4. C. S. Adjiman, I. P. Androulakis and C. A. Floudas (1998b), 'A global optimization method, αBB, for general twice-differentiable constrained NLPs, II: Implementation and computational results', Comput. Chem. Engin. 22, 1159-1179.
5. C. S. Adjiman and C. A. Floudas (1996), 'Rigorous convex underestimators for general twice-differentiable problems', J. Global Optim. 9, 23-40.
6. I. G. Akrotirianakis and C. A. Floudas (2004), 'A new class of improved convex underestimators for twice continuously differentiable constrained NLPs', J. Global Optim., in press.
7. ALIAS-C++ (2003), A C++ Algorithms Library of Interval Analysis for Equation Systems, Version 2.2. User manual: manual-alias-C++2.2.ps at www-sop.inria.fr/coprin/logiciels/ALIAS/ALIAS-C++/
8. F. Alizadeh (2003), Semidefinite and second order cone programming foundations, algorithms and applications. Slides: tutorialProsper.pdf at www.ima.umn.edu/talks/workshops/3-11.2003/alizadeh/
9. F. A. Al-Khayyal and J. E. Falk (1983), 'Jointly constrained biconvex programming', Math. Oper. Res. 8, 273-286.
10. F. A. Al-Khayyal and H. D. Sherali (2000), 'On finitely terminating branch-and-bound algorithms for some global optimization problems', SIAM J. Optim. 10, 1049-1057.
11. F. A. Al-Khayyal, C. Larsen and T. van Voorhis (1995), 'A relaxation method for nonconvex quadratically constrained quadratic programs', J. Global Optim. 6, 215-230.
12. E. Allgower, M. Erdmann and K. Georg (2002), 'On the complexity of exclusion algorithms for optimization', J. Complexity 18, 573-588.
13. Le Thi Hoai An and Pham Dinh Tao (1998), 'A branch-and-bound method via DC optimization algorithm and ellipsoidal technique for box constrained nonconvex quadratic programming problems', J. Global Optim. 13, 171-206.
14. E. D. Anderson and K. D. Anderson (1995), 'Presolving in linear programming', Math. Program. 71, 221-245.
15. I. P. Androulakis, C. D. Maranas and C. A. Floudas (1995), 'αBB: A global optimization method for general constrained nonconvex problems', J. Global Optim. 7, 337-363.
16. K. Anstreicher (2003), 'Recent advances in the solution of quadratic assignment problems', Math. Program. B 97, 27-42.
17. C. Audet, P. Hansen, B. Jaumard and G. Savard (2000), 'A branch and cut algorithm for nonconvex quadratically constrained quadratic programming', Math. Program. 87, 131-152.
18. A. B. Babichev, O. B. Kadyrova, T. P. Kashevarova, A. S. Leshchenko, and A. L. Semenov (1993), 'UniCalc: A novel approach to solving systems of algebraic equations', Interval Computations 3, 29-47.
19. V. Balakrishnan and S. Boyd (1992), Global optimization in control system analysis and design, in Control and Dynamic Systems: Advances in Theory and Applications. Vol. 53 (C. T. Leondes, ed.), Academic Press, New York, pp. 1-56.
20. E. Balas (1979), 'Disjunctive programming', Ann. Discrete Math. 5, 3-51.
21. E. Balas, S. Ceria and G. Cornuejols (1993), 'A lift-and-project cutting plane algorithm for mixed 0-1 programs', Math. Program. A 58, 295-323.
22. R. S. Barr, B. L. Golden, J. P. Kelly, M. G. C. Resende, and W. R. Stewart (1995), 'Designing and reporting on computational experiments with heuristic methods', J. Heuristics 1, 9-32.
23. E. M. L. Beale (1979), Branch and bound methods for mathematical programming systems, Ann. Discrete Math. 5 201-219.
24. E. M. L. Beale (1988), Introduction to Optimization, Wiley, Chichester.
25. E. M. L. Beale and J. J. H. Forrest (1976), 'Global optimization using special ordered sets', Math. Program. 10, 52-69.
26. E. M. L. Beale and J. A. Tomlin (1970), Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables, in OR 69: Proc. Fifth Int. Conf. Oper. Res. (J. Lawrence, ed.) Tavistock Publications, London, pp. 447-454.
27. R. W. Backer and G. V. Lago (1970), A global optimization algorithm, in Proc. 8th Allerton Conf. Cicuits Systems Theory (Monticello, Illinois, 1970), pp. 3-12.
28. O. Ben-Ayed (1993), 'Bilevel linear programming', Comput. Oper. Res. 20, 485501.
29. F. Benhamou and W. J. Older (1997). 'Applying interval arithmetic to real, integer, and boolean constraints', J. Logic Program. 32, 1-24.
30. F. Benhamou, D. McAllister and P. Van Hentenryck (1994), CLP (intervals) revisited, in Proc. International Symposium on Logic Programming, MIT Press, Ithaca, NY, pp. 124-138.
31. S. Berner (1996), 'Parallel methods for verified global optimization: Practice and theory', J. Global Optim. 9, 1-22.
32. M. Berz, C. Bischof, G. Corliss and A. Griewank, eds (1996), Computational Differentiation: Techniques, Applications, and Tools, SLAM, Philadelphia.
33. A. C. Billups and K. G. Murty (2000), 'Complementarity problems', J. Comput. Appl. Math. 124, 303-318.
34. R. E. Bixby, M. Fenelon, Z. Gu, E. Rothberg and R. Wunderling (2000), MIP: Theory and practice: Closing the gap, in System Modelling and Optimization: Methods, Theory and Applications (M. J. D. Powell and S. Scholtes. eds), Kluwer, Dordrecht, pp. 19-49.
35. M. Björkman and K. Holmström (2000), 'Global optimization of costly nonconvex functions using radial basis functions', Optim. Eng. 1, 373-397.
36. C. Bliek (1992), Computer methods for design automation, PhD thesis, Department of Ocean Engineering, MIT.
37. C. Bliek (1997), 'Fast evaluation of partial derivatives and interval slopes', Reliable Comput. 3, 259-268.
38. C. Bliek, P. Spellucci, L. N. Vicente, A. Neumaier, L. Granvilliers, E. Monfroy, F. Benhamou, E. Huens, P. Van Hentenryck, D. Sam-Haroud and B. Faltings (2001), Algorithms for Solving Nonlinear Constrained and Optimization Problems: The State of the Art. A progress report of the COCONUT project: www.mat.univie.ac.at/~neum/glopt/coconut/StArt.html
39. C. Bliek, C. Jermann and A. Neumaier, eds (2003), Global Optimization and Constraint Satisfaction, Vol. 2861 of Lecture Notes in Computer Science, Springer, Berlin.
40. M. Boddy and D. Johnson (2003), A new method for the global solution of large systems of continuous constraints, in Global Optimization and Constraint Satisfaction (C. Bliek et al., eds), Springer, Berlin, pp. 142-156.
41. C. G. E. Boender, A. H. G. Rinnooy Kan, G. T. Timmer and L. Stougie (1982), 'A stochastic method for global optimization', Math. Program. 22, 125-140.
42. I. M. Bomze, T. Csendes, R. Horst and P. M. Pardalos, eds (1996), Developments in Global Optimization, Kluwer, Dordrecht.
43. D. Bondyfalat, B. Mourrain and V. Y. Pan (2000), 'Solution of a polynomial system of equations via the eigenvector computation', Linear Algebra Appl. 319, 193-209.
44. B. Buchberger and F. Winkler (1998), Groebner Bases: Theory and Applications, Cambridge University Press.
45. R. E. Burkard, H. Harnacher and G. Rote (1992), 'Sandwich approximation of univariate convex functions with an application to separable convex programming', Naval Res. Logist. 38, 911-924.
46. J. V. Burke (1991), 'An exact penalization viewpoint of constrained optimization', SIAM J. Control Optim. 29, 968-998.
47. M. R. Bussiek and A. S. Drud (2001), SBB: A new solver for mixed integer nonlinear programming. Slides: www.gams.com/presentations/or01/sbb.pdf SBB user manual (2002): www.gams.com/solvers/sbb.pdf
48. M. R. Bussiek and A. S. Drud (2001), SBB: A new solver for mixed integer nonlinear programming. Slides: www.gams.com/presentations/or01/sbb.pdf SBB user manual (2002): www.gams.com/solvers/sbb.pdf
49. M. R. Bussiek, A. S. Drud, A. Meeraus and A. Pruessner (2003), Quality assurance and global optimization, in Global Optimization and Constraint Satisfaction (C. Bliek et al., eds), Springer, Berlin, pp. 223-238.
50. The Cambridge Cluster Database (1997), web document: brian.ch.cam.ac.uk/CCD.html
51. E. Carrizosa, P. Hansen and F. Messine (2004), 'Improving interval analysis bounds by translations', J. Global Optim., to appear.
52. H. M. Chen and M. H. van Emden (1995), Adding interval constraints to the Moore-Skelboe global optimization algorithm, in Extended Abstracts of APIC'95, International Workshop on Applications of Interval Computations (V. Kreinovich, ed.), Reliable Comput. (Supplement), pp. 54-57.
53. G. Chesi and A. Garulli (2001), On the characterization of the solution set of polynomial systems via LMI techniques, in Proc. of the European Control Conference ECC 2001, Porto (Portugal), September 4-7, 2001, pp. 2058-2063.
54. J. G. Cleary (1987), 'Logical arithmetic', Future Computing Systems 2, 125-149.
55. COCONUT (2001), Continuous constraints: Updating the technology. Web site: www.mat.univie.ac.at/~neum/glopt/coconut.html
56. The COCONUT Benchmark (2002). A benchmark for global optimization and constraint satisfaction. Web document: www.mat.univie.ac.at/~neum/glopt/coconut/benchmark.html
57. M. Cohen, U. Naumann and J. Riehme (2003), Differentiation-enabled Fortran 95 compiler technology. Manuscript: www-unix.mes.anl.gov/~naumaan/nagf_m.ps
58. T. F. Coleman and A. Verma (1998), 'The efficient computation of sparse Jacobian matrices using automatic differentiation', SIAM J. Sci. Comput. 19, 1210-1233.
59. H. Cornelius and R. Lohner (1984), 'Computing the range of values of real functions with accuracy higher than second order', Computing 33, 331-347.
60. D. Cox, J. Little and D. O'Shea (1998), Using Algebraic Geometry, Springer, New York.
61. Y. Crama (1993), 'Concave extensions for nonlinear 0-1 maximization problems'. Math. Program. 61, 53-60.
62. H. P. Crowder, R. S. Dembo and J. M. Mulvey (1979), 'On reporting computational experiments with mathematical software', ACM Trans. Math. Software 5, 193-203.
63. T. Csendes (1988), Nonlinear parameter estimation by global optimization: Efficiency and reliability. Acta Cybernetica 8, 361-370. Fortran and C code is at ftp://ftp.jate.u-szeged.hu/pub/matli/optimization/index.html A Fortran 95 version by A. Miller is at www.mat.univie.ac.at/~neum/glopt/contrib/global.f90
64. T. Csendes and D. Ratz (1997), 'Subdivision direction selection in interval methods for global optimization', SIAM J. Numer. Anal. 34, 922-938.
65. S. Dallwig, A. Neumaier and H. Schichl (1997), GLOPT: A program for constrained global optimization, in Developments in Global Optimization (I. Bomze et al., eds), Kluwer, Dordrecht, pp. 19-36.
66. G. B. Dantzig (1960), 'On the significance of solving linear programming problems with some integer variables', Econometrica 28, 30-44.
67. G. B. Dantzig, S. Johnson and W. White (1958), 'A linear programming approach to the chemical equilibrium problem', Management Science 5, 38-43.
68. R. S. Datta (2001), Using semidefinite programming to minimize polynomials. Manuscript: www.math.berkeley.edu/~datta/ee227apaper.pdf
69. E. de Klerk (2002), Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications, Kluwer, Dordrecht.
70. L. C. W. Dixon and G. P. Szegö (1975). Towards Global Optimization, Elsevier, New York.
71. E. D. Dolan and J. J. More (2000). Benchmarking optimization software with COPS. Technical report ANL/MCS-246, Argonne National Laboratory: www-unix.mes.anl.gov/~more/cops
72. E. D. Dolan and J. J. More (2001), Benchmarking optimization software with performance profiles. Technical report ANL/MCS-P861-1200. Argonne National Laboratory: www-unix.mes.anl.gov/~more/cops
73. M. Dorigo, V. Maniezzo and A. Colorni (1991), 'The ant system: Optimization by a colony of cooperating agents', IEEE Trans. Systems, Man, Cyber. Part B 26, 29-41.
74. G. Dueck and T. Scheuer (1990), 'Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing', J. Comput. Physics 90, 161-175.
75. M. A. Duran and I. E. Grossmann (1986), 'An outer approximation algorithm for a class of mixed integer nonlinear programs', Math. Program. 36, 307-339.
76. I. Z. Emiris and J. F. Canny (1995), 'Efficient incremental algorithms for the sparse resultant and the mixed volume', J. Symbolic Comput. 20, 117-149.
77. I. Z. Emiris and B. Mourrain (1999), 'Matrices in elimination theory', J. Symbolic Comput. 28, 3-44.
78. T. G. W. Epperly and E. N. Pistikopoulos (1997), 'A reduced space branch and bound algorithm for global optimization', J. Global Optim. 11, 287-311.
79. T. G. W. Epperly and R. E. Swaney (1996), Branch and bound for global NLP, Chapters 1-2 in Global Optimization in Engineering Design (I. E. Grossmann, ed.), Kluwer, Dordrecht.
80. W. R. Esposito and C. A. Floudas (2000), 'Deterministic global optimization in nonlinear optimal control problems', J. Global Optim. 17, 97-126.
81. J. E. Falk and R. M. Soland (1969), 'An algorithm for separable nonconvex programming', Management Sci. 15, 550-569.
82. J. C. Faugere, P. Gianni, D. Lazard, and T. Mora (1993), 'Efficient computation of zero-dimensional Groebner bases by change of ordering', J. Symbolic Comput. 16, 329-344.
83. A. Fiacco and G. P. McCormick (1990), Sequential Unconstrained Minimization Techniques, Vol. 4 of Classics in Applied Mathematics, SIAM, Philadelphia.
84. R. Fletcher and S. Leyffer (1994), 'Solving mixed integer nonlinear programs by outer approximation', Math. Program. 66, 327-349.
85. R. Fletcher and S. Leyffer (1998), 'Numerical experience with lower bounds for MIQP branch-and-bound', SIAM J. Optim. 8, 604-616.
86. C. A. Floudas (1995), Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications, Oxford University Press.
87. C. A. Floudas (1997), Deterministic global optimization in design, control, and computational chemistry, in Large Scale Optimization with Applications, Part II: Optimal Design and Control (L. T. Biegler et al., eds), Springer, New York, pp. 129-184. ftp://titan.princeton.edu/papers/floudas/ima.pdf
88. C. A. Floudas (1999), Deterministic Global Optimization: Theory, Algorithms and Applications, Kluwer, Dordrecht.
89. C. A. Floudas and P. M. Pardalos (1990), A Collection of Test Problems for Constrained Global Optimization Algorithms, Vol. 455 of Lecture Notes in Computer Science, Springer, Berlin.
90. C. A. Floudas and P. M. Pardalos, eds (1992), Recent Advances in Global Optimization, Princeton University Press.
91. C. A. Floudas and P. M. Pardalos, eds (1996), State of the Art in Global Optimization, Kluwer, Dordrecht.
92. C. A. Floudas and P. M. Pardalos, eds (2000), Optimization in Computational Chemistry and Molecular Biology: Local and Global Approaches, Kluwer, Dordrecht.
93. C. A. Floudas, P. M. Pardalos, C. S. Adjiman, W. R. Esposito, Z. H. Gümüs, S. T. Harding, J. L. Kiepeis, C. A. Meyer and C. A. Schweiger (1999), Handbook of Test Problems in Local and Global Optimization, Kluwer, Dordrecht. titan.princeton.edu/TestProblems/
94. F. Forgó (1988), Nonconvex Programming, Akadémiai Kiadó, Budapest.
95. S. Forrest (1993), 'Genetic algorithms: Principles of natural selection applied to computation', Science 261, 872-878.
96. R. Fourer (2003), Convexity recognition. In preparation.
97. R. Fourer, D. M. Gay and B. W. Kernighan (1993), AMPL: A Modeling Language for Mathematical Programming, Duxbury Press. Brooks/Cole Publishing Company. www.ampl.com/cm/cs/what/ampl/
98. T. Fujie and M. Kojima (1997), 'Sernidefinite programming relaxation for nonconvex quadratic programs', J. Global Optim. 10, 367-380.
99. J. M. Gablonsky and C. T. Kelley (2001), 'A locally-biased form of the DIRECT algorithm', J. Global Optim. 21, 27-37.
100. GAMS World (2003), web document: www.gamsworld.org
101. M. R. Garey and D. S. Johnson (1979), Computers and Intractability, Freeman, San Francisco, CA.
102. K. Gatermann and P. Parrilo (2004), 'Symmetry groups, semidefinite programs, and sum of squares', math.AC/0211450, J. Pure Appl. Algebra, to appear. www.zib.de/gatermann/publi.html
103. C.-Y. Gau and L. Schrage (2004), Implementation and testing of a branch-andbound based method for deterministic global optimization, in Proceedings of the Conference Frontiers in Global Optimization, Santorini, Greece, June 2003 (C. A. Floudas and P. M. Pardalos, eds), Kluwer, Dordrecht.
104. D. M. Gay (1984), A trust-region approach to linearly constrained optimization, in Numerical Analysis (D. F. Griffiths, ed.), Vol. 1066 of Lecture Notes in Mathematics, Springer, Berlin, pp. 72-105.
105. K. Georg (2001), 'Improving the efficiency of exclusion algorithms'. Adv. Geom. 1. 193-210.
106. K. Georg (2002), 'A new exclusion test', J. Comput. Appl. Math. 152, 147-160.
107. P. E. Gill and W. Murray (1974), 'Newton type methods for unconstrained and linearly constrained optimization'. Math. Program. 7, 311-350.
108. Global (and Local) Optimization (1995), web site: www.mat.univie.ac.at/~neum/glopt.html
109. GLOBAL Library (2002), web document: www.gamsworld.org/global/globallib.ntm
110. Global Optimization Theory Institute (2003), Argonne National Laboratory, September 8-10: www-unix.mcs.anl.gov/~leyffer/gotit/
111. F. Glover (1989/90), 'Tabu Search'. Part 1: ORSA J. Comput. 1 (1989), 190-206. Part 2: ORSA J. Comput. 2 (1990), 4-32.
112. F. Glover (1989/90), 'Tabu Search'. Part 1: ORSA J. Comput. 1 (1989), 190-206. Part 2: ORSA J. Comput. 2 (1990), 4-32.
113. F. Glover and M. Laguna (1997), Tabu Search, Kluwer, Boston.
114. GNU Lesser General Public License (1999), web document: www.gnu.org/copyleft/lesser.html
115. R. E. Gomory (I960), An Algorithm for the Mixed Integer Problem, RM-2597, The Rand Corporation.
116. L. Granvilliers (2001), 'Progress in the solving of a circuit design problem', J. Global Optim. 20, 155-168.
117. P. Gray, W. Hart, L. Painton, C. Phillips, M. Trahan and J. Wagner (1997), A survey of global optimization methods. Web document: www.cs.sandia.gov/opt/survey/
118. H. J. Greenberg (1990), 'Computational testing: Why, how, and how much', ORSA J. Comput. 2, 94-97.
119. A. Griewank (1989), On automatic differentiation, in Mathematical Programming (M. Iri and K. Tanabe, eds), KTK Scientific Publishers, Tokyo, pp. 83-107.
120. A. Griewank (1991), Automatic evaluation of first and higher-derivative vectors, in International Series of Numerical Mathematics, Vol. 97, Birkhäuser, pp. 135-148.
121. A. Griewank (1992), 'Achieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiation', Optim. Methods Software 1, 3554.
122. A. Griewank and G. F. Corliss (1991). Automatic Differentiation of Algorithms, SIAM, Philadelphia.
123. I. E. Grossmann (1990), 'Mixed-integer nonlinear programming techniques for the synthesis of engineering systems', Research in Engineering Design 1, 205-228.
124. I. E. Grossmann, ed. (1996), Global Optimization in Engineering Design, Kluwer, Dordrecht.
125. I. E. Grossmann (2002), 'Review of nonlinear mixed-integer and disjunctive programming techniques', Optim. Eng. 3, 227-252. egon.cheme.emu.edu/Group/Papers/MINLPOPTE.pdf
126. I. E. Grossmann and C. A. Floudas (1987), 'Active constraint strategy for flexibility analysis in chemical processes', Comput. Chem. Eng. 11, 675-693.
127. J. Guddat, F. Guerra Vasquez and H. T. Jongen (1990), Parametric Optimization: Singularities, Path Following and Jumps, Wiley, Chichester.
128. G. D. Hager (1993), 'Solving large systems of nonlinear constraints with application to data modeling', Interval Computations 3, 169-200.
129. T. C. Hales (1998), An overview of the Kepler conjecture. Manuscript: math.MG/9811071-math.MG/9811078 citeseer.nj.nec.com/hales98overview.html
130. E. R. Hansen (2001), Publications related to early interval work of R. E. Moore. Web document: interval.louisiana.edu/Moores_early_papers/bibliography.html
131. E. R. Hansen (1980), 'Global optimization using interval analysis: The multidimensional case', Numer. Math. 34, 247-270.
132. E. R. Hansen (1992a), Global Optimization Using Interval Analysis, Dekker, New York.
133. E. R. Hansen (19926), 'Bounding the solution of interval linear equations', SIAM J. Numer. Anal. 29, 1493-1503.
134. B. Hanzon and D. Jibetean (2003), 'Global minimization of a multivariate polynomial using matrix methods', J. Global Optim. 27, 1-23. homepages.cwi.nl/~jibetean/polopt.ps
135. C. Helmberg (2003), Semidefinite programming. Web site: www-user.tu.-chemnitz.de/~helmberg/semidef.html
136. D. Henrion and J. B. Lasserre (2003a), 'GloptiPoly: Global optimization over polynomials with MATLAB and SeDuMi', A CM Trans. Math. Software 29, 165-194.
137. D. Henrion and J. B. Lasserre (2003b). Solving global optimization problems over polynomials with GloptiPoly 2.1, in Global Optimization and Constraint Satisfaction (C. Bliek et al., eds), Springer, Berlin, pp. 43-58.
138. D. Henrion and J. B. Lasserre (2003c), Detecting global optimally and extracting solutions in GloptiPoly. Manuscript: www.laas.fr/~henrion/papers/extract.pdf
139. W. Hock and K. Schittkowski (1981), Test Examples for Nonlinear Programming Codes, Vol. 187 of Lecture Notes in Economics and Mathematical Systems, Springer, Berlin, ftp://plato.la.aau.edu/pub/donlp2/testenviron.tar.gz
140. J. Holland (1973), 'Genetic algorithms and the optimal allocation of trials', SIAM J. Comput. 2, 88-105.
141. J. N. Hooker (2000), Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley, New York.
142. J. N. Hooker (2002), 'Logic, optimization and constraint programming', INFORMS J. Comput. 14, 295-321. ba.gsia.cmu.edu/jnh/joc2.ps
143. R. Horst and P. M. Pardalos, eds (1995), Handbook of Global Optimization. Kluwer, Dordrecht.
144. R. Horst and H. Tuy (1990). Global Optimization: Deterministic Approaches, 2nd edn, Springer, Berlin.
145. R. Horst, P. M. Pardalos and N. V. Thoai (1995), Introduction to Global Optimization, Kluwer, Dordrecht.
146. W. Huyer and A. Neumaier (1999), 'Global optimization by multilevel coordinate search', J. Global Optim. 14, 331-355. See also further tests in www.mat.univie.ac.at/~neum/glopt/contrib/compbound.pdf
147. W. Huyer and A. Neumaier (2003), SNOBFIT: Stable Noisy Optimization by Branch and Fit. Manuscript: www.mat.univie.ac.at/~neum/papers.html#snobfit
148. W. Huyer and A. Neumaier (2004). 'Integral approximation of rays and verification of feasibility', Reliable Comput. 10, 195-207. www.mat.univie.ac.at/~neum/papers.html#rays
149. E. Hyvönen and S. De Pascale (1996), Interval computations on the spreadsheet, in Applications of Interval Computations (R. B. Kearfott and V. Kreinovich, eds), Applied Optimization, Kluwer, Dordrecht, pp. 169-209.
150. L. Ingber (1993), 'Simulated annealing: Practice versus theory', Math. Comput. Modelling 18, 29-57.
151. R. H. F. Jackson, P. T. Boggs, S. G. Nash and S. Powell (1990/91), 'Guidelines for reporting results of computational experiments: Report of the ad hoc committee', Math. Program. 49, 413-426.
152. E. Janka (2000), A comparison of stochastic methods for global optimization. Web document: www.mat.univie.ac.at/~vpk/matli/gopt-eng.html
153. C. Jansson (1994), On self-validating methods for optimization problems, in Topics in Validated Computations (J. Herzberger, ed.), Elsevier Science BV, pp. 381-438.
154. C. Jansson (2003), Rigorous error bounds for the optimal value of linear programming problems, in Global Optimization and Constraint Satisfaction (C. Bliek et al., eds), Springer, Berlin, pp. 59-70.
155. C. Jansson (2004a), 'A rigorous lower bound for the optimal value of convex optimization problems', J. Global Optim. 28, 121-137.
156. C. Jansson (2004b), 'Rigorous lower and upper bounds in linear programming', SIAM J. Optim., to appear.
157. C. Jansson and O. Knüppel (1992), A global minimization method: The multidimensional case. Technical report 92-1, TU Hamburg-Harburg, January.
158. C. Jansson and O. Knüppel (1995), 'Branch and bound algorithm for bound constrained optimization problems without derivatives', J. Global Optim. 7, 297-333.
159. L. Jaulin and D. Henrion (2004), 'Linear matrix inequalities for interval constraint propagation', Reliable Comput., to appear. www.laas.fr/~henrion/Papers/jaulin.lmi.pdf
160. L. Jaulin, M. Kieffer, O. Didrit and E. Walter (2001), Applied Interval Analysis, Springer, London.
161. R. G. Jeroslow (1977), 'Cutting plane theory: Disjunctive methods', Ann. Discrete Math. 1, 293-330.
162. D. Jibetean and E. De Klerk (2003), Global optimization of rational functions: A semidefinite programming approach. Manuscript: www.optimization-online.org/DB_HTML/2003/05/654. html
163. F. John (1948), Extremum problems with inequalities as subsidiary conditions, in Studies and Essays Presented to R. Courant on his 60th Birthday, January 8, 1948, Interscience, New York, pp. 187-204. Reprinted as Fritz John, Collected Papers, Vol. 2 (J. Moser, ed.), Birkhäuser, Boston (1985), pp. 543-560.
164. F. John (1948), Extremum problems with inequalities as subsidiary conditions, in Studies and Essays Presented to R. Courant on his 60th Birthday, January 8, 1948, Interscience, New York, pp. 187-204. Reprinted as Fritz John, Collected Papers, Vol. 2 (J. Moser, ed.), Birkhäuser, Boston (1985), pp. 543-560.
165. D. S. Johnson (2002), A theoretician's guide to the experimental analysis of algorithms, in Proc. 5th and 6th DIMACS Implementation Challenges (M. Goldwasser, D. S. Johnson, and C. C. McGeoch, eds) AMS, Providence, RI, pp. 215-250. www.research.att.com/~dsj/papers/experguide.pdf
166. D. R. Jones (2001), 'A taxonomy of global optimization methods based on response surfaces', J. Global Optim. 21, 345-383.
167. D. R. Jones, C. D. Perttunen and B. E. Stuckman (1993), 'Lipschitzian optimization without the Lipschitz constant', J. Optim. Theory Appl. 79, 157-181.
168. D. R. Jones, M. Schonlau and W. J. Welch (1998), 'Efficient global optimization of expensive black-box functions', J. Global Optim. 13, 455-492.
169. G. Jónsson and S. A. Vavasis (2001), Accurate solution of polynomial equations using Macaulay resultant matrices. Manuscript: www.cs.Cornell.edu/home/vavasis/vavasis.html
170. W. Kahan (1968), A more complete interval arithmetic: Lecture notes for an engineering summer course in numerical analysis, University of Michigan.
171. J. Kallrath (2002), Gemischt-ganzzahlige Optimierung: Modellierung in der Praxis, Vieweg.
172. W. Karush (1939), Minima of functions of several variables with inequalities as side constraints, MSc dissertation, Department of Mathematics, University of Chicago, IL.
173. R. B. Kearfott (1991), 'Decomposition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems'. Computing 47, 169-191.
174. R. B. Kearfott (1996o), A review of techniques in the verified solution of constrained global optimization problems, in Applications of Interval Computations (R. B. Kearfott and V. Kreinovich, eds), Kluwer, Dordrecht, pp. 23-60.
175. R. B. Kearfott (1996b), Rigorous Global Search: Continuous Problems, Kluwer, Dordrecht.
176. R. B. Kearfott (2003), GlobSol: History, composition, and advice on use, in Global Optimization and Constraint Satisfaction (C. Bliek et al. eds). Springer, Berlin, pp. 17-31.
177. R. B. Kearfott and K. Du (1994), 'The cluster problem in multivariate global optimization', J. Global Optim. 5, 253-265.
178. R. B. Kearfott, M. Novoa and Chenyi Hu (1991), 'A review of preconditioners for the interval Gauss-Seidel method', Interval Computations 1, 59-85.
179. C. Khompatraporn, J. Pintér and Z. B. Zabinsky (2004), 'Comparative assessment of algorithms and software for global optimization', J. Global Optim., to appear.
180. S. Kim and M. Kojima (2001), 'Second order cone programming relaxation methods of nonconvex quadratic optimization problem', Optim. Methods Software 15, 201-224.
181. S. Kim and M. Kojima (2003), 'Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations', Comput. Optim. Appl. 26, 143-154.
182. S. Kim, M. Kojima and H. Waki (2003), Generalized Lagrangian duals and sums of squares relaxations of sparse polynomial optimization problems. Manuscript: math.ewlia.ac.kr/~skim/Research/list.html
183. S. Kirkpatrick, C. D. Geddat, Jr., and M. P. Vecchi (1983), 'Optimization by simulated annealing', Science 220, 671-680.
184. G. R. Kocis and I. E. Grossmann (1989), 'Computational experience with DICOPT solving MINLP problems in process systems engineering', Comput. Chem. Eng. 13, 307-315.
185. M. Kojima and L. Tuncel (2000), 'Cones of matrices and successive convex relaxations of nonconvex sets', SIAM J. Optim. 10, 750-778.
186. M. Kojima, S. Kim and H. Waki (2003). 'A general framework for convex relaxation of polynomial optimization problems over cones', J. Oper. Res. Soc. Japan 46, 125-144.
187. L. V. Kolev (1997), 'Use of interval slopes for the irrational part of factorable functions', Reliable Comput. 3, 83-93.
188. L. V. Kolev and I. P. Nenov (2001), 'Cheap and tight bounds on the solution set of perturbed systems of nonlinear equations', Reliable Comput. 7, 399-408.
189. J. Kostrowicki and H. A. Scheraga (1996), Some approaches to the multiple-minima problem in protein folding, in Global Minimization of Nonconvex Energy Functions: Molecular Conformation and Protein Folding (P. M. Pardalos et al., eds), AMS, Providence, RI, pp. 123-132.
190. R. Krawczyk (1969), 'Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken', Computing 4, 187-201.
191. H. W. Kuhn (1991), Nonlinear programming: A historical note, in History of Mathematical Programming (J. K. Lenstra et al., eds) North Holland, Amsterdam, pp. 82-96.
192. H. W. Kuhn and A. W. Tucker (1951), in Nonlinear Programming, Proc. 2nd Berkeley Symp. Math. Stat. Prob. (J. Neyman, ed.), University of California Press, Berkeley, CA, pp. 481-492.
193. J. C. Lagarias (2002), 'Bounds for local density of sphere packings and the Kepler conjecture', Discrete Comput. Geom. 27, 165-193.
194. J. L. Lagrange (1797), Théorie des Fonctions Analytiques, Impr. de la République, Paris.
195. A. H. Land and A. G. Doig (1960), 'An automated method for solving discrete programming problems', Econometrica 28, 497-520.
196. J. B. Lasserre (2001), 'Global optimization with polynomials and the problem of moments', SIAM J. Optim. 11, 796-817.
197. Y. Lebbah, M. Rueher and C. Michel (2002), A global filtering algorithm for handling systems of quadratic equations and inequations, in Principles and Practice of Constraint Programming, CP 2002 (P. van Hentenryck, ed.), Vol. 2470 of Lecture Notes in Computer Science, Springer, New York, pp. 109-123.
198. Y. Lebbah, C. Michel, M. Rueher, J.-P. Merlet and D. Daney (2004), Efficient and safe global constraints for handling numerical constraint systems, SIAM J. Numer. Anal., to appear.
199. E. Lee and C. Mavroidis (2002), 'Solving the geometric design problem of spatial 3R robot manipulators using polynomial homotopy continuation', J. Mech. Design, Trans. ASME 124, 652-661.
200. E. Lee, C. Mavroidis and J. P. Merlet (2002), Five precision points synthesis of spatial RRR manipulators using interval analysis, in Proc. 2002 ASME Mechanisms and Robotics Conference, Montreal, September 29-October 2, pp. 1-10. robots.rutgers.edu/Publications.htm
201. M. Lerch, G. Tischler, J. Wolff von Gudenberg, W. Hofschuster and W. Krämer (2001), The Interval Library filib 2.0: Design, features and sample programs. Preprint 2001/4, Universität Wuppertal. www.math.uni-wuppertal.de/wrswt/software/filib.html
202. A. V. Levy and A. Montalvo (1985), 'The tunneling algorithm for the global minimization of functions', SIAM J. Sci. Statist. Comput. 6, 15-29.
203. J. D. Little, K. C. Murty, D. W. Sweeney and C. Karel (1963), 'An algorithm for the travelling salesman problem', Oper. Res. 11, 972-989.
204. M. Lobo, L. Vandenberghe, S. Boyd, and H. Lebret (1998), 'Applications of secondorder cone programming', Linear Algebra Appl. 284, 193-228. www.Stanford.edu/~boyd/socp.html
205. W. A. Lodwick (1989), 'Constraint propagation, relational arithmetic in AI systems and mathematical programs', Ann. Oper. Res. 21, 143-148.
206. Z.-Q. Luo, J.-S. Pang and D. Ralph (1996), Mathematical Programs with Equilibrium Constraints, Cambridge University Press, Cambridge.
207. I. J. Lustig and J.-F. Puget (2001), Program does not equal program: Constraint programming and its relationship to mathematical programming, Interfaces 31, 29-53.
208. K. Madsen and S. Skelboe (2002), The early days of interval global optimization. interval.louisiana.edu/conferences/VC02/abstracts/MADS.pdf
209. C. Maheshwari, A. Neumaier and H. Schichl (2003), Convexity and concavity detection. In preparation.
210. K. Makino (1998), Rigorous analysis of nonlinear motion in particle accelerators, PhD thesis, Department of Physics and Astronomy, Michigan State University: bt.pa.msu.edu/makino/phd.atrnl
211. K. Makino and M. Berz (2003), 'Taylor models and other validated functional inclusion methods', Int. J. Pure Appl. Math. 4, 379-456.
212. O. L. Mangasarian (1969), Nonlinear Programming, McGraw-Hill, New York. Reprinted as Classics in Applied Mathematics, SIAM, Philadelphia (1994).
213. O. L. Mangasarian (1969), Nonlinear Programming, McGraw-Hill, New York. Reprinted as Classics in Applied Mathematics, SIAM, Philadelphia (1994).
214. O. L. Mangasarian and S. Fromovitz (1967), 'The Fritz John necessary optimality conditions in the presence of equality and inequality constraints', J. Math. Anal. Appl. 17, 37-47.
215. O. L. Mangasarian and L. McLinden (1985), 'Simple bounds for solutions of monotone complementarity problems and convex programs', Math. Program. 32, 32-40.
216. F. Margot (2003), 'Exploiting orbits in symmetric ILP', Math. Program. 98, 3-21
217. H. M. Markowitz and A. S. Manne (1957), 'On the solution of discrete programming problems', Econometrica 25, 84-110.
218. G. P. McCormick (1972), Converting general nonlinear programming problems to separable nonlinear programming problems. Technical report T-267, George Washington University, Washington, DC.
219. G. P. McCormick (1976), 'Computability of global solutions to factorable nonconvex programs, Part I: Convex underestimating problems', Math. Program. 10, 147-175.
220. C. M. McDonald and C. A. Floudas (1995). 'Global optimization for the phase and chemical equilibrium problem: Application to the NRTL equation', Comput. Chem. Eng. 19, 1111-1139.
221. M. McKay, R. Beckman and W. Conover (1979), 'A comparison of three methods for selecting values of input variables in the analysis of output from a computer code', Technometrics 21, 239-245.
222. J.-P. Merlet (2001), 'A parser for the interval evaluation of analytical functions and its applications to engineering problems', J. Symbolic Comput. 31, 475-486.
223. C. A. Meyer, C. A. Floudas and A. Neumaier (2002), 'Global optimization with nonfactorable constraints'. Ind. Eng. Chem. Res. 41, 6413-6424.
224. R. J. Meziat (2003), Analysis of non convex polynomial programs by the method of moments. Manuscript: www.optimization-online.org/ARCHIVE.DIGEST/2003-03.html
225. Z . Michalewicz (1996). Genetic Algorithm + Data Structures = Evolution Programs, 3rd edn, Springer, New York.
226. H. Mittelmann (2002), Benchmarks. Web site: plato.la.asu.edu/topics/benchm.html
227. J. Mockus (1966), Multiextremal problems in design, PhD Thesis, Nauka.
228. J. Mockus (1989), Bayesian Approach to Global Optimization, Kluwer, Dordrecht.
229. J. Mockus (1994), 'Application of Bayesian approach to numerical methods of global and stochastic optimization', J. Global Optim. 4, 347-356.
230. H. M. Moller and H. J. Stetter (1995), 'Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems', Numer. Math. 70, 311-329.
231. M. Mongeau, H. Karsenty, V. Rouz and J.-B. Hiriart-Urruty (2000), 'Comparison of public-domain software for black box global optimization', Optim, Methods Software 13, 203-226.
232. R. E. Moore (1962), Interval arithmetic and automatic error analysis in digital computing. PhD thesis, Appl. Math. Statist. Lab. Rep. 25, Stanford University, Stanford, CA: interval.louisiana.edu/Moores_early.papers/disert.pdf
233. R. E. Moore (1979), Methods and Applications of Interval Analysis, SIAM, Philadelphia.
234. R. E. Moore and C. T. Yang (1959), Interval analysis, I. Space Division Report LMSD285875, Lockheed Missiles and Space Co. interval.louisiana.edu/Moores.early_papers/Moore_Yang.pdf
235. J. Moré and Z. Wu (1997), 'Global continuation for distance geometry problems', SIAM J. Optim. 7, 814-836.
236. J. J. More, B. S. Garbow and K. E. Hillstrom (1981), 'Testing unconstrained optimization software', ACM Trans. Math. Software 7, 17-41.
237. T. S. Motzkin and E. G. Strauss (1965), 'Maxima for graphs and a new proof of a theorem of Turan', Canad. J. Math. 17, 533-540.
238. B. Mourrain and V. Y. Pan (1997), Solving special polynomial systems by using structured matrices and algebraic residues, in Proc. Workshop on Foundations of Computational Mathematics (F. Cucker and M. Shub, eds), Springer, Berlin, pp. 287-304.
239. B. Mourrain, Y. V. Pan and O. Ruatta (2003), 'Accelerated solution of multivariate polynomial systems of equations', SIAM J. Comput. 32, 435-454.
240. K. G. Murty and S. N. Kabadi (1987), 'Some NP-complete problems in quadratic and nonlinear programming', Math. Program. 39, 117-129.
241. NAG (2003), Differentiation enabled Fortran compiler technology. Web document: www.nag.co.uk/nagware/research/ad_overview.asp
242. N. S. Nedialkov and K. R. Jackson (2001), A new perspective on the wrapping effect in interval methods for initial value problems for ordinary differential equations, in Perspectives on Enclosure Methods (U. Kulisch et al., eds), Springer, Berlin, pp. 219-264. www.cs.toronto.edu/NA/reports.htmltoed.scan00
243. G. L. Nemhauser and L. A. Wolsey (1988). Integer and Combinatorial Optimization, Wiley, New York.
244. G. L. Nemhauser and L. A. Wolsey (1989), Integer programming, Chapter VI in Optimization (G. L. Nemhauser et al., eds), Vol. 1 of Handbooks in Operations Research and Management Science, North Holland, Amsterdam, pp. 447-527.
245. I. P. Nenov and D. H. Fylstra (2003), 'Interval methods for accelerated global search in the Microsoft Excel Solver', Reliable Comput. 9, 143-159.
246. A. Neumaier (1988), The enclosure of solutions of parameter-dependent systems of equations, in Reliability in Computing (R. E. Moore, ed.), Academic Press, San Diego, pp. 269-286. www.mat.univie.ac.at/~neum/publist.html#encl
247. A. Neumaier (1990), Interval Methods for Systems of Equations, Cambridge University Press.
248. A. Neumaier (1993), 'The wrapping effect, ellipsoid arithmetic, stability and confidence regions', Computing Supplementum 9, 175-190.
249. A. Neumaier (1996), 'Second-order sufficient optimality conditions for local and global nonlinear programming', J. Global Optim. 9, 141-151.
250. A. Neumaier (1997), 'Molecular modeling of proteins and mathematical prediction of protein structure', SIAM Review 39, 407-460.
251. A. Neumaier (1999), 'A simple derivation of the Hansen-Bliek-Rohn-Ning-Kearfott enclosure for linear interval equations', Reliable Comput. 5, 131-136. Erratum, Reliable Comput. 6 (2000), 227.
252. A. Neumaier (2001a). 'Generalized Lyapunov-Schmidt reduction for parametrized equations at near singular points', Linear Algebra Appl. 324, 119-131.
253. A. Neumaier (2001b), Introduction to Numerical Analysis, Cambridge University Press, Cambridge.
254. A. Neumaier (2002), 'Taylor forms: Use and limits', Reliable Comput. 9, 43-79.
255. A. Neumaier (2003a). 'Rational functions with prescribed global and local minimizers', J. Global Optim. 25, 175-181.
256. A. Neumaier (2003b), Constraint satisfaction and global optimization in robotics. Manuscript: www.mat .univie.ac.at/~neum/papers.html#rob
257. A. Neumaier and H. Schichl (2003), Sharpening the Karush-John optimality conditions. Manuscript: www.mat.univie.ac.at/~neum/papers.html#kj
258. A. Neumaier and O. Shcherbina (2004), Safe bounds in linear and mixed-integer programming, Math. Program. A 99, 283-296. www.mat.univie.ac.at/~neum/papers.html#mip
259. J. Nocedal and S. J. Wright (1999), Numerical Optimization, Springer Series in Operations Research, Springer, Berlin.
260. I. Nowak, H. Alperin and S. Vigerske (2003), LaGO: An object oriented library for solving MINLPs, in Global Optimization and Constraint Satisfaction (C. Bliek et al., eds), Springer, Berlin, pp. 32-42. www.math.hu-berlin.de/~alpe/papers/LaG0/
261. W. Older and A. Vellino (1993), Constraint arithmetic on real intervals, in Constrained Logic Programming: Selected Research (F. Benhameou and A. Colrnerauer, eds), MIT Press.
262. J. Outrata, M. Kočvara and J. Zowe (1998), Nonsmooth Approach to Optimization problems with Equilibrium Constraints, Kluwer, Dordrecht.
263. A. B. Owen (1992), 'Orthogonal arrays for computer experiments, integration and visualization', Statist. Sinica 2, 439-452.
264. A. B. Owen (1994), 'Lattice sampling revisited: Monte Carlo variance of means over randomized orthogonal arrays'. Ann. Statist. 22, 930-945.
265. I. Papamichail and C. S. Adjiman (2002), 'A rigorous global optimization algorithm for problems with ordinary differential equations', J. Global Optim. 24, 1-33.
266. P. M Pardalos and J. B. Rosen (1987), Constrained Global Optimization: Algorithms and Applications, Vol. 268 of Lecture Notes in Computer Science, Springer, Berlin.
267. P. M. Pardalos and G. Schnitger (1988), 'Checking local optimality in constrained quadratic programming is NP-hard', Oper. Res. Lett. 7, 33-35.
268. R. G. Parker and R. L. Rardin (1988), Discrete Optimization, Academic Press, San Diego, CA.
269. P. A. Parrilo (2003), 'Semidefinite programming relaxations for semialgebraic problems', Math. Program. B 96, 293-320.
270. P. A. Parrilo and S. Lall (2003), 'Semidefinite programming relaxations and algebraic optimization in control1, Europ. J. Control 9, 307-321.
271. P. A. Parrilo and B. Sturmfels (2003), Minimizing polynomial functions, in Algorithmic and quantitative real algebraic geometry, Vol. 60 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, Providence, RI, pp. 83-99. www.arxiv.org/abs/math.0C/0103170
272. J. D. Pintér (1996a), Global Optimization in Action, Kluwer, Dordrecht.
273. J. D. Pintér (1996b), 'Continuous global optimization software: A brief review1, Optima 52, 1-8.
274. J. D. Pintér (1999), LGO: A Model Development System for Continuous Global Optimization. User's Guide, Pintér Consulting Services, Inc., Halifax, NS.
275. S. A. Piyavskii (1972), An algorithm for finding the absolute extremum of a function, USSR Comput. Math. and Math. Phys. 12 57-67.
276. S. Prajna, A. Papachristodoulou and A. Parrilo (2002), SOSTOOLS: Sum of Squares Optimization Toolbox for MATLAB - User's guide. Manuscript: www.optimization-online.org/DB_HTML/2002/05/483.html
277. H. D. Ratliff and W. Pierskalla (1981), 'Reporting computational experience in operations research', Oper. Res. 29, xi-xiv.
278. H. Ratschek and J. G. Rokne (1984), New Computer Methods for the Range of Functions, Ellis Horwood, Chichester.
279. H. Ratschek and J. G. Rokne (1988), New Computer Methods for Global Optimization, Wiley, New York.
280. D. Ratz (1996), On branching rules in second-order branch-and-bound methods for global optimization, in Scientific Computation and Validation (G. Alefeld et al., eds), Akademie-Verlag, Berlin.
281. D. Ratz and T. Csendes (1995), 'On the selection of subdivision directions in interval branch-and-bound methods for global optimization', J. Global Optim. 7, 183-207.
282. A. D. Rikun (1997), 'A convex envelope formula for multilinear functions', J. Global Optim. 10, 425-437.
283. G. Rote (1992), 'The convergence of the sandwich algorithm for approximating convex functions', Computing 48, 337-361.
284. H. S. Ryoo and N. V. Sahinidis (1996), 'A branch-and-reduce approach to global optimization', J. Global Optim. 8, 107-139.
285. J. Sacks, W. J. Welch, T. J. Mitchell and H. P. Wynn (1989), 'Design and analysis of computer experiments', Statist. Sci. 4, 409-435.
286. N. V. Sahinidis (1996), 'BARON: A general purpose global optimization software package', J. Global Optim. 8, 201-205.
287. N. V. Sahinidis (2000), BARON: Branch And Reduce Optimization Navigator User's manual. Web document: archimedes.ses.uiuc.edu/baron/baron.html
288. N. V. Sahinidis (2003), Global optimization and constraint satisfaction: The branch-and-reduce approach, in Global Optimization and Constraint Satisfaction (C. Bliek et al., eds), Springer, Berlin, pp. 1-16.
289. H. Schichl (2004), Global optimization in the COCONUT project, in Numerical Software with Result Verification, Vol. 2991 of Lecture Notes in Computer Science, Springer, Heidelberg, pp. 243-249. www.mat.univie.ac.at/~herman/papers.html
290. H. Schichl and A. Neumaier (2003), Interval analysis on directed acyclic graphs for global optimization. Manuscript: www.mat.univie.ac.at/~neum/papers.html#intdag
291. H. Schichl and A. Neumaier (2004). 'Exclusion regions for systems of equations', SIAM J. Numer. Anal. 42, 383-408. www.mat.univie.ac.at/~neum/papers.html#excl
292. R. B. Schnabel and E. Eskow (1990), 'A new modified Cholesky factorization', SIAM J. Sci. Statist. Comput. 11, 1136-1158.
293. SeDuMi (2001), web site: fewcal.kub.nl/sturm/software/sedumi.html
294. O. Shcherbina (2002), Misprints and mistakes in Floudas et al. (1999). Web document: www.mat.univie.ac.at/~neum/glopt/contrib/handbook_corr.html
295. O. Shcherbina, A. Neumaier, D. Sam-Haroud, Xuan-Ha Vu and Tuan-Viet Nguyen (2003), Benchmarking global optimization and constraint satisfaction codes, in Global Optimization and Constraint Satisfaction (C. Bliek et al., eds), Springer, Berlin, pp. 211-222. www.mat.univie.ac.at/~neum/papers.html#bench
296. J. P. Sheet-man and N. V. Sahinidis (1998), 'A finite algorithm for global minimization of separable concave programs', J. Global Optim. 12, 1-36.
297. H. D. Sherali (1997), 'Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets', Acta Math. Vietnamica 22, 245-270.
298. H. D. Sherali and C. M. Shetty (1980), Optimization with Disjunctive Constraints. Springer, Berlin.
299. H. D. Sherali and C. H. Tuncbilec (1995). 'A reformulation-convexification approach for solving nonconvex quadratic programming problems', J. Global Optim. 7, 1-31.
300. H. D. Sherali and C. H. Tuncbilec (1997a), 'New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems', Oper. Res. Lett. 21, 1-9.
301. H. D. Sherali and C. H. Tuncbilec (1997b), 'Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems', J. Global Optim. 10, 381-390.
302. K. Shimizu, Y. Ishizuka and J. F. Bard (1997), Nondifferentiable and Two-Level Programming, Kluwer, Boston.
303. J. Siek and A. Lumsdaine (1999), 'The matrix template library: Generic components for high-performance scientific computing', Computing in Science and Engineering 18, 70-78. www.osl.iu.edu/research/mtl/
304. S. Skelboe (1974), 'Computation of rational interval functions', BIT 14, 87-95. www.diku.dk/~stig/CompRatIntv.pdf
305. N. J. A. Sloane (2003), web document with tables of packings and designs: www.research.att.com/~njas/
306. H. Stetter (1997), Stabilization of polynomial systems solving with Groebner bases, in Proc. ACM Int. Symp. Symbolic Algebraic Computation, pp. 117-124.
307. F. H. Stillinger (1985), 'Role of potential-energy scaling in the low-temperature relaxation behavior of amorphous materials', Phys. Rev. B 32, 3134-3141.
308. J. F. Sturm (1999), 'Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones', Optim. Methods Software 11-12, 625-653. fewcal.kub.nl/sturm/software/sedumi.html
309. B. Tang (1993), 'Orthogonal array-based Latin hypercubes', J. Amer. Statist. Assoc. 88, 1392-1397.
310. M. Tawarmalani and N. V. Sahinidis (2001), Semidefinite relaxations of fractional programs via novel convexification techniques, J. Global Optim. 20 137-158.
311. M. Tawarmalani and N. V. Sahinidis (2002a), Convex extensions and envelopes of lower semi-continuous functions, Math. Program. 93 247-263.
312. M. Tawarmalani and N. V. Sahinidis (2002b), Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications, Kluwer, Dordrecht.
313. M. Tawarmalani and N. V. Sahinidis (2004), 'Global optimization of mixed-integer nonlinear programs: A theoretical and computational study', Math. Program., DOI 10.1007/S10107-003-0467-6.
314. M. Todd (2001), Semidefinite optimization, in Acta Numerica, Vol. 10, Cambridge University Press, pp. 515-560.
315. J. A. Tomlin (1970), Branch and bound methods for integer and non-convex programming, in Integer and Nonlinear Programming (J. Abadie, ed.), American Elsevier Publishing Company, New York, pp. 437-450.
316. TOMS (2002), Information for authors. Web document: www.acm.org/toms/Authors.html#TypesofPapers
317. A. Törn (1972), Global optimization as a combination of local and global search, in Proceedings of Computer Simulation Versus Analytical Solutions for Business and Economical Models, Gothenburg, August 1972 (W. Goldberg, ed.).
318. A. Törn (1974), Global optimization as a combination of global and local search, PhD Thesis, Abo Akademi University, HHAAA 13.
319. A. Torn (2000), Global optimization. Web document: www.abo.fi/~atorn/Globopt.html
320. A. Törn and A. Zilinskas (1989), Global Optimization, Vol. 350 of Lecture Notes in Computer Science, Springer, Berlin.
321. A. Törn, M. Ali and S. Viitanen (1999), 'Stochastic global optimization: Problem classes and solution techniques', J. Global Optim. 14, 437-447.
322. T. Tsuda and T. Kiono (1964), Application of the Monte Carlo method to systems of nonlinear algebraic equations, Numerische Matematik 6 59-67.
323. H. Tuy (1995), DC optimization: Theory, methods and algorithms, in Handbook of Global Optimization (R. Horst and P. M. Pardalos eds), Kluwer, Dordrecht, pp. 149-216.
324. M. Ulbrich and S. Ulbrich (1996), Automatic differentiation: A structure-exploiting forward mode with almost optimal complexity for Kantorovich trees, in Applied Mathematics and Parallel Computing (H. Fischer et al., eds), Physica-Verlag, Heidelberg, pp. 327-357.
325. L. Vandenberghe and S. Boyd (1996), 'Semidefinite programming', SIAM Review 38, 49-95. www.stanford.edu/~boyd/reports/semidef_prog.ps
326. D. Vandenbussche (2003), Polyhedral approaches to solving nonconvex quadratic programs, PhD thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology.
327. B. Vanderbei (2000), Nonlinear optimization models. Web site: www.sor.princeton.edu/~rvdb/ampl/nlmodels/
328. P. Van Hentenryck (1989), Constraint Satisfaction in Logic Programming, MIT Press, Cambridge, MA.
329. P. Van Hentenryck, L. Michel and F. Benhamou (1997a), 'Newton: Constraint programming over non-linear constraints', Sci. Program. 30, 83-118.
330. P. Van Hentenryck, L. Michel and Y. Deville (1997b), Numerica: A Modeling Language for Global Optimization, MIT Press, Cambridge, MA.
331. R. Van Iwaarden (1986), An improved unconstrained global optimization algorithm, PhD thesis, University of Colorado at Denver, CO.
332. P. J. M. Van Laarhoven and E. H. L. Aarts (1987), Simulated Annealing: Theory and Applications, Kluwer, Dordrecht.
333. L. N. Vicente and P. H. Calarnai (1994), 'Bilevel and multilevel programming: A bibliography review', J. Global Optim. 5, 291-306.
334. V. Visweswaran and C. A. Floudas (1996a), New formulations and branching strategies for the GOP algorithm, in Global Optimization in Chemical Engineering (I. E. Grossrnann, ed.), Kluwer. Dordrecht, pp. 75-100.
335. V. Visweswaran and C. A. Floudas (1996b), Computational results for an efficient implementation of the GOP algorithm and its variants, in Global Optimization in Chemical Engineering (I. E. Grossmann, ed.), Kluwer, Dordrecht, pp. 111-153.
336. Xuan-Ha Vu, D. Sam-Haroud and M.-C. Silaghi (2002), Approximation techniques for non-linear problems with continuum of solutions, in Proc. 5th Int. Symp. Abstraction, Reformulation Approximation, SARA'2002 (B. Y. Choueiry and T. Walsh, eds), Vol. 2371 of Lecture Notes in Artificial Intelligence, Springer, pp. 224-241.
337. Xuan-Ha Vu, D. Sam-Haroud and M.-C. Silaghi (2003), Numerical constraint satisfaction problems with non-isolated solutions, in Global Optimization and Constraint Satisfaction (C. Bliek et al., eds), Springer, Berlin, pp. 194-210.
338. W. Walster (2000), Interval arithmetic solves nonlinear problems while providing guaranteed results, FORTE TOOLS feature stories. Web manuscript: wwws.sun.com/software/sundev/news/features/intervals.html
339. G. Walster, E. Hansen and S. Sengupta (1985), Test results for a global optimization algorithm, in Numerical Optimization 1984 (P. T. Boggs et al., eds), SIAM, Philadelphia, pp. 272-287.
340. H. P. Williams (1999), Model Solving in Mathematical Programming, 4th edn. Wiley, Chichester.
341. H. Wolkowicz, R. Saigal and L. Vandenberghe, eds (2000), Handbook on Semidefinite Programming, Kluwer, Dordrecht.
342. L. A. Wolsey (1998), Integer Programming, Wiley.
343. S. J. Wright (1997), Primal-Dual Interior-Point Methods, SIAM, Philadelphia.
344. M. Yagiura and T. Ibaraki (2001), 'On metaheuristic algorithms for combinatorial optimization problems', Systems and Computers in Japan 32, 33-55.
345. H. Yan and J. N. Hooker (1999), 'Tight representations of logical constraints as cardinality rules', Math. Program. 85, 363-377.
346. J. M. Zamora and I. E. Grossmann (1999), 'A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms', J. Global Optim. 14, 217-249.
347. A. A. Zhigljavsky (1991), Theory of Global Random Search, Kluwer, Dordrecht.