We provide a simple proof of the Moreau-Rockafellar theorem that a proper lower semicontinuous convex function on a Banach space is determined up to a constant by its ...

The Difference of Convex functions Algorithm (DCA) is used to solve nonconvex optimization problems over a certain convex set, specifically quadratic programming ones, generally by finding approximate ...

Convex geometry and point set configurations form a pivotal area of research in computational geometry, where the primary focus is the study of convex sets and the intricate arrangements of points in ...