A note on semi-infinite program bounding methods
From MaRDI portal
Publication:6330396
DOI10.1007/S11590-020-01638-4arXiv1912.01763MaRDI QIDQ6330396FDOQ6330396
Authors: Stuart M. Harwood, Dimitri J. Papageorgiou, Francisco Trespalacios 
Publication date: 3 December 2019
Abstract: Semi-infinite programs are a class of mathematical optimization problems with a finite number of decision variables and infinite constraints. As shown by Blankenship and Falk (Blankenship and Falk. "Infinitely constrained optimization problems." Journal of Optimization Theory and Applications 19.2 (1976): 261-281.), a sequence of lower bounds which converges to the optimal objective value may be obtained with specially constructed finite approximations of the constraint set. In (Mitsos. "Global optimization of semi-infinite programs via restriction of the right-hand side." Optimization 60.10-11 (2011): 1291-1308.), it is claimed that a modification of this lower bounding method involving approximate solution of the lower-level program yields convergent lower bounds. We show with a counterexample that this claim is false, and discuss what kind of approximate solution of the lower-level program is sufficient for correct behavior.
This page was built for publication: A note on semi-infinite program bounding methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6330396)
