Semi-infinite programming
By Marco A. López, Georg J. Still. European Journal of Operational Research, 2007
496 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Management Science and Operations Research, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/04f6f9c7bc7639fbed7f0a7bf2812379371ff1a8
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Hamed Rahimian
- Sanjay Mehrotra
- Alexander Shapiro
- Pu Li
- Abebe Geletu
- Michael Klöppel
- Armin Hoffmann
- Nader Kanzi
In Management Science and Operations Research
- Hamed Rahimian
- Sanjay Mehrotra
- Pu Li
- Abebe Geletu
- Michael Klöppel
- Armin Hoffmann
- Nader Kanzi
- Soghra Nobakhtian
In Numerical Analysis
- Alexander Shapiro
- Hamed Rahimian
- Sanjay Mehrotra
- Nader Kanzi
- Soghra Nobakhtian
- Jan-Joachim Rückmann
- Francisco Guerra Vázquez
- Oliver Stein
Citations in the corpus
- Optimality conditions for non-smooth semi-infinite programming (2010, methodology): “We refer the reader to the recent paper by López and Still [13] which gives an up-to-date survey on semi-infinite programming problems with a list of 100 references.”
- A tractable approximation of non-convex chance constrained optimization with non-Gaussian uncertainties (2015, methodology): “Since the robust optimization approach (Ben-Tal and Nemirovski 1998, 1999) attempts to satisfy constraints under almost all possible realizations of the uncertainties, generally it may lead to a semi-infinite optimization problem (López and Still 2007).”
- Semi-infinite programming, duality, discretization and optimality conditions (2009, result): “Some of the surveyed results are well known while others seem to be less noticed in that area of research.”
- Distributionally Robust Optimization: A Review (2019, methodology): “For reviews of the theory and methods for SIPs, we refer the readers to Hettich and Kortanek [145], Reemtsen and Görner [255], López and Still [194].”
- Generalized semi-infinite programming: A tutorial (2008, methodology): “For SIP such a result holds under weak assumptions if d is obtained as solution of the linear SIP (see [62]): min d,z z s.”