93 citations · 322 across the 31 of their papers we have counts for
5 papers · 1 filter
Amenable cones are particularly nice
Bruno F. Lourenço, Vera Roshchina, James Saunderson
Amenability is a geometric property of convex cones that is stronger than facial exposedness and assists in the study of error bounds for conic feasibility problems. In this paper…
Terracini Convexity
James Saunderson, Venkat Chandrasekaran
We present a generalization of the notion of neighborliness to non-polyhedral convex cones. Although a definition of neighborliness is available in the non-polyhedral case in the l…
Memory-efficient structured convex optimization via extreme point sampling
Nimita Shinde, Vishnu Narayanan, James Saunderson
Memory is a key computational bottleneck when solving large-scale convex optimization problems such as semidefinite programs (SDPs). In this paper, we focus on the regime in which…
Lifting for Simplicity: Concise Descriptions of Convex Sets
Hamza Fawzi, João Gouveia, Pablo A. Parrilo +2
This paper presents a selected tour through the theory and applications of lifts of convex sets. A lift of a convex set is a higher-dimensional convex set that projects onto the or…
Spectral Polyhedra
Raman Sanyal, James Saunderson
A "spectral convex set" is a collection of symmetric matrices whose range of eigenvalues form a symmetric convex set. Spectral convex sets generalize the Schur-Horn orbitopes studi…