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 ...

This is a preview. Log in through your library . Abstract In the setting of Hilbert spaces, we show that a hybrid steepest-descent algorithm converges strongly to a solution of a convex minimization ...

Mathematics of Operations Research, Vol. 38, No. 2 (May 2013), pp. 248-264 (17 pages) In this paper, we address the basic geometric question of when a given convex set is the image under a linear map ...