| Publication | Date of Publication | Type |
|---|
Distributed accelerated gradient methods with restart under quadratic growth condition
Journal of Global Optimization | 2024-09-17 | Paper |
Exact augmented Lagrangian duality for mixed integer convex optimization
SIAM Journal on Optimization | 2024-05-22 | Paper |
| An Inexact Frank-Wolfe Algorithm for Composite Convex Optimization Involving a Self-Concordant Function | 2023-10-22 | Paper |
| A few more Lonely Runners | 2022-11-16 | Paper |
Submodular function minimization and polarity
Mathematical Programming. Series A. Series B | 2022-11-14 | Paper |
Memory-efficient structured convex optimization via extreme point sampling
SIAM Journal on Mathematics of Data Science | 2021-10-05 | Paper |
| Memory-Efficient Approximation Algorithms for Max-k-Cut and Correlation Clustering | 2021-10-02 | Paper |
| On the quality of the $k-$PSD closure approximation | 2021-05-25 | Paper |
Semidefinite Approximation of Closed Convex Set
Decision Science in Action | 2019-01-25 | Paper |
| A scaled conjugate gradient based direct search algorithm for high dimensional box constrained derivative free optimization | 2019-01-16 | Paper |
Intersection cuts for convex mixed integer programs from translated cones
Discrete Optimization | 2018-05-24 | Paper |
A benders decomposition approach for static data segment location to servers connected by a tree backbone
Operations Research Proceedings | 2017-12-01 | Paper |
Facility location models to locate data in information networks: a literature review
Annals of Operations Research | 2017-03-03 | Paper |
History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence
Computers & Operations Research | 2016-11-17 | Paper |
Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations
Computers & Operations Research | 2016-11-10 | Paper |
Exact approaches for static data segment allocation problem in an information network
Computers & Operations Research | 2016-11-10 | Paper |
Facial Structure and Representation of Integer Hulls of Convex Sets
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
Lifting for conic mixed-integer programming
Mathematical Programming. Series A. Series B | 2011-02-14 | Paper |
Conic mixed-integer rounding cuts
Mathematical Programming. Series A. Series B | 2010-02-19 | Paper |
The submodular knapsack polytope
Discrete Optimization | 2009-11-23 | Paper |
Polymatroids and mean-risk minimization in discrete optimization
Operations Research Letters | 2008-11-27 | Paper |
Cuts for Conic Mixed-Integer Programming
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Exact augmented Lagrangian duality for mixed integer convex optimization
(available as arXiv preprint) | N/A | Paper |
An open-source solver for finding global solutions to constrained derivative-free optimization problems
(available as arXiv preprint) | N/A | Paper |
On generators of $k$-PSD closures of the positive semidefinite cone
(available as arXiv preprint) | N/A | Paper |
