Journal of Convex Analysis 23 (2016), No. 3, 877--892
Copyright Heldermann Verlag 2016
Most Convex Functions Have Unique Minimizers
Chayne Planiden
Dept. of Mathematics, University of British Columbia, Okanagan Campus, 3333 University Way, Kelowna, BC, Canada V1V 1V7
chayneplaniden@hotmail.com
Xianfu Wang
Dept. of Mathematics, University of British Columbia, Okanagan Campus, 3333 University Way, Kelowna, BC, Canada V1V 1V7
shawn.wang@ubc.ca
Finding the minimum and the minimizers of convex functions has been of primary concern in convex analysis since its conception. It is well-known that if a convex function has a minimum, then that minimum is global. The minimizers, however, may not be unique. There are certain subclasses, such as strictly convex functions, that do have unique minimizers when the minimum exists, but other subclasses, such as constant functions, that do not. This paper addresses the question of how many convex functions have unique minimizers. We show, using Baire category theory, that the set of proximal mappings of convex functions that have a unique fixed point is generic. Consequently, the set of classes of convex functions that have unique minimizers is generic.
Keywords: Baire category, complete metric space, convex function, generic set, graphical convergence, proximal mapping, subdifferential, super-regularity, unique minimizer, unique zero.
MSC: 52A41, 54E52; 54E50
[ Fulltext-pdf (161 KB)] for subscribers only.