Optimization Online


On a closedness theorem

Újvári Miklós (illes***at***math.elte.hu)

Abstract: In [1] several conditions are described which imply the closedness of linear images of convex sets. Here we combine two such theorems into a common generalization. We give a proof of the general theorem which is simpler than the proof obtained by combining the proofs of the two theorems. The paper is almost self-contained as we give transparent proofs of the separation theorems used. Also we present an application of our general closedness theorem in the theory of duality in convex programming. [1] R. T. Rockafellar, Convex analysis, Princeton University Press, Princeton, 1970.

Keywords: separation theorems, closedness

Category 1: Convex and Nonsmooth Optimization (Convex Optimization )

Citation: Operation Research Report 2005-2, Eötvös Loránd University Budapest, H-1117 Budapest, Pázmány Péter 1/c, Hungary

Download: [Postscript]

Entry Submitted: 03/24/2005
Entry Accepted: 03/24/2005
Entry Last Modified: 03/24/2005

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