Optimization Online


Semi-infinite programming, duality, discretization and optimality conditions

Alexander Shapiro (ashapiro***at***isye.gatech.edu)

Abstract: The aim of this paper is to give a survey of some basic theory of semi-infinite programming. In particular, we discuss various approaches to derivations of duality, discretization and first and second order optimality conditions. Some of the surveyed results are well known while others seem to be less noticed in that area of research.

Keywords: semi-infinite programming, conjugate duality, convex analysis, discretization, Lagrange multipliers, first and second order optimality conditions

Category 1: Infinite Dimensional Optimization (Semi-infinite Programming )


Download: [PDF]

Entry Submitted: 07/07/2008
Entry Accepted: 07/07/2008
Entry Last Modified: 12/16/2008

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society