On Abrams’ theorem

نویسنده

  • Miklós Ujvári
چکیده

Abrams’ theorem describes a necessary and sufficient condition for the closedness of a linear image of an arbitrary set. Closedness conditions of this type play an important role in the theory of duality in convex programming. In this paper we present generalizations of Abrams’ theorem, as well as Abrams-type theorems characterizing other properties (such as relatively openness or polyhedrality) of linear images of convex sets. Mathematics Subject Classifications (2000). 90C46, 90C25, 52A41.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approach to undiagnosed exudative pleural effusion: the diagnostic yield of blind pleural biopsy

Background: Blind percutaneous pleural biopsy has traditionally been performed to investigate the etiology of exudative pleural effusion in which the initial thoracocentesis has been non- diagnostic. In view of the increasing use of image-guided and thoracoscopic pleural biopsies, this study examined the role of blind Abrams pleural biopsy in the investigation of the exudative pleural effusion ...

متن کامل

A family of Nim-like arrays: The Locator Theorem

Article history: Received 21 January 2013 Received in revised form 29 September 2013 Accepted 27 March 2014 Communicated by A. Fraenkel

متن کامل

Review of Abstraction and Refinement of Layered Security Policy

ion and Refinement of Layered Security Policy by Marshall Abrams and David Bailey

متن کامل

Subjective Measures of Well - Being “ Direct ” ?

[2010]; the Australasian Journal of Philosophy is available online at: . Earlier versions of this paper were presented at the University of Birmingham, the University of Helsinki, and the University of Alabama. I am grateful to audiences and to Marshall Abrams, Larry James, Antti Kauppinen, Harold Kincaid, Uskali Mäki, Don Ross, and two anonymous referees for u...

متن کامل

. G T ] 1 9 A ug 2 00 5 Braid Groups of the Sun Graph

In this article we calculate the n-string braid groups of certain noncontractible graphs. We use techniques from the work of A. Abrams, F. Connolly and M. Doig combined with Van Kampen’s Theorem to prove these results.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008