Projects
- Scaling up MINLPs via Branch-and-Bound and First Order Methods with applications to Structured Statistical Learning (Funded by Office of Naval Research).
- Improving Branch-and-Bound Algorithms for MILPs (Funded by Airforce Office of Scientific Research).
- General Framework for AI-Accelerated Power Systems Optimization (Funded by Argonne National Lab).
- SECURE–An Evidence-Based Approach for Cybersecurity(Funded by Sandia National Lab).
- Convexification of sub-structures for Quadratically Constrained Quadratic Programs (Funded by Office of Naval Research).
- Sparse Integer Programming (Funded by National Science Foundation). [link]
- Eager: Discrete Optimization Algorithms for 21st Century Algorithms (Funded by National Science Foundation). [link]
- CAREER: Non-traditional Cutting-Plane Algorithms for Mixed-Integer Programs (Funded by National Science Foundation). [link]
- Selective Optimization (Funded by Airforce Offce of Scientific Research). [link]
- Collaborative Research: Fundamentals of Convex Mixed Integer Nonlinear Programming (Funded by National Science Foundation). [link]
- Large Scale Mixed Integer Nonlinear Programming under Uncertainty Agency (Funded by Exxon-Mobil Research and Engineering).