Relaxation and decomposition methods for mixed integer nonlinear programming

International Series of Numerical Mathematics

Volumn 152, Issue , 2005, Pages 1-213

  Nowak, Ivo ^a  

^a NONE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85093897261     PISSN: 03733149     EISSN: 22966072     Source Type: Book Series    
DOI: None     Document Type: Chapter

References (219)

1. Adjiman, C. S., Androulakis, I. P., Maranas, C. D., and Floudas, C. A. (2002). αBB. http://titan.princeton.edu/soft.html\#abb.
2. Adjiman, C. S., Dallwig, S., Floudas, C. A., and Neumaier, A. (1998). A global optimization method, αBB, for general twice-differentiable constrained NLPs — I. Theoretical advances. Comp. Chem. Eng., pages 1137–1158.
3. Adjiman, C. S. and Floudas, C. A. (1997). Rigorous convex underestimators for general twice-differentiable problems. J. Global Opt., 9:23–40.
4. Ahadi-Oskui, T. (2001). Optimierung einer industriellen Kraft-Wärme-Kopplungsanlage mit Hilfe von evolutionären Algorithmen. Master thesis, Technical University Berlin.
5. Ahadi-Oskui, T., Alperin, H., Cziesla, F., Nowak, I., and Tsatsaronis, G. (2001). Optimization of complex energy conversion systems. http://www.math.hu-berlin.de/~eopt/engl\_index.html.
6. Ahadi-Oskui, T., Alperin, H., Cziesla, F., Nowak, I., and Tsatsaronis, G. (2003). A relaxation-based heuristic for the design of cost-effective energy conversion systems. accepted for publication in ENERGY.
7. Al-Khayyal, F. A., Larsen, C., and van Voorhis, T. (1995). A relaxation method for nonconvex quadratically constrained quadratic programs. J. Glob. Opt, 6:215–230.
8. Al-Khayyal, F. A. and van Voorhis, T. (1996). Accelerating convergence of branch-and-bound algorithms for quadratically constrained optimization problems. In Floudas, C. A., editor, State of the Art in Global Optimization: Computational Methods and Applications. Kluwer Academic Publishers, Dordrecht.
9. Alperin, H. and Nowak, I. (2002). Lagrangian Smoothing Heuristics for MaxCut. Technical report, Humboldt-Universität zu Berlin NR–2002–6.
10. Anstreicher, K. and Wolkowicz, H. (1998). On Lagrangian relaxation of quadratic matrix constraints. Research Report CORR 98-24, Department of Combina-torics and Optimization,University of Waterloo.
11. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., and Protasi, M. (1999). Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties. Springer, Berlin.
12. Beasley, J. E. (1998). Heuristic Algorithms for the Unconstrained Binary Quadratic Programming Problem. Technical report, The Management School, Imperial College, London SW7 2AZ, England. http://mscmga.ms.ic.ac.uk/jeb/jeb.html.
13. Beck, A. and Teboulle, M. (2000). Global optimality conditions for quadratic optimization problems with binary constraints. SIAM J. Opt., pages 179– 188.
14. Becker, R. and Lago, G. (1970). A global optimization algorithm. In Proceedings of the 8th Allerton Conference on Circuits and Systems Theory, pages 3–12.
15. Benson, S. J., Ye, Y., and Zhang, X. (2000). Solving large-scale sparse semidefinite programs for combinatorial optimization. SIAM J. Optim., 10(2):443–461.
16. Berloni, A., Campadelli, P., and Grossi, G. (1998). An approximation algorithm for the maximum cut problem and its experimental analysis. Proceedings of “Algorithms and Experiments”, pages 137–143.
17. Bertsekas, D. P. (1995). Non-linear programming. Athena Scientific, Belmont, MA.
18. Bisschop, J. and Roelofs, M. (2002). AIMMS-The User’s Guide. Paragon Decision Technology B.V., Haarlem, The Netherlands, http://www.aimms.com.
19. Bixby, R. (2001). Solving Real-World Linear Programs: A Decade and More of Progress. To appear in Operations Research.
20. Bixby, R., Fenelon, M., Gu, Z., Rothberg, E., and Wunderling, R. (2000). MIP: theory and practice-closing the gap. In Powell, M. and Scholtes, S., editors, System Modelling and Optimization: Methods, Theory and Applications, pages 19–49. Kluwer Academic Publishers, Dordrecht.
21. Bliek, C., Spellucci, P., Vicente, L., Neumaier, A., Granvilliers, L., Monfroy, E., Benhamou, F., Huens, E., Hentenryck, P. V., Sam-Haroud, D., and Faltings, B. (2001). COCONUT Deliverable D1, Algorithms for Solving Nonlinear Constrained and Optimization Problems: The State of The Art. http://www.mat.univie.ac.at/~neum/glopt/coconut/StArt.html.
22. Boddy, M. and Johnson, D. (2003). A new method for the global solution of large systems of continuous constraints. In Bliek, C., Jermann, C., and Neumaier, A., editors, Global Optimization and Constraint Satisfaction, pages 142–156. Springer, Berlin.
23. Boender, C. G. E. and Romeijn, H. E. (1995). Stochastic methods. In Horst, R. and Pardalos, P., editors, Handbook of Global Optimization, pages 829–869. Kluwer Academic Publishers, Dordrecht.
24. Bomze, I. (1998). On standard quadratic optimization problems. J. Global Opt., 13:369–387.
25. Borndörfer, R., Grötschel, M., and Löbel, A. (2001). Scheduling duties by adaptive column generation. Technical report, ZIB-Report 01-02, Konrad-Zuse-Zentrum für Informationstechnik Berlin.
26. Burer, S. and Monteiro, R. D. C. (2001). A Nonlinear Programming Algorithm for Solving Semidefinite Programs via Low-rank Factorization. Technical report, School of ISyE, Georgia Tech, Atlanta.
27. Burer, S., Monteiro, R. D. C., and Zhang, Y. (2001). Rank-two relaxation heuristics for max-cut and other binary quadratic programs. SIAM J.Opt., 12:503– 521.
28. Burkard, R., Kocher, M., and Rudolf, R. (1997). Rounding strategies for mixed integer programs arising from chemical production planning. Technical report, Report No.119 from the Optimization Group at the TU Graz.
29. Bussieck, M., Drud, A., and Meeraus, A. (2003a). MINLPLib-A Collection of Test Models for Mixed-Integer Nonlinear Programming. INFORMS J. Comput., 15(1).
30. Bussieck, M. and Pruessner, A. (2003). Mixed-integer nonlinear programming. SIAG/OPT Newsletter: Views & News.
31. Bussieck, M. R., Lasdon, L. S., Pintér, J. D., and Sahinidis, N. V. (2003b). Global Optimization with GAMS-Applications and Performance. http://www.gams.com/presentations/present_BLOglobal.pdf.
32. Bussiek, M. and Drud, A. (2002). SBB User Manual. http://www.gams.com/solvers/sbb.pdf.
33. Casey, M. and Sen, S. (2003). The Scenario generation algorithm for multistage stochastic linear programming. http://www.math.ups/~mcasey.
34. Cohen, E. and Schumaker, L. (1985). Rates of convergence of control polygons. Computer Aided Geometric Design, 2:229–235.
35. Conway, J. H. and Sloane, N. J. A. (1993). Sphere Packings, Lattices and Groups. 2nd edn, Springer, New York.
36. Dahmen, W. (1986). Subdivision algorithms converge quadratically. J. of Computational and Applied Mathematics, 16:145–158.
37. Dantzig, G. B. and Wolfe, P. (1960). Decomposition principle for linear programs. Operations Research, 8:101–111.
38. Dantzig, G. B. and Wolfe, P. (1961). The decomposition algorithm for linear programs. Econometrica, 29:767–778.
39. Dash Optimization (2003). XPRESS. http://www.dashopt.com.
40. Demands, E. V. and Tang, C. S. (1992). Linear control of a Markov production system. Operations Research, 40:259–278.
41. Dentcheva, D., Guddat, J., and Rückmann, J.-J. (1995). Pathfollowing methods in nonlinear optimization III: multiplier embedding. ZOR-Math. Methods of OR, 41:127–152.
42. Dentcheva, D. and Römisch, W. (2002). Duality gaps in nonconvex stochastic optimization. Technical report, Preprint 02-5, Institut für Mathematik, Humboldt-Universität zu Berlin, accepted for publication in Math. Progr.
43. Dixon, L. and Szegö, G. (1975). Towards global optimization. North-Holland, Amsterdam.
44. Douglas, J. and Rachford, H. (1956). On the numerical solution of heat conduction problems in two and three space variables. Trans. Amer. Math. Soc., 82:421– 439.
45. Drud, A. (1996). CONOPT: A System for Large-Scale Nonlinear Optimimization, Refeference Manual for CONOPT Subroutine Library. ARKI Consulting and Development A/S, Bagsvaerd, Denmark.
46. Dupacová, J., Gröwe-Kuska, N., and Römisch, W. (2003). Scenario reduction in stochastic programming: An approach using probability metrics. to appear in Math. Progr.
47. Dür, M. (2001). Dual bounding procedures lead to convergent Branch-and-Bound algorithms. Math. Progr., 91:117–125.
48. Duran, M. A. and Grossmann, I. E. (1986). An outer approximation algorithm for a class of mixed-integer nonlinear programs. Math. Progr., 36:307.
49. Elzinga, J. and Moore, T. (1975). A central cutting plane algorithm for the convex programming problem. Math. Progr., 8:134–145.
50. Epperly, T. G. W. and Swaney, R. E. (1996). Branch and Bound for Global NLP: New Bounding LP, pages 1–35. Kluwer Academic Publishers, Dordrecht.
51. Everett, H. (1963). Generalized Lagrange Multiplier Method for Solving Problems of Optimal Allocation of Resources. Operations Research, 11:399–417.
52. Farin, G. (1986). Triangular Bernstein-Bézier patches. Computer Aided Geometric Design, 3:83–127.
53. Feltenmark, S. and Kiwiel, K. C. (2000). Dual applications of proximal bundle methods including lagrangian relaxation of nonconvex problems. SIAM J. Optim., 10(3):697–721.
54. Ferris, M. C. and Horn, J. D. (1998). Partitioning mathematical programs for parallel solution. Math. Progr., 80:35–61.
55. Festa, P., Pardalos, P. M., Resende, M. G. C., and Ribeiro, C. C. (2002). Randomized heuristics for the max-cut problem. Optimization Methods and Software, 7:1033–1058.
56. Filar, J. A. and Schultz, T. A. (1999). Bilinear programming and structured stochastic games. J. Opt. Theor. Appl., 53:85–104.
57. Fisher, M. L. (1980). Worst-case analysis of heuristic algorithms. Management Science, 26(1):1–17.
58. Fletcher, R. (1987). Pratical Methods of Optimization. John Wiley & Sons, New York, second edition.
59. Fletcher, R. and Leyffer, S. (1994). Solving Mixed Integer Nonlinear Programs by Outer Approximation. Math. Progr., 66:327.
60. Fletcher, R. and Leyffer, S. (2002). MINLP. http://www.maths.dundee.ac.uk/~sleyffer/MINLP.html.
61. Flippo, O. E. and Kan, A. H. G. R. (1993). Decomposition in general mathematical programming. Math. Progr., 60:361–382.
62. Floudas, C. A. (1995). Nonlinear and Mixed Integer Optimization: Fundamentals and Applications. Oxford University Press, New York.
63. Floudas, C. A. (2000). Deterministic Global Optimization: Theory, Algorithms and Applications. Kluwer Academic Publishers, Dordrecht.
64. Floudas, C. A., Aggarwal, A., and Ciric, A. R. (1989). Global optimum search for nonconvex NLP and MINLP problems. Computers and Chemical Engineering, 13(10):1117–1132.
65. Forgó, F. (1988). Nonconvex Programming. Akadémiai Kiadó, Budapest.
66. Forrest, S. (1993). Genetic algorithms: principles of natural selection applied to computation. Science, pages 872–878.
67. Fourer, R., Gay, D. M., and Kernighan, B. W. (1993). AMPL: A Modeling Language for Mathematical Programming. Duxbury Press, Brooks/Cole Publishing Company, Belmont, CA.
68. G. E. Paules, I. and Floudas, C. A. (1989). APROS: Algorithmic development methodology for discrete-continuous optimization problems. Oper. Res., 37(6):902.
69. GAMS (2003). GAMS-The Solver Manuals. GAMS Development Corporation, Washington DC.
70. Garey, M. R. and Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York.
71. Garloff, J., Jansson, C., and Smith, A. P. (2002). Lower bound functions for polynomials. to appear in Journal of Computational and Applied Mathematics.
72. Garloff, J. and Smith, A. (2003). An improved method for the computation of affine lower bound functions for polynomials. In Floudas, C. and Pardalos, P., editors, Frontiers in Global Optimization, pages 1–10. Kluwer Academic Publishers, Dordrecht.
73. Geoffrion, A. M. (1972). General Benders decomposition. J. Opt. Theor. Appl., 10 (4):237–260.
74. Geoffrion, A. M. (1974). Lagrangian Relaxation for Integer Programming. Math. Progr. Study, 2:82–114.
75. Gill, P. E., Murray, W., and Saunders, M. A. (1997). SNOPT 5.3 user’s guide. Technical report, University of California, San Diego, Mathematics Department Report NA 97-4.
76. Glover, F. and Laguna, M. (1997). Tabu Search. Kluwer Academic Publishers, Boston.
77. Gomes, F. and Sorensen, D. (1997). ARPACK++: a C++ Implementation of ARPACK eigenvalue package. http://www.crpc.rice.edu/software/ARPACK/.
78. Goemans, M. X. and Williamson, D. P. (1995). Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. J. ACM, 42:1115–1145.
79. Goffin, J. L. (1977). On convergence rate of subgradient optimization methods. Math. Progr., 13:329–347.
80. Goffin, J.-L. and Vial, J.-P. (1999). Convex nondifferentiable optimization: A survey focussed on the analytic center cutting plane method. Technical report, University of Geneva, 102 Bd Carl-Vogt, CH-1211,HEC/Logilab.
81. Grossmann, I. (2002). DICOPT. http://www.gams.com/solvers/dicopt/main.htm.
82. Grossmann, I. E. (2001). Review of Non-Linear Mixed Integer and Disjunctive Programming Techiques for Proces Systems Engineering. http://egon.cheme.cmu.edu/Group/Papers.
83. Grossmann, I. E. and Biegler, L. (2002). Part II: Future Perspective on Optimization. http://egon.cheme.cmu.edu/Group/Papers.
84. Grossmann, I. E. and Kravanja, Z. (1997). Mixed-integer nonlinear programming: A survey of algorithms and applications. In Conn, A., Biegler, L., Coleman, T., and Santosa, F., editors, Large-Scale Optimization with Applicationa, Part II:Optimal Design and Control. Springer, New York.
85. Grossmann, I. E. and Sahinidis, N. (2002a). Special Issue on Mixed-Integer Programming and it’s Application to Engineering, Part I. Optim. Eng., 3(4), Kluwer Academic Publishers, Dordrecht.
86. Grossmann, I. E. and Sahinidis, N. (2002b). Special Issue on Mixed-Integer Programming and it’s Application to Engineering, Part II. Optim. Eng., 4(1), Kluwer Academic Publishers, Dordrecht.
87. Grothey, A. (2001). Decomposition Methods for Nonlinear Nonconvex Optimization Problems. PhD thesis, The University of Edinburgh, http://www.maths.ed.ac.uk/~agr/thesis.ps.gz.
88. Guddat, J., Guerra, F., and Nowack, D. (1998). On the role of the Mangasarian-Fromovitz constraints qualification for penalty-, exact penalty-and Lagrange multiplier methods. In Fiacco, A. V., editor, Mathematical Programming with Data Perturbations, pages 159–183. Marcel Deckker, Inc., New York.
89. Guddat, J., Vazquez, F. G., and Jongen, H. T. (1990). Parametric Optimization: Singularities, Pathfollowing and Jumps. John Wiley and Sons, New York.
90. Guignard, M. and Kim, S. (1987). Lagrangian decomposition: a model yielding stronger Lagrangean bounds. Math. Progr., 39(2):215–228.
91. Helmberg, C. (2000). Semidefinite Programming for Combinatorial Optimization. Technical report, ZIB–Report 00–34.
92. Helmberg, C. and Kiwiel, K. C. (2002). A spectral bundle method with bounds. Math. Progr., 93(2):173–194.
93. Helmberg, C. and Rendl, F. (2000). A spectral bundle method for semidefinite programming. SIAM J. Opt., 10(3):673–695.
94. Henrion, D. and Lasserre, J. B. (2002). Solving Global Optimization Problems over Polynomials with GloptiPoly 2.1. Technical report, LAAS-CNRS Research Report No. 02289, Toulouse, France.
95. Hiriart-Urruty, J. B. and Lemaréchal, C. (1993). Convex Analysis and Minimization Algorithms I and II. Springer, Berlin.
96. Hochbaum, D. (1999). Randomization, Approximation, and Combinatorial Optimization. Springer, Berlin.
97. Holmberg, K. (1990). On the convergence of the cross decomposition. Math. Progr., 47:269.
98. Holmberg, K. and Ling, J. (1997). A lagrangian heuristic for the facility location problem with staircase costs. Eur. J. Oper. Res., 97:63–74.
99. Hooker, J. (2000). Logic-based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley, New York.
100. Horst, R. and Pardalos, P. (1995). Handbook of Global Optimization. Kluwer Academic Publishers, Dordrecht.
101. Horst, R., Pardalos, P., and Thoai, N. (1995). Introduction to Global Optimization. Kluwer Academic Publishers, Dordrecht.
102. Horst, R. and Tuy, H. (1990). Global Optimization (Deterministic Approaches). Springer, Berlin.
103. IBM (2003). COIN-OR: Common Optimization Interface for Operations Research. http://www.coin.org.
104. ILOG, Inc. (2005). CPLEX. http://www.ilog.com/products/cplex/.
105. Karush, W. (1939). Minima of functions of several variables with inequalities as side constraints. Master’s thesis.
106. Kearfott, R. (1996). Rigorous Global Search: Continuous Problems. Kluwer Academic Publishers, Dordrecht.
107. Kesavan, P., Allgor, R. J., Gatzke, E. P., and Barton, P. I. (2001). Outer Approximation Algorithms for Separable Nonconvex Mixed-Integer Nonlinear Programs. submitted to Mathematical Programming.
108. Kirkpatrick, S., Geddat Jr., C., and Vecchi, M. (1983). Optimization by simulated annealing. Science, 220:671–680.
109. Kiwiel, K. C. (1990). Proximity control in bundle methods for convex nondifferentiable minimization. Math. Progr., 46:105–122.
110. Kiwiel, K. C. (1993/1994b). User’s Guide for NOA 2.0/3.0: A FORTRAN Package for Convex Nondifferentiable Optimization. Polish Academy of Science, System Research Institute, Warsaw.
111. Kiwiel, K. C. (1994a). A cholesky dual method for proximal piecewise linear programming. Numerische Mathematik, 68.
112. Kocis, G. R. and Grossmann, I. E. (1987). Relaxation strategy for the structural optimization of nonconvex MINLP problems in process flow sheets. Ind. Eng. Chem. Res., 26(9):1869.
113. Kojima, M., Kim, S., and Waki, H. (2003). A General Framework for Convex Relaxation of Polynomial Optimization Problems over Cones. Journal of Operations Research Society of Japan, 46(2):125–144.
114. Kojima, M., Matsumoto, T., and Shida, M. (1999). Moderate nonconvexity = convexity + quadratic concavity. Technical report, Research Reports on Mathematical and Comuting Sciences, Series B: Operations Research, Tokyo Institute of Technology, B-348.
115. Krawczyk, R. (1969). Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken. Computing, 4:187–2001.
116. Kuhn, H. W. and Tucker, A. W. (1951). Nonlinear programming. In Neyman, J., editor, Proceedings of the 2nd Berkeley Symposium on Mathematical Statistics and Probability, pages 481–493. University Press, Berkeley, California.
117. Lagrange, J. (1797). Théorie des fonctions analytiques. Impr. de la République, Paris.
118. Lasdon (2003). OQNLP. http://www.gams.com/solvers/oqnlp.pdf.
119. Lasserre, J. B. (2001). Global optimization with polynomials and the problem of moments. SIAM J. Opt., 11(3):796–817.
120. Lemaréchal, C. (2001). Lagrangian relaxation. Optimization Online. http://www.optimization-online.org/DB_HTML/2001/03/298.html.
121. Lemaréchal, C. and Oustry, F. (1999). Semidefinite relaxations and Lagrangian duality with application to combinatorial optimization. Technical Report 3710, INRIA Rhône-Alpes.
122. Lemaréchal, C. and Renaud, A. (2001). A geometric study of duality gaps, with applications. Math. Progr., 90:399–427.
123. Li, D., Sun, X. L., Wang, J., and McKinnon, K. (2002). A convergent lagrangian and domain cut method for nonlinear knapsack problems. Technical report, SEEM2002-10, Department of Systems Engineering & Engineering Management, The Chinese University of Hong Kong.
124. Locatelli, M. (2002). Simulated annealing algorithms for continuous global optimization. In Pardalos, P. and Romeijn, H., editors, Handbook of Global Optimization, Volume 2, pages 179–229. Kluwer Academic Publishers, Dor-drecht.
125. Mangasarin, O. L. (1969). Nonlinear Programming. McGraw-Hill, New York.
126. Mangasarin, O. L. and Fromowitz, S. (1967). The Fritz John necessary optimality conditions in the presence of equality and inequality constraints. J. Math. Anal. Appl., 17:37–37.
127. Martin, A. (1999). Integer programs with block structure. Technical report, ZIB– Report 99–03, Habilitationsschrift.
128. Mawengkang, H. and Murtagh, B. (1986). Solving nonlinear integer programs with large scale optimization software. Ann. O. R., 5:425.
129. Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., and Teller, E. (1953). Equations of state calculations by fast computing machine. J. Chem. Phys., 21:1097.
130. Mockus, J. (1989). Bayesian Approach to Global Optimization. Kluwer Academic Publishers, Dordrecht.
131. Moore, R. (1979). Methods and Applications of Interval Analysis. SIAM, Philadelphia.
132. Moré, J. and Wu, Z. (1997). Global continuation for distance geometry problems. SIAM J. Optim., 7:814–836.
133. Murty, K. G. (1987). Some NP-complete problems in quadratic and nonlinear programming. Math. Progr., 39:117–129.
134. Nemhauser, G. L. and Wolsey, L. A. (1988). Integer and Combinatorial Optimization. Wiley-Interscience, New York.
135. NETLIB (1972-1973). EISPACK. http://www.netlib.org/eispack/.
136. Neumaier, A. (1990). Interval Methods for Systems of Equations. Cambridge Univ. Press, Cambridge, UK.
137. Neumaier, A. (1992). An optimality criterion for global quadratic optimization. J. Global Opt., 2:201–208.
138. Neumaier, A. (1996). Second-order sufficient optimality conditions for local and global nonlinear programming. J. Global Opt., 9:141–151.
139. Neumaier, A. (2001). Constrained Global Optimization. In COCONUT Deliverable D1, Algorithms for Solving Nonlinear Constrained and Optimization Problems: The State of The Art, pages 55–111. http://www.mat.univie.ac.at/~neum/glopt/coconut/StArt.html.
140. Neumaier, A. (2004). Complete search in continiuous global optimization and constraint satisfaction. In Iserles, A., editor, Acta Numerica, pages 271–369. Cambridge University Press, Cambridge, UK.
141. Nowak, I. (1996). A Branch-and-Bound algorithm for computing the global minimum of polynomials by Bernstein-Bézier patches on simplices. Technical report, Preprint M-09, BTU Cottbus.
142. Nowak, I. (1998). A global optimality criterion for nonconvex quadratic programming over a simplex. Technical report, Preprint 98-18, Humboldt-Universität zu Berlin.
143. Nowak, I. (1999). A new semidefinite programming bound for indefinite quadratic forms over a simplex. J. Glob. Opt., 14:357–364.
144. Nowak, I. (2000). Dual bounds and optimality cuts for all-quadratic programs with convex constraints. J. Glob. Opt., 18:337–356.
145. Nowak, I. (2004). Lagrangian Decomposition of Block-Separable Mixed-Integer All-Quadratic Programs. Math. Progr., Online First:1–18.
146. Nowak, I., Alperin, H., and Vigerske, S. (2003). LaGO-An object oriented library for solving MINLPs. In Bliek, C., Jermann, C., and Neumaier, A., editors, Global Optimization and Constraint Satisfaction, pages 32–42. Springer, Berlin. http://www.mathematik.hu-berlin.de/~eopt/papers/LaGO.pdf.
147. Nowak, M. P. and Römisch, W. (2000). Stochastic Lagrangian relaxation applied to power scheduling in a hydro-thermal system under uncertainty. An. Oper. Res., 100:251–272.
148. OREAS GmbH (1999). ABACUS, A Branch and CUt System, Version 2.3, User’s Guide and Reference Manual. http://www.oreas.de.
149. Padberg, M. and Rinaldi, G. (1991). A Branch-and-Cut algorithm for the resolution of large scale traveling salesman problems. SIAM Review, 33:60–10.
150. Pardalos, P. M. and Rosen, J. B. (1987). Constrained Global Optimization: Algorithms and Applications, volume 268. Springer Lecture Notes Comp. Sci., Berlin.
151. Pataki, G. and Schmieta, S. H. (2000). The DIMACS Library of Mixed Semidefinite Quadratic Linear Programs. http://dimacs.rutgers.edu/Challenges/Seventh/Instances/.
152. Phan-huy-Hao, E. (1982). Quadratically constrained quadratic programming: Some applications and a method for solution. ZOR, 26:105–119.
153. Phillips, A., Rosen, J., and Walke, V. (1995). Molecular structure determination by global optimization. In Dimacs Series in Discrete Mathematics and Theoretical Computer Science, volume 23, pages 181–198.
154. Phillips, A. T. and Rosen, J. B. (1994). A Quadratic Assignment Formulation of the Molecular Conformation Problem. J. Glob. Opt., 4:229–241.
155. Phing, T. Q., Tao, P. D., and An, L. T. H. (1994). A method for solving D.C. programming problems, Application to fuel mixture nonconvex optimization problems. J. Global Opt., 6:87–105.
156. Pintér, J. (2005). LGO. http://www.pinterconsulting.com.
157. Pintér, J. D. (1996). Global Optimization in Action. Kluwer Academic Publishers, Dordrecht.
158. Poljak, S., Rendl, F., and Wolkowicz, H. (1995). A recipe for semidefinite relaxation for (0,1)-quadratic programming. J. Global Opt., 7(1):51–73.
159. Polyak, B. T. (1987). Introduction to optimization. Optimization Software, Inc., Publications division.
160. Polyak, B. T. (1993). A general method for solving extremum problems. Soviet Mathematics, 8:593–597.
161. Quesada, L. and Grossmann, I. E. (1992). An LP/NLP based branch and bound algorithm for convex MINLP optimization problems. Comp. Chem. Eng., 16:937–947.
162. Ralphs, T. (2000). SYMPHONY Version 2.8 User’s Guide. www.branchandcut.org/SYMPHONY.
163. Ratschek, H. and Rokne, J. (1995). Interval Methods. In Horst, R. and Pardalos, P., editors, Handbook of Global Optimization, pages 751–828. Kluwer Academic Publishers, Dordrecht.
164. Reemtsen, R. (1994). Some outer approximation methods for semi-infinite programming problems. J. Comp. Appl. Math., 53:87–108.
165. Rendl, F. and Wolkowicz, H. (1997). A semidefinite framework for trust region subproblems with applications to large scale minimization. Math. Progr., 77 (2):273–299.
166. Resende, M. G. C. and Ribeiro, C. C. (2002). Greedy randomized adaptive search procedures. In Glover, F. and Kochenberger, G., editors, State-of-the-Art Handbook in Metaheuristics. Kluwer Academic Publishers, Dordrecht.
167. Rockafellar, R. T. (1974). Augmented Lagrangian multiplier functions and duality in nonconvex programming. SIAM J. Control, 12(2):268–285.
168. Rockafellar, R. T. and Wets, R. J. (1997). Variational Analysis. Springer, New-York.
169. Ruszczyński, A. (1997). Decomposition methods in stochastic programming. Math. Progr., 79:333–353.
170. Rutenberg, D. P. and Shaftel, T. L. (1971). Product design: Sub-assemblies for multiple markets. Management Science, 18:B220–B231.
171. Ryoo, H. S. and Sahinidis, N. (1996). A Branch-and-Reduce Approach to Global Optimization. J. Global Opt., 8:107–138.
172. Sahinidis, N. V. (1996). BARON: A general purpose global optimization software package. J. Global Opt., 8(2):201–205.
173. Sahinidis, N. V. (2002). BARON, Branch And Reduce Navigator, User’s Manual. http://archimedes.scs.uiuc.edu/baron/baron.html.
174. Schelstraete, S., Schepens, W., and Verschelde, H. (1998). Energy minimization by smoothing techniques: a survey. In Balbuena, E. P. and Seminario, J., editors, From Classical to Quantum Methods, pages 129–185. Elsevier.
175. Schichl, H. (2004). Mathematical Modeling and Global Optimization. Habilitation Thesis, draft of a book, Cambridge Univ. Press, to appear.
176. Schichl, H. and Neumaier, A. (2004). Interval analysis on directed acyclic graphs for global optimization. J. Global Optimization, to appear.
177. Schrijver, A. (1986). Theory of Linear and Integer Programming. John Wiley & Sons, Chichester.
178. Schweiger, C. and Floudas, C. (2002). MINOPT. http://titan.princeton.edu/MINOPT/.
179. SCICON Ltd. (1989). SCICONIC User Guide Version 1.40. Scicon Ltd., Milton Keynes, UK.
180. Sehlmann, M. and Fahle, T. (2003). Constraint programming based lagrangian relaxation for the automatic recording problem. An. Oper. Res., 118:17–33.
181. Sherali, H. and Adams, W. (1999). A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer Academic Publishers, Dordrecht.
182. Sherali, H. D. and Tuncbilek, C. H. (1995). A reformulation-convexification approach for solving nonconvex quadratic programming problems. J. Global Opt., 7:1–31.
183. Shor, N. Z. (1987). Quadratic optimization problems. Soviet J. Circ. Syst. Sci., 25, (6):1–11.
184. Shor, N. Z. (1992). Dual estimates in multiextremal problems. J. Global Opt., 2:411–418.
185. Shor, N. Z. (1998). Nondifferentiable Optimization and Polynomial Problems. Kluwer Academic Publishers, Dordrecht.
186. Smith, E. M. B. and Pantelides, C. C. (1996). Global optimization of general process models. In Grossmann, I. E., editor, Global Optimization in Engineering Design, pages 355–368. Kluwer Academic Publishers, Dordrecht.
187. Smith, E. M. B. and Pantelides, C. C. (1999). A Symbolic Reformulation/Spatial Branch and Bound Algorithm for the Global Optimization of nonconvex MINLPs. Comp. Chem. Eng., 23:457–478.
188. Spellucci, P. (1993). Numerische Verfahren der nichtlinearen Optimierung. Birkhäuser Verlag, ISNM, Darmstadt.
189. Stern, R. and Wolkowicz, H. (1995). Indefinite trust region subproblems and nonsymmetric eigenvalue perturbations. SIAM J. Opt., 5(2):286–313.
190. Strongin, R. and Sergeyev, Y. (2000). Global optimization with non-convex constraints: Sequential and parallel algorithms. Kluwer Academic Publishers, Dordrecht.
191. Takriti, S., Birge, J. R., and Long, E. (1996). A stochastic model for unit commitment. IEEE Transactions on Power Systems, 11 (3):1497–1508.
192. Tawarmalani, M. and Sahinidis, N. (1999). Global Optimization of Mixed Integer Nonlinear Programs: A Theoretical and Computational Study. to appear in Math. Progr., pages 1–70.
193. Tawarmalani, M. and Sahinidis, N. (2002). Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications. Kluwer Academic Publishers, Dordrecht.
194. Thoai, N. (1997). A decomposition method using duality bounds for nonconvex optimization. Technical report, Research Report 97-24, University of Trier.
195. Törn, A. and Zilinskas, A. (1989). Global optimization. Lecture Notes in Computer Science 350, Springer-Verlag, Berlin.
196. Turkay, M. and Grossmann, I. E. (1996). Logic-based MINLP algorithms for Optimal Synthesis of Process Networks. Comp. Chem. Eng., 20(8):959–978.
197. Vaidyanathan, R. and EL-Halwagi, M. (1996). Global optimization of nonconvex MINLP’s by interval analysis. In Grossmann, I. E., editor, Global Optimization in Engineering Design, pages 175–193. Kluwer Academic Publishers, Dordrecht.
198. Van Hentenryck, P. (1997). Numerica: a modeling language for global optimization. Proceedings of IJCAI’97.
199. Van Hentenryck, P., Michel, L., and Deville, Y. (1997). Numerica. A Modeling Language for Global Optimization. MIT Press, Cambridge, MA.
200. Vandenbussche, D. (2003). Polyhedral Approaches to Solving Nonconvex Quadratic Programs. PhD thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology.
201. Vavasis, S. A. (1995). Complexity issues in global optimization: A survey. In Horst, R. and Pardalos, P., editors, Handbook of Global Optimization, pages 27–41. Kluwer Academic Publishers, Dordrecht.
202. Vazirani, V. (2001). Approximation Algorithms. Springer, New York.
203. Vecchietti, A. and Grossmann, I. E. (1999). LOGMIP: A Disjunctive 0-1 Nonlinear Optimizer for Process System Models. Comp. Chem. Eng., 23:555–565.
204. Vecchietti, A., Lee, S., and Grossmann, I. (2003). Modeling of discrete/continuous optimization problems: characterization and formulation of disjunctions and their relaxations. Comp. Chem. Eng., pages 433–448.
205. Vigerske, S. (2005). Adaptive discretization of stochastic programs. Draft of a master thesis, Humboldt-Universität zu Berlin.
206. Viswanathan, J. and Grossmann, I. E. (1990). A Combined Penalty Function and Outer-Approximation Method for MINLP Optimization. Comp. Chem. Eng., 14:769.
207. Visweswaran, V. and Floudas, C. A. (1990). A global optimization algorithm (GOP) for certain classes of nonconvex NLPs: II. Application of theory and test problems. Comp. Chem. Eng.
208. von Stryk, O. and Glocker, M. (2000). Decomposition of mixed-integer optimal control problems using branch and bound and sparse direct collocation. In Engell, S., Kowalewski, S., and Zaytoon, J., editors, Proc. ADPM 2000-The 4th International Conference on Automation of Mixed Processes: Hybrid Dynamic Systems, pages 99–104. Shaker-Verlag, Dortmund.
209. Warners, J. P. (1999). Nonlinear Approaches to Satisfiability Problems. PhD thesis, Eindhoven University of Technology.
210. Weintraub, A. and Vera, J. (1991). A cutting plane approach for chance-constrained linear programs. Operations Research, 39:776–785.
211. Westerlund, T. and Lundquist, K. (2003). Alpha-ECP, Version 5.04. An Interactive MINLP-Solver Based on the Extended Cutting Plane Method. Report 01-178-A, Process Design Laboratory, Abo Akademi University, Abo, Finland, http://www.abo.fi./~twesterl/A-ECPManual.pdf.
212. Westerlund, T. and Petterson, F. (1995). An extended cutting plane method for solving convex MINLP problems. Comp. Chem. Eng., 21:131–136.
213. Westerlund, T., Petterson, F., and Grossmann, I. E. (1994). Optimization of pump configuration problems as a MINLP problem. Comp. Chem. Eng., 18(9):845– 858.
214. Westerlund, T., Skrifvars, H., Harjunkoski, I., and Pörn, R. (1998). An extended cutting plane method for a class of non-convex MINLP problems. Comp. Chem. Eng., 22(3):357–365.
215. Wolkowicz, H., Saigal, R., and Vandenberghe, L. (2000). Handbook of Semidefinite Programming. Kluwer Academic Publishers, Dordrecht.
216. Zamora, J. M. and Grossmann, I. E. (1998a). Continuous Global Optimization of Structured Process Systems Models. Comp. Chem. Eng., 22(12):1749–1770.
217. Zamora, J. M. and Grossmann, I. E. (1998b). A Global MINLP Optimization Algorithm for the Synthesis of Heat Exchanger Networks with no Stream Splits. Comp. Chem. Eng., 22(3):367–384.
218. Zhao, X. and Luh, B. P. (2002). New bundle methods for solving lagrangian relaxation dual problems. Journal of Optimization Theory and Applications, 113:373–397.
219. Zwick, U. (1999). Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems. In Proc. of 31th STOC, pages 679–687.