Combinatorial and Geometric Structures, Convex Optimization leading to Matrix Recovery, Efficient Combinatorial Algorithms and Min-Max Theorems

Abstract

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 09, 2018
Accession Number
AD1061286

Entities

People

  • Bertrand Guenin
  • Levent Tunçel

Organizations

  • University of Waterloo

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Applied Mathematics
  • Compressed Sensing
  • Computer Programming
  • Computer Science
  • Computers
  • Convex Programming
  • Convex Sets
  • Evolutionary Algorithms
  • Geometry
  • Integer Programming
  • Integrals
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • North America
  • Operations Research
  • Optimization
  • Polynomials
  • Semidefinite Programming
  • Theorems
  • Triangles
  • Universities

Fields of Study

  • Computer science
  • Engineering

Readers

  • Neural Network Machine Learning.
  • Operations Research