Convexity and unique minimum points

Archive for Mathematical Logic 58 (1-2):27-34 (2019)
  Copy   BIBTEX

Abstract

We show constructively that every quasi-convex, uniformly continuous function \ with at most one minimum point has a minimum point, where C is a convex compact subset of a finite dimensional normed space. Applications include a result on strictly quasi-convex functions, a supporting hyperplane theorem, and a short proof of the constructive fundamental theorem of approximation theory.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,593

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Fundamental results for pointfree convex geometry.Yoshihiro Maruyama - 2010 - Annals of Pure and Applied Logic 161 (12):1486-1501.
Regularity of convex functions on Heisenberg groups.Zoltán M. Balogh & Matthieu Rickly - 2003 - Annali della Scuola Normale Superiore di Pisa- Classe di Scienze 2 (4):847-868.
Computability of Minimizers and Separating Hyperplanes.Kam-Chau Wong - 1996 - Mathematical Logic Quarterly 42 (1):564-568.
Constructive notions of strict convexity.Douglas S. Bridges - 1993 - Mathematical Logic Quarterly 39 (1):295-300.
Convexity and constructive infima.Josef Berger & Gregor Svindland - 2016 - Archive for Mathematical Logic 55 (7-8):873-881.
On S-Convexity and Risk Aversion.Michel Denuit, Claude Lefèvre & Marco Scarsini - 2001 - Theory and Decision 50 (3):239-248.
Unique solutions.Peter Schuster - 2006 - Mathematical Logic Quarterly 52 (6):534-539.

Analytics

Added to PP
2018-02-22

Downloads
10 (#1,025,836)

6 months
1 (#1,040,386)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On Farkas' lemma and related propositions in BISH.Josef Berger & Gregor Svindland - 2022 - Annals of Pure and Applied Logic 173 (2):103059.

Add more citations