Abstract
It is well known that a strictly convex minimand admits at most one minimizer. We prove a partial converse: Let be a locally convex Hausdorff space and a function with compact sublevel sets and exhibiting some mildly superlinear growth. Then each tilted minimization problem
admits at most one minimizer as ranges over if and only if the biconjugate is essentially strictly convex and agrees with at all points where is subdifferentiable. We prove this via a representation formula for that might be of independent interest.
admits at most one minimizer as ranges over if and only if the biconjugate is essentially strictly convex and agrees with at all points where is subdifferentiable. We prove this via a representation formula for that might be of independent interest.
Suggested citation
Published by Heldermann Verlag, 2022. Rights now held by Banach Press.
