solmaximizers
Solmaximizers are the elements of a feasible set at which an objective function attains its maximum. The term is used in optimization literature to refer to the set of maximizing solutions to a problem and is closely related to the concept of the argmax. In many contexts, solmaximizers are described simply as the optimal solutions of a given optimization problem.
Formally, let X be a feasible set, a subset of real vector space, and f: X -> R
Existence of solmaximizers depends on the problem data. If X is compact and f is continuous, a
Properties of solmaximizers follow from the structure of the problem. If X is convex and f is
Computationally, solmaximizers are the target of various algorithms, including gradient ascent for differentiable problems and specialized