论文信息 - On duality theory of convex semi-infinite programming

On duality theory of convex semi-infinite programming

In this article we discuss weak and strong duality properties of convex semi-infinite programming problems. We use a unified framework by writing the corresponding constraints in a form of cone inclusions. The consequent analysis is based on the conjugate duality approach of embedding the problem into a parametric family of problems parameterized by a finite-dimensional vector.

A. Shapiro

[1] R. Rockafellar. Pacific Journal of Mathematics STOCHASTIC CONVEX PROGRAMMING : SINGULAR MULTIPLIERS AND EXTENDED DUALITY SINGULAR MULTIPLIERS , 2012 .

[2] R. Rockafellar,et al. Stochastic convex programming: basic duality. , 1976 .

[3] R. Rockafellar,et al. Stochastic Convex Programming: Relatively Complete Recourse and Induced Feasibility , 1976 .

[4] 丸山徹. Convex Analysisの二,三の進展について , 1977 .

[5] Klaus Glashoff,et al. Linear Optimization and Approximation , 1983 .

[6] R. Rockafellar. Conjugate Duality and Optimization , 1987 .

[7] Kenneth O. Kortanek,et al. Semi-Infinite Programming: Theory, Methods, and Applications , 1993, SIAM Rev..

[8] M. A. López-Cerdá,et al. Linear Semi-Infinite Optimization , 1998 .

[9] Wu Li,et al. Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities , 2000, SIAM J. Optim..

[10] Marco A. López,et al. Linear semi-infinite programming theory: An updated survey , 2002, Eur. J. Oper. Res..

[11] Lisa A. Korf,et al. Stochastic programming duality: ∞ multipliers for unbounded constraints with an application to mathematical finance , 2004, Math. Program..