Mathematics of primal-dual algorithms for large-scale optimization, combinatorial and geometric structures, min-max theorems
Abstract
The general context of this research proposal is that of mathematical optimization (continuous and discrete) andoperations research. It has significant interaction with combinatorics and computational complexity as well as variousother fields in mathematical sci"ences. In particular, we focus on fundamental problems whose solutions will lead to stronger techniques for proving optimality or ne""ar-optimality of solutions to large-scale optimization problems. Commonthemes in our approaches include convex relaxations, duality"" theory, min-max theorems, identification of obstructions to good behavior in optimization problems. The project has five modules:1"". Mathematics of primal-dual algorithms for large-scale convex optimization.2. Convex representations, boundary structure of convex" sets.3. Mixed integer programming.4. Minimax relations.5. Even-cycle and even-cut matroids.
Document Details
- Document Type
- DoD Grant Award
- Publication Date
- Jan 23, 2018
- Source ID
- N000141812078
Entities
People
- Levent Tunçel
Organizations
- Office of Naval Research
- United States Navy
- University of Waterloo