{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T16:29:26Z","timestamp":1778516966124,"version":"3.51.4"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T00:00:00Z","timestamp":1658188800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T00:00:00Z","timestamp":1658188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007210","name":"RWTH Aachen University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007210","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2022,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The proof of convergence of adaptive discretization-based algorithms for semi-infinite programs (SIPs) usually relies on compact host sets for the upper- and lower-level variables. This assumption is violated in some applications, and we show that indeed convergence problems can arise when discretization-based algorithms are applied to SIPs with unbounded variables. To mitigate these convergence problems, we first examine the underlying assumptions of adaptive discretization-based algorithms. We do this paradigmatically using the lower-bounding procedure of Mitsos [Optimization 60(10\u201311):1291\u20131308, 2011], which uses the algorithm proposed by Blankenship and Falk [J Optim Theory Appl 19(2):261\u2013281, 1976]. It is noteworthy that the considered procedure and assumptions are essentially the same in the broad class of adaptive discretization-based algorithms. We give sharper, slightly relaxed, assumptions with which we achieve the same convergence guarantees. We show that the convergence guarantees also hold for certain SIPs with unbounded variables based on these sharpened assumptions. However, these sharpened assumptions may be difficult to prove a priori. For these cases, we propose additional, stricter, assumptions which might be easier to prove and which imply the sharpened assumptions. Using these additional assumptions, we present numerical case studies with unbounded variables. Finally, we review which applications are tractable with the proposed additional assumptions.<\/jats:p>","DOI":"10.1007\/s00186-022-00792-y","type":"journal-article","created":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T08:03:06Z","timestamp":1658217786000},"page":"83-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables"],"prefix":"10.1007","volume":"96","author":[{"given":"Daniel","family":"Jungen","sequence":"first","affiliation":[]},{"given":"Hatim","family":"Djelassi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0335-6566","authenticated-orcid":false,"given":"Alexander","family":"Mitsos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"key":"792_CR1","doi-asserted-by":"publisher","unstructured":"Bhattacharjee B, Green WH, Barton PI (2005a) Interval methods for semi-infinite programs. Comput Optim Appl 30(1):63\u201393. https:\/\/doi.org\/10.1007\/s10589-005-4556-8","DOI":"10.1007\/s10589-005-4556-8"},{"key":"792_CR2","doi-asserted-by":"publisher","unstructured":"Bhattacharjee B, Lemonidis P, Green WH Jr et al (2005b) Global solution of semi-infinite programs. Math Program 103(2):283\u2013307. https:\/\/doi.org\/10.1007\/s10107-005-0583-6","DOI":"10.1007\/s10107-005-0583-6"},{"issue":"2","key":"792_CR3","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF00934096","volume":"19","author":"JW Blankenship","year":"1976","unstructured":"Blankenship JW, Falk JE (1976) Infinitely constrained optimization problems. J Optim Theory Appl 19(2):261\u2013281. https:\/\/doi.org\/10.1007\/BF00934096","journal-title":"J Optim Theory Appl"},{"key":"792_CR4","doi-asserted-by":"publisher","unstructured":"Djelassi H (2020) Discretization-based algorithms for the global solution of hierarchical programs. Dissertation, RWTH Aachen University, Aachen. https:\/\/doi.org\/10.18154\/RWTH-2020-09163","DOI":"10.18154\/RWTH-2020-09163"},{"issue":"2","key":"792_CR5","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10898-016-0476-7","volume":"68","author":"H Djelassi","year":"2017","unstructured":"Djelassi H, Mitsos A (2017) A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs. J Glob Optim 68(2):227\u2013253. https:\/\/doi.org\/10.1007\/s10898-016-0476-7","journal-title":"J Glob Optim"},{"key":"792_CR6","unstructured":"Djelassi H, Mitsos A (2020) libale\u2014a library for algebraic logical expression trees. https:\/\/git.rwth-aachen.de\/avt.svt\/public\/libale"},{"issue":"3","key":"792_CR7","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1007\/s10957-021-01813-2","volume":"188","author":"H Djelassi","year":"2021","unstructured":"Djelassi H, Mitsos A (2021) Global solution of semi-infinite programs with existence constraints. J Optim Theory Appl 188(3):863\u2013881. https:\/\/doi.org\/10.1007\/s10957-021-01813-2","journal-title":"J Optim Theory Appl"},{"issue":"3","key":"792_CR8","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10898-019-00764-3","volume":"92","author":"H Djelassi","year":"2019","unstructured":"Djelassi H, Glass M, Mitsos A (2019) Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints. J Glob Optim 92(3):453. https:\/\/doi.org\/10.1007\/s10898-019-00764-3","journal-title":"J Glob Optim"},{"key":"792_CR9","doi-asserted-by":"publisher","unstructured":"Djelassi H, Mitsos A, Stein O (2021) Recent advances in nonconvex semi-infinite programming: applications and algorithms. EURO J Comput Optim 9(5):100006. https:\/\/doi.org\/10.1016\/j.ejco.2021.100006","DOI":"10.1016\/j.ejco.2021.100006"},{"issue":"3","key":"792_CR10","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1002\/nav.3800240307","volume":"24","author":"JE Falk","year":"1977","unstructured":"Falk JE, Hoffman K (1977) A nonconvex max\u2013min problem. Nav Res Logist Q 24(3):441\u2013450. https:\/\/doi.org\/10.1002\/nav.3800240307","journal-title":"Nav Res Logist Q"},{"issue":"4","key":"792_CR11","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.1137\/060657741","volume":"18","author":"CA Floudas","year":"2008","unstructured":"Floudas CA, Stein O (2008) The adaptive convexification algorithm: a feasible point method for semi-infinite programming. SIAM J Optim 18(4):1187\u20131208. https:\/\/doi.org\/10.1137\/060657741","journal-title":"SIAM J Optim"},{"key":"792_CR12","unstructured":"GAMS Development Corporation (2019) General algebraic modeling system (GAMS). http:\/\/www.gams.com\/"},{"issue":"2","key":"792_CR13","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.cam.2007.02.012","volume":"217","author":"F Guerra V\u00e1zquez","year":"2008","unstructured":"Guerra V\u00e1zquez F, R\u00fcckmann JJ, Stein O et al (2008) Generalized semi-infinite programming: a tutorial. J Comput Appl Math 217(2):394\u2013419. https:\/\/doi.org\/10.1016\/j.cam.2007.02.012","journal-title":"J Comput Appl Math"},{"issue":"4","key":"792_CR14","doi-asserted-by":"publisher","first-page":"1485","DOI":"10.1007\/s11590-020-01638-4","volume":"15","author":"SM Harwood","year":"2021","unstructured":"Harwood SM, Papageorgiou DJ, Trespalacios F (2021) A note on semi-infinite program bounding methods. Optim Lett 15(4):1485\u20131490. https:\/\/doi.org\/10.1007\/s11590-020-01638-4","journal-title":"Optim Lett"},{"issue":"3","key":"792_CR15","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1137\/1035089","volume":"35","author":"R Hettich","year":"1993","unstructured":"Hettich R, Kortanek KO (1993) Semi-infinite programming: theory, methods, and applications. SIAM Rev 35(3):380\u2013429. https:\/\/doi.org\/10.1137\/1035089","journal-title":"SIAM Rev"},{"key":"792_CR16","doi-asserted-by":"publisher","unstructured":"J\u00e4nich K (2008) Topologie, 8th edn. Springer-Lehrbuch, Springer, Berlin, https:\/\/doi.org\/10.1007\/978-3-540-26828-4","DOI":"10.1007\/978-3-540-26828-4"},{"issue":"3","key":"792_CR17","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s12532-018-0138-5","volume":"10","author":"A Khajavirad","year":"2018","unstructured":"Khajavirad A, Sahinidis NV (2018) A hybrid LP\/NLP paradigm for global optimization relaxations. Math Program Comput 10(3):383\u2013421. https:\/\/doi.org\/10.1007\/s12532-018-0138-5","journal-title":"Math Program Comput"},{"issue":"8","key":"792_CR18","first-page":"66","volume":"41","author":"KH K\u00fcfer","year":"2008","unstructured":"K\u00fcfer KH, Stein O, Winterfeld A (2008) Semi-infinite optimization meets industry: a deterministic approach to gemstone cutting. SIAM News 41(8):66","journal-title":"SIAM News"},{"issue":"2","key":"792_CR19","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.ejor.2006.08.045","volume":"180","author":"M L\u00f3pez","year":"2007","unstructured":"L\u00f3pez M, Still G (2007) Semi-infinite programming. Eur J Oper Res 180(2):491\u2013518. https:\/\/doi.org\/10.1016\/j.ejor.2006.08.045","journal-title":"Eur J Oper Res"},{"issue":"10\u201311","key":"792_CR20","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1080\/02331934.2010.527970","volume":"60","author":"A Mitsos","year":"2011","unstructured":"Mitsos A (2011) Global optimization of semi-infinite programs via restriction of the right-hand side. Optim 60(10\u201311):1291\u20131308. https:\/\/doi.org\/10.1080\/02331934.2010.527970","journal-title":"Optim"},{"issue":"8","key":"792_CR21","doi-asserted-by":"publisher","first-page":"2131","DOI":"10.1002\/aic.11230","volume":"53","author":"A Mitsos","year":"2007","unstructured":"Mitsos A, Barton PI (2007) A dual extremum principle in thermodynamics. AIChE J 53(8):2131\u20132147. https:\/\/doi.org\/10.1002\/aic.11230","journal-title":"AIChE J"},{"issue":"1","key":"792_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10898-014-0146-6","volume":"61","author":"A Mitsos","year":"2015","unstructured":"Mitsos A, Tsoukalas A (2015) Global optimization of generalized semi-infinite programs via restriction of the right hand side. J Glob Optim 61(1):1\u201317. https:\/\/doi.org\/10.1007\/s10898-014-0146-6","journal-title":"J Glob Optim"},{"key":"792_CR23","doi-asserted-by":"publisher","unstructured":"Mitsos A, Lemonidis P, Barton PI (2008a) Global solution of bilevel programs with a nonconvex inner program. J Glob Optim 42(4):475\u2013513. https:\/\/doi.org\/10.1007\/s10898-007-9260-z","DOI":"10.1007\/s10898-007-9260-z"},{"key":"792_CR24","doi-asserted-by":"publisher","unstructured":"Mitsos A, Lemonidis P, Lee CK et al (2008b) Relaxation-based bounds for semi-infinite programs. SIAM J Optim 19(1):77\u2013113. https:\/\/doi.org\/10.1137\/060674685","DOI":"10.1137\/060674685"},{"key":"792_CR25","series-title":"Springer series in operations research","doi-asserted-by":"publisher","DOI":"10.1007\/b98874","volume-title":"Numerical optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal J, Wright SJ (1999) Numerical optimization. Springer series in operations research. Springer, New York"},{"issue":"1","key":"792_CR26","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/BF00940041","volume":"71","author":"R Reemtsen","year":"1991","unstructured":"Reemtsen R (1991) Discretization methods for the solution of semi-infinite programming problems. J Optim Theory Appl 71(1):85\u2013103. https:\/\/doi.org\/10.1007\/BF00940041","journal-title":"J Optim Theory Appl"},{"key":"792_CR27","doi-asserted-by":"publisher","unstructured":"Reemtsen R, G\u00f6rner S (1998) Numerical methods for semi-infinite programming: a survey. In: Pardalos P, Horst R, Reemtsen R et\u00a0al (eds) Semi-infinite programming, nonconvex optimization and its applications, vol\u00a025. Springer, Boston, pp 195\u2013275. https:\/\/doi.org\/10.1007\/978-1-4757-2868-2_7","DOI":"10.1007\/978-1-4757-2868-2_7"},{"key":"792_CR28","unstructured":"Remez EI (1962) General computational methods of Chebyshev approximation: the problems with linear real parameters. Translation series, AEC-tr-4491, U.S. Atomic Energy Commission. Division of Technical Information, Oak Ridge, Tenn"},{"issue":"1","key":"792_CR29","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s00186-020-00724-8","volume":"93","author":"J Schwientek","year":"2021","unstructured":"Schwientek J, Seidel T, K\u00fcfer KH (2021) A transformation-based discretization method for solving general semi-infinite optimization problems. Math Methods Oper Res 93(1):83\u2013114. https:\/\/doi.org\/10.1007\/s00186-020-00724-8","journal-title":"Math Methods Oper Res"},{"key":"792_CR30","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2020.1804566","author":"T Seidel","year":"2020","unstructured":"Seidel T, K\u00fcfer KH (2020) An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence. Optim. https:\/\/doi.org\/10.1080\/02331934.2020.1804566","journal-title":"Optim"},{"key":"792_CR31","volume-title":"Bi-level strategies in semi-infinite programming, nonconvex optimization and its applications","author":"O Stein","year":"2003","unstructured":"Stein O (2003) Bi-level strategies in semi-infinite programming, nonconvex optimization and its applications, vol 71. Springer, Boston"},{"issue":"2","key":"792_CR32","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/S0377-2217(99)00132-0","volume":"119","author":"G Still","year":"1999","unstructured":"Still G (1999) Generalized semi-infinite programming: theory and methods. Eur J Oper Res 119(2):301\u2013313. https:\/\/doi.org\/10.1016\/S0377-2217(99)00132-0","journal-title":"Eur J Oper Res"},{"issue":"1","key":"792_CR33","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s101070100239","volume":"91","author":"G Still","year":"2001","unstructured":"Still G (2001) Discretization in semi-infinite programming: the rate of convergence. Math Program 91(1):53\u201369. https:\/\/doi.org\/10.1007\/s101070100239","journal-title":"Math Program"},{"issue":"4","key":"792_CR34","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1007\/s11590-010-0236-4","volume":"5","author":"A Tsoukalas","year":"2011","unstructured":"Tsoukalas A, Rustem B (2011) A feasible point adaptation of the blankenship and falk algorithm for semi-infinite programming. Optim Lett 5(4):705\u2013716. https:\/\/doi.org\/10.1007\/s11590-010-0236-4","journal-title":"Optim Lett"},{"issue":"3","key":"792_CR35","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1016\/j.ejor.2007.01.057","volume":"191","author":"A Winterfeld","year":"2008","unstructured":"Winterfeld A (2008) Application of general semi-infinite programming to lapidary cutting problems. Eur J Oper Res 191(3):838\u2013854. https:\/\/doi.org\/10.1016\/j.ejor.2007.01.057","journal-title":"Eur J Oper Res"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-022-00792-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00186-022-00792-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-022-00792-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T13:28:59Z","timestamp":1665408539000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00186-022-00792-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,19]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["792"],"URL":"https:\/\/doi.org\/10.1007\/s00186-022-00792-y","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,19]]},"assertion":[{"value":"1 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"All authors gave their consent for publication.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}