Gabor Pataki: research interests, selected papers, and talks
My research is in convex, and integer programming, and applications of optimization. This page contains selected publications, and corresponding talks.
 Exact duals and short certificatees of infeasibility
and weak infeasibility in conic linear programming , M. Liu, G. Pataki,
submitted
 Exact duality in semidefinite programming based on elementary reformulations , M. Liu, G. Pataki,
SIAM Journal on Optimization, to appear
 Bad semidefinite programs: they all look the same , G. Pataki, Revised: July 2014

On the Closedness of the Linear Image of a Closed Convex Cone , G. Pataki
Mathematics of Operations Research. Vol 32 (2), 395412, 2007
 The Geometry of ConeLP's, G. Pataki,
in H. Wolkowicz, L. Vandenberghe and R. Saigal, ed.: The Handbook of Semidefinite Programming, Kluwer, 2000
 On the Rank of Extreme Matrices in Semidefinite Programs and the
Multiplicity of Optimal Eigenvalues, G. Pataki
Mathematics of Operations Research, 23 (2), 339358, 1998
 Basis Reduction, and the Complexity of BranchandBound, G. Pataki, M. Tural, E. B. Wong
2010 ACMSIAM Symposium on Discrete Algorithms (SODA 10)
 Column Basis Reduction and Decomposable Knapsack Problems, B. Krishnamoorthy and G. Pataki,
Discrete Optimization, 6(3), August 2009, 242270
 Solving the seymour problem, M. C. Ferris, G. Pataki and S. Schmieta
Optima, 66:17, 2001.