Many existing algorithms for streaming geometric data analysis have been plagued by
exponential dependencies in the space complexity, which are undesirable for processing …

We give near-optimal algorithms for computing an ellipsoidal rounding of a convex polytope
whose vertices are given in a stream. The approximation factor is linear in the dimension (as …

Efficiently processing time series data streams in real-time on resource-constrained devices
offers significant advantages in terms of enhanced computational energy efficiency and …

We give a faster algorithm for computing an approximate John ellipsoid around $ n $ points
in $ d $ dimensions. The best known prior algorithms are based on repeatedly computing …

We study streaming algorithms for the $\ell_p $ subspace approximation problem. Given
points $ a_1,\ldots, a_n $ as an insertion-only stream and a rank parameter $ k $, the $\ell_p …

In this study, we proposed proximal analytic center cutting plane algorithms for solving
variational inequalities whose domains are normal regions. Our algorithms stop with a …

Given a dynamical system with constrained outputs, the maximal admissible set (MAS) is
defined as the set of all initial conditions such that the output constraints are satisfied for all …

The approximation of matrices by smaller, simpler, or structured matrices is a fundamental
problem in various fields of mathematics and computer science including numerical linear …

Sketching refers to a wide variety of techniques to compress large datasets into much
smaller forms that can be efficiently processed to answer questions about the original …