References
- Stein O. A semi-infinite approach to design centering. In: Dempe S, KalashnikovV, editors. Optimization with mulitvalued mappings. Chapter 1, Springer; 2006. p. 209–228.
- Winterfeld A. Application of general semi-infinite programming to lapidary cutting problems. Eur. J. Oper. Res. 2008;191:838–854. Available from: http://linkinghub.elsevier.com/retrieve/pii/S0377221707004328.
- Ben-Tal A, El Ghaoui L, Nemirovski A. Robust optimization. Princeton series in applied mathematics: Princeton University Press; 2009.
- Stein O, Still G. Solving semi-infinite optimization problems with interior point techniques. SIAM J. Control Optim. 2003;42:769–788.
- López MA, Still G. Semi-infinite programming. Eur. J. Oper. Res. 2007;180:491–518. Available from: http://linkinghub.elsevier.com/retrieve/pii/S0377221706008782.
- Diehl M, Houska B, Stein O, et al. A lifting method for generalized semi-infinite programs based on lower level Wolfe duality. Comput. Optim. Appl. 2013;54:189–210. Available from: http://www.springerlink.com/index/10.1007/s10589-012-9489-4.
- Levitin ES, Tichatschke R. A branch-and-bound approach for solving a class of generalized semi-infinite programming problems. J. Global Optim. 1998;13:299–315.
- Stein O, Winterfeld A. Feasible method for generalized semi-infinite programming. J. Optim. Theory Appl. 2010;146:419–443. Available from: http://www.springerlink.com/index/10.1007/s10957-010-9674-5.
- Stein O, Still G. On generalized semi-infinite optimization and bilevel optimization. Eur. J. Oper. Res. 2002;142:444–462. Available from: http://linkinghub.elsevier.com/retrieve/pii/S0377221701003071.
- Still G. Generalized semi-infinite programming: theory and methods. Eur. J. Oper. Res. 1999;119:301–313.
- Still G. Generalized semi-infinite programming: numerical aspects. Optimization. 2001;49:223–242.
- Still G. Solving generalized semi-infinite programs by reduction to simpler problems. Optimization. 2004;53:19–38. Available from: http://www.tandfonline.com/doi/abs/10.1080/02331930410001661190.
- Günzel H, Jongen HT, Stein O. Generalized Semi-Infinite programming: on generic local minimizers. J. Global Optim. 2008;42:413–421.
- Jongen HT, Rückmann JJ, Stein O. Generalized semi-infinite optimization: a first order optimality condition and examples. Math. Program. 1998;83:145–158. Available from: http://www.springerlink.com/index/10.1007/BF02680555.
- Kanzi N, Nobakhtian S. Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems. Eur. J. Oper. Res. 2010;205:253–261. Available from: http://linkinghub.elsevier.com/retrieve/pii/S0377221710000056.
- Rückmann JJ, Shapiro A. First-order optimality conditions in generalized semi-infinite programming. J. Optim. Theory Appl. 1999;101:677–691.
- Blankenship JW, Falk JE. Infinitely constrained optimization problems. J. Optim. Theory Appl. 1976;19:261–281.
- Guerra Vázquez F, Rückmann JJ, Stein O, et al. Generalized semi-infinite programming: a tutorial. J. Comput. Appl. Math. 2008;217:394–419. Available from: http://linkinghub.elsevier.com/retrieve/pii/S0377042707000982.
- Stein O. How to solve a semi-infinite optimization problem. Eur. J. Oper. Res. 2012;223:312–320. Available from: http://linkinghub.elsevier.com/retrieve/pii/S037722171200464X.
- Mitsos A, Tsoukalas A. Global optimization of generalized semi-infinite programs via restriction of the right hand side. J. Global Optim. 2014;61:1–17.
- Mitsos A. Global optimization of semi-infinite programs via restriction of the right-hand side. Optimization. 2011;60:1291–1308. Available from: http://www.tandfonline.com/doi/abs/10.1080/02331934.2010.527970.
- Bertsekas DP. Nonlinear Programming. 2nd ed. Belmont, Massachusetts: Athena Scientific; 1999.
- Bertsekas DP. Convex Optimization Theory. Belmont, Massachusetts: Athena Scientific; 2009.
- Bhattacharjee B, Green WH, Barton PI. Interval methods for semi-infinite programs. Comput. Optim. Appl. 2005;30:63–93. Available from: http://www.springerlink.com/index/10.1007/s10589-005-4556-8.
- Bhattacharjee B, Lemonidis P, Green WH, et al. Global solution of semi-infinite programs. Math. Program. Ser. B. 2005;103:283–307.
- Floudas CA, Stein O. The adaptive convexification algorithm: a feasible point method for semi-infinite programming. SIAM J. Optim. 2007;18:1187–1208.
- Mitsos A, Lemonidis P, Lee CK, et al. Relaxation-based bounds for semi-infinite programs. SIAM J. Optim. 2008;19:77–113.
- Moore RE, Kearfott RB, Cloud MJ. Introduction to interval analysis. Philadelphia (PA): SIAM; 2009.
- Geoffrion AM. Duality in nonlinear programming: a simplified applications-oriented development. SIAM Rev. 1971;13:1–37. Available from: http://epubs.siam.org/doi/abs/10.1137/1013001.
- Tawarmalani M, Sahinidis NV. A polyhedral branch-and-cut approach to global optimization. Math. Program. 2005;103:225–249.
- Sahinidis NV. BARON 14.0.3: global optimization of mixed-integer nonlinear programs. User’s manual. 2014. Available from: http://www.minlp.com/downloads/docs/baronmanual.pdf.
- Bertsimas D, Tsitsiklis JN. Introduction to linear optimization. Belmont, Massachusetts: Athena Scientific; 1997.
- Günzel H, Jongen HT, Stein O. On the closure of the feasible set in generalized semi-infinite programming. Cent. Eur. J. Oper. Res. 2007;15:271–280.
- Gal T. Postoptimal analyses, parametric programming, and related topics. 2nd ed. New York (NY): Walter de Gruyter; 1995.
- Lobo MS, Vandenberghe L, Boyd S, Lebret H. Applications of second-order cone programming. Linear Algebra Appl. 1998;284:193–228.
- Nesterov Y, Nemirovski A. Interior-point polynomial algorithms in convex programming. Philadelphia: SIAM; 1994.
- Boyd S, Vandenberghe L. Convex optimization. New York: Cambridge University Press; 2004. Available from: http://ebooks.cambridge.org/ref/id/CBO9780511804441.
- 2014. GAMS: general algebraic modeling system. Available from: http://www.gams.com.
- Misener R, Floudas CA. ANTIGONE: algorithms for coNTinuous/integer global optimization of nonlinear equations. J. Global Optim. 2014;59:503–526.
- Gill PE, Murray W, Saunders MA. SNOPT: an SQP algorithm for large-scale constrained optimization. SIAM Rev. 2005;47:99–131.
- Adjiman CS, Dallwig S, Floudas CA, et al. A global optimization method, αBB, for general twice-differentiable constrained NLPs - I. Theoretical advances. Comput. Chem. Eng. 1998;22:1137–1158.