Relaxation-based bounds for semi-infinite programs

SIAM Journal on Optimization

Volumn 19, Issue 1, 2008, Pages 77-113

  Mitsos, Alexander ^a   Lemonidis, Panayiotis ^a   Lee, Cha Kun ^a   Barton, Paul I ^a  

^a Massachusetts Institute of Technology Cambridge   (United States)

Author keywords

Convex relaxation; Global optimization; KKT; Linearization; MPEC; Nonconvex; SIP

Indexed keywords

CONVEX RELAXATION; KKT; MPEC; NONCONVEX; SIP;

CONTROL THEORY; CONVEX OPTIMIZATION; GLOBAL OPTIMIZATION; LINEARIZATION; OPTIMAL SYSTEMS; OPTIMIZATION; RELAXATION PROCESSES; TURBO CODES;

INTERNET PROTOCOLS;

EID: 61349126619     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/060674685     Document Type: Article

References (58)

1. C. S. ADJIMAN, I. P. ANDROULAKIS, AND C. A. FLOUDAS, A global optimization method, αBB, for general twice-differentiable constrained NLPs - II Implementation and computational results, Computers & Chemical Engineering, 22 (1998), pp. 1159-1179.
2. C. S. ADJIMAN, I. P. ANDROULAKIS, C. D. MARANAS, AND C. A. FLOUDAS, A global optimization method, αBB, for process design, Computers & Chemical Engineering, 20 (1996), pp. S419-S424.
3. C. S. ADJIMAN, S. DALLWIG, C. A. FLOUDAS, AND A. NEUMAIER, A global optimization method, αBB, for general twice-differentiable constrained NLPs - I. Theoretical advances, Computers & Chemical Engineering, 22 (1998), pp. 1137-1158.
4. C. S. ADJIMAN AND C. A. FLOUDAS, Rigorous convex underestimators for general twice-differentiable problems, J. Global Optim., 9 (1996), pp. 23-40.
5. I. G. AKROTIRIANAKIS AND C. A. FLOUDAS, A new class of improved convex underestimators for twice continuously differentiable constrained NLPs, J. Global Optim., 30 (2004), pp. 367-390.
6. G. ALEFELD AND G. MAYER, Interval analysis: Theory and applications, J. Comput. Appl. Math., 121 (2000), pp. 421-464.
7. J. F. BARD, Practical Bilevel Optimization: Algorithms and Applications, Nonconvex Optim. Appl., Kluwer Academic Publishers, Dordrecht, The Netherlands, 1998.
8. P. I. BARTON, Subgradients for McCormick Relaxations, technical report, Massachusetts Institute of Technology, Cambridge, MA, 2006; available online from http://yoric.mit.edu/download/Reports/barton06mcpdf.
9. A. A. BEN-TAL AND A. NEMIROVSKI, Robust optimization-Methodology and applications, Math. Programming, 92 (2002), pp. 453-480.
10. D. P. BERTSEKAS, Nonlinear Programming, 2nd ed., Athena Scientific, Belmont, MA, 1999.
11. B. BHATTACHARJEE, Kinetic Model Reduction Using Integer and Semi-Infinite Programming, Ph.D. thesis, Department of Chemical Engineering, Massachusetts Institute of Technology, Cambridge, MA, 2003.
12. B. BHATTACHARJEE, W. H. GREEN, JR., AND P. I. BARTON, Interval methods for semi-infinite programs, Comput. Optim. Appl., 30 (2005), pp. 63-93.
13. B. BHATTACHARJEE, P. LEMONIDIS, W. H. GREEN, JR., AND P. I. BARTON, Global solution of semi-infinite programs, Math. Program., 103 (2005), pp. 283-307.
14. J. W. BLANKENSHIP AND J. E. FALK, Infinitely constrained optimization problems, J. Optim. Theory Appl., 19 (1976), pp. 261-281.
15. A. BROOKE, D. KENDRICK, AND A. MEERAUS, GAMS: A User's Guide, The Scientific Press, Redwood City, CA, 1988.
16. I. D. COOPE AND C. J. PRICE, Exact penalty function methods for nonlinear semi-infinite programming, in Semi-Infinite Programming, R. Reemtsen and J. J. Rückmann, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 1998, pp. 137-157.
17. I. D. COOPE AND G. A. WATSON, A projected Lagrangian algorithm for semi-infinite programming, Math. Programming, 32 (1985), pp. 337-356.
18. V. DUA, K. P. PAPALEXANDRI, AND E. N. PISTIKOPOULOS, Global optimization issues in multiparametric continuous and mixed-integer optimization problems, J. Global Optim., 30 (2004), pp. 59-89.
19. C. A. FLOUDAS AND O. STEIN, The adaptive convexification algorithm: A feasible point method for semi-infinite programming, SIAM J. Optim., 18 (2007), pp. 1187-1208.
20. J. FORTUNY-AMAT AND B. MCCARL, A representation and economic interpretation of a two-level programming problem, J. Oper. Res. Soc., 32 (1981), pp. 783-792.
21. E. P. GATZKE, J. E. TOLSMA, AND P. I. BARTON, Construction of convex function relaxations using automated code generation techniques, Optim. Engrg., 3 (2002), pp. 305-326.
22. A. M. GEOFFRION AND R. NAUSS, Parametric and postoptimality analysis in integer linear programming, Management Sci., 23 (1977), pp. 453-466.
23. M. A. GOBERNA AND M. A. LOPEZ, Linear Semi-Infinite Optimization, John Wiley and Sons, New York, 1998.
24. S. GÖRNER, A. POTCHINKOV, AND R. REEMTSEN, The direct solution of nonconvex nonlinear FIR filter design problems by a SIP method, Optim. Engrg., 1 (2000), pp. 123-154.
25. R. HETTICH, An implementation of a discretization method for semi-infinite programming, Math. Programming, 34 (1986), pp. 354-361.
26. R. HETTICH AND K. O. KORTANEK, Semi-infinite programming: Theory, methods, and applications, SIAM Rev., 35 (1993), pp. 380-429.
27. P. LEMONIDIS, A. MITSOS, AND P. I. BARTON, Relaxation-based Bounds for Generalized Semi-infinite Programs, manuscript, 2006.
28. Z. LIU AND Y. H. GONG, Semi-infinite quadratic optimization method for the design of robust adaptive array processors, IEEE Proc. Radar and Signal Processing, 137 (1990), pp. 177-182.
29. C. D. MARANAS AND C. A. FLOUDAS, Finding all solutions of nonlinearly constrained systems of equations, J. Global Optim., 7 (1995), pp. 143-182.
30. G. P. MCCORMICK, Computability of global solutions to factorable nonconvex programs: Part I. Convex underestimating problems, Math. Programming, 10 (1976), pp. 147-175.
31. A. MITSOS AND P. I. BARTON, Issues in the Development of Global Optimization Algorithms for Bilevel Programs with a Nonconvex Inner Program, techical report, Massachusetts Institute of Technology, Cambridge, MA, 2006; available online from http://yoric.mit.edu/ download/Reports/bilevelissues.pdf.
32. R. E. MOORE, Methods and Applications of Interval Analysis, SIAM Stud. Appl. Math. 2, SIAM, Philadelphia, 1979.
33. M. NEES, Chebyshev approximation by discrete superposition. Application to neural networks, Adv. Comput. Math., 5 (1996), pp. 137-151.
34. S. NORDEBO AND Z. Q. ZANG, Semi-infinite linear programming: A unified approach to digital filter design with time- and frequency-domain specifications, IEEE Trans. Circuits Systems II Analog Digital Signal Process., 46 (1999), pp. 765-775.
35. Y. OHTAKE AND N. NISHIDA, A branch-and-bound algorithm for 0-1 parametric mixed integer programming, Oper. Res. Lett., 4 (1985), pp. 41-45.
36. O. O. OLUWOLE, B. BHATTACHARJEE, J. E. TOLSMA, P. I. BARTON, AND W. H. GREEN, JR., Rigorous valid ranges for optimally reduced kinetic models, Combustion and Flame, 146 (2006), pp. 348-365.
37. E. R. PANIER AND A. L. TITS, A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design, IEEE Trans. Automat. Control, 34 (1989), pp. 903-908.
38. E. POLAK AND D. M. STIMLER, Majorization - A computational-complexity reduction technique in control-system design, IEEE Trans. Automat. Control, 33 (1988), pp. 1010-1021.
39. C. J. PRICE AND I. D. COOPE, An exact penalty-junction algorithm for semi-infinite programs, BIT, 30 (1990), pp. 723-734.
40. C. J. PRICE AND I. D. COOPE, Numerical experiments in semi-infinite programming, Comput. Optim. Appl., 6 (1995), pp. 169-189.
41. R. R. REEMTSEN AND S. GÖRNER, Numerical methods for semi-infinite programming: A survey, in Semi-Infinite Programming, R. Reemtsen and J. J. Rückmann, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 1998, pp. 195-275.
42. H. RATSCHEK AND J. ROKNE, Computer Methods for the Range of Functions, Ellis Horwood Ser. Math. Appl., Halsted Press, New York, 1984.
43. R. REEMTSEN, Discretization methods for the solution of semi-infinite programming-problems, J. Optim. Theory Appl., 71 (1991), pp. 85-103.
44. N. SAHINIDIS AND M. TAWARMALANI, BARON (software manual), available online at http://www.gams.com/solvers/baron.pdf, 2005.
45. A. B. SINGER AND P. I. BARTON, Global optimization with nonlinear ordinary differential equations, J. Global Optim., 34 (2006), pp. 159-190.
46. E. M. B. SMITH AND C. C. PANTELIDES, A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs, Computers & Chemical Engineering, 23 (1999), pp. 457-478.
47. O. STEIN AND G. STILL, On generalized semi-infinite optimization and bilevel optimization, European J. Oper. Res., 142 (2002), pp. 444-462.
48. O. STEIN AND G. STILL, Solving semi-infinite optimization problems with interior point techniques, SIAM J. Control Optim., 42 (2003), pp. 769-788.
49. G. STILL, Discretization in semi-infinite programming: The rate of convergence, Math. Programming, 91 (2001), pp. 53-69.
50. Y. TANAKA, M. FUKUSHIMA, AND T. IBARAKI, A globally convergent SQP method for semi-infinite nonlinear optimization, J. Comput. Appl. Math., 23 (1988), pp. 141-153.
51. M. TAWARMALANI AND N. V. SAHINIDIS, Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming, Nonconvex Optim. Appl., Kluwer Academic Publishers, Boston, 2002.
52. M. TAWARMALANI AND N. V. SAHINIDIS, Global optimization of mixed-integer nonlinear programs: A theoretical and computational study, Math. Program., 99 (2004), pp. 563-591.
53. J. TOLSMA AND P. I. BARTON, DAEPACK: An open modeling environment for legacy models, Industrial and Engineering Chemistry Research, 39 (2000), pp. 1826-1839.
54. J. E. TOLSMA AND P. I. BARTON, DAEPACK: A Symbolic and Numeric Library, website at http://yoric.mit.edu/daepack/daepack.html.
55. A. I. F. VAZ, E. M. G. P. FERNANDES, AND M. P. S. F. GOMES, SIPAMPL: Semi-infinite programming with AMPL, ACM Trans. Math. Software, 30 (2004), pp. 47-61.
56. X. J. WANG AND T. S. CHANG, An improved univariate global optimization algorithm with improved linear lower bounding functions, J. Global Optim., 8 (1996), pp. 393-411.
57. G. WATSON, Numerical experiments with globally convergent methods for semi-infinite programming problems, Lecture Notes in Econ. Math. Systems, 215 (1983), pp. 193-205.
58. S. ZAKOVIC, B. RUSTEM, AND S. P. ASPREY, A parallel algorithm for semi-infinite programming, Comput. Statist. Data Anal., 44 (2003), pp. 377-390.