es of circulant matrices. Our class is broader than just circulants, and we study patterned systems using abstract algebra, specifically the observation that a set of matrices with...
The Helly number of a family of sets with empty intersection is the size of its largest inclusionwise minimal sub-family with empty intersection. Let F be a finite family of open...
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
The purpose of this paper is twofold. An immediate practical use of the presented algorithm is its applicability to the parametric solution of underdetermined linear ordinary di...
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...