A maximum theorem for generalized convex functions

Abstract

Motivated by the Maximum Theorem for convex functions (in the setting of linear spaces) and for subadditive functions (in the setting of Abelian semigroups), we establish a Maximum Theorem for the class of generalized convex functions, i.e., for functions f:X R that satisfy the inequality f(x y)≤ pf(x)+qf(y), where is a binary operation on X and p,q are positive constants. As an application, we also obtain an extension of the Karush--Kuhn--Tucker theorem for this class of functions.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…