Combinatorial and Geometric Structures, Convex Optimization leading to Matrix Recovery, Efficient Combinatorial Algorithms and Min-Max Theorems
Technical Report,01 Mar 2015,28 Feb 2018
University of Waterloo Ontario Canada
Pagination or Media Count:
The general context of this research project is that of mathematical optimization continuous and discrete and operations research. It has significant interaction with combinatorics and computational complexity as well as various other fields in mathematical sciences. Specifically, we are designing efficient algorithms to find optimal or near optimal solutions for tractable classes of optimization problems. For problems that are provably hard to solve within any guaranteed bound, our focus is to develop practical heuristics and tools. We also address issues that arise from the nature of the way the data is collected in practice, such as robustness of algorithms under uncertain data, and hidden low dimensional information in high dimensional data.
- Theoretical Mathematics
- Operations Research