Solvability theorems involving inf-convex functions
type: Item
instance of: scholarly article
title: Solvability theorems involving inf-convex functions
zbMATH Open document ID: 0836.49003
author: Yanyan Li
published in: Journal of Mathematical Analysis and Applications
publication date: 1995-11-16T00:00:00Z
review text: The function \(f : X_0 \to R \cup \{\infty\}\) is inf-convex if there exists a family of functions \((f_\alpha)_{\alpha \in \Delta} \subset \Gamma (X_0)\) such that \(f = \inf_{\alpha \in \Delta} f_\alpha\), where \(X_0\) is a nonempty convex subset of a locally convex Hausdorff vector space \(X\). Similarly one defines min-convex functions (the infimum is attained at every \(x \in X_0)\), inf-SL and min-SL functions (SL comes from sublinear). The main result of the paper is Theorem 3.1 which gives necessary and sufficient conditions for having: \(x \in K\), \(g(x) \in S \Rightarrow f(x) \geq 0\), where \(K\) and \(S\) are closed convex cones, while \(f\) and \(\lambda g\) \((\lambda \in \Lambda \subset S^*)\) are inf- SL functions. By homogenization, one extends this result to inf-convex functions. The results are then applied to Lagrangian duality for infinite-dimensional programming problems involving min-convex functions.
Mathematics Subject Classification ID: 49J27
Mathematics Subject Classification ID: 90C48
zbMATH DE Number: 801003
zbMATH Keywords: solvability theorems
zbMATH Keywords: min-convex functions
zbMATH Keywords: inf-convex functions
zbMATH Keywords: Lagrangian duality
zbMATH Keywords: infinite-dimensional programming
reviewed by: Constantin Zălinescu
MaRDI profile type: Publication
full work available at URL: jmaa.1995.1132
OpenAlex ID: W2043688950
DOI: 10.1006/JMAA.1995.1132
Recommended article: Solvability theorems for classes of difference convex functions
Recommended article: Abstract Convexity and Solvability Theorems
Recommended article: Q4271940
Recommended article: Infima of Convex Functions
Recommended article: Inequalities via convex functions
Recommended article: Fixed point theory for almost convex functions
Recommended article: Convexity and well-posed problems
Recommended article: Q3722880
Recommended article: Q4026435
Recommended article: Inequalities for n-convex functions
description: scientific article; zbMATH DE number 801003