On duality theory of convex semi-infinite programming

By Alexander Shapiro. 2005

49 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/38bdfdbe0bd34ceb8d50779ac2cc97b9f3459d81

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

1. Alexander Shapiro
2. Guanghui Lan
3. Saeed Ghadimi
4. Arkadi Nemirovski
5. Roberto Imbuzeiro Oliveira
6. Csaba Szepesvari
7. Simon J. Godsill
8. Dimitris J. Bertsimas

In Management Science and Operations Research

1. Alexander Shapiro
2. Guanghui Lan
3. Andrzej Ruszczynski
4. Tito Homem-de-Mello
5. Arkadi Nemirovski
6. Saeed Ghadimi
7. Dimitris J. Bertsimas
8. Darinka Dentcheva †

In Numerical Analysis

1. Alexander Shapiro
2. Dimitris J. Bertsimas
3. Nathan Kallus
4. Vishal Gupta
5. Hamed Rahimian
6. Sanjay Mehrotra

Citations in the corpus

• Semi-infinite programming, duality, discretization and optimality conditions (2009, background): “If, moreover, the SIP problem (1.1) is convex, then for every 2K*, the function L( , ) is proper convex and lower semicontinuous.”