Gábor Pataki

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 12

Top Topics

Exponential Size

Prime Implicates

Top Venues

Found. Comput. Math.

Publications

Gábor Pataki, Aleksandr Touzov
An Echelon Form of Weakly Infeasible Semidefinite Programs and Bad Projections of the psd Cone. Found. Comput. Math. 24 (2) (2024)
Gábor Pataki, Aleksandr Touzov
How Do Exponential Size Solutions Arise in Semidefinite Programming? SIAM J. Optim. 34 (1) (2024)
Bruno F. Lourenço, Gábor Pataki
A simplified treatment of Ramana's exact dual for semidefinite programming. Optim. Lett. 17 (2) (2023)
Bruno F. Lourenço, Gábor Pataki
A Simplified Treatment of Ramana's Exact Dual for Semidefinite Programming. CoRR (2022)
Gábor Pataki, Aleksandr Touzov
How do exponential size solutions arise in semidefinite programming? CoRR (2021)
Gábor Pataki, Aleksandr Touzov
An echelon form of weakly infeasible semidefinite programs and bad projections of the psd cone. CoRR (2021)
Yuzixuan Zhu, Gábor Pataki, Quoc Tran-Dinh
Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs. Math. Program. Comput. 11 (3) (2019)
Gábor Pataki
Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs. SIAM Rev. 61 (4) (2019)
Minghui Liu, Gábor Pataki
Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming. Math. Program. 167 (2) (2018)
Gábor Pataki
Bad Semidefinite Programs: They All Look the Same. SIAM J. Optim. 27 (1) (2017)
Minghui Liu, Gábor Pataki
Exact Duality in Semidefinite Programming Based on Elementary Reformulations. SIAM J. Optim. 25 (3) (2015)
Dmitriy Drusvyatskiy, Gábor Pataki, Henry Wolkowicz
Coordinate Shadows of Semidefinite and Euclidean Distance Matrices. SIAM J. Optim. 25 (2) (2015)
Gábor Pataki, Mustafa Kemal Tural, Erick B. Wong
Basis Reduction and the Complexity of Brand-and-Bound. SODA (2010)
Gábor Pataki, Mustafa Kemal Tural
Basis Reduction, and the Complexity of Branch-and-Bound CoRR (2009)
Bala Krishnamoorthy, Gábor Pataki
Column basis reduction and decomposable knapsack problems. Discret. Optim. 6 (3) (2009)
Gábor Pataki, Mustafa Kemal Tural
Branching proofs of infeasibility in low density subset sum problems CoRR (2008)
Gábor Pataki
On the Closedness of the Linear Image of a Closed Convex Cone. Math. Oper. Res. 32 (2) (2007)
Srinagesh Gavirneni, Lloyd Clark, Gábor Pataki
Schlumberger Optimizes Receiver Location for Automated Meter Reading. Interfaces 34 (3) (2004)
Gábor Pataki
Teaching Integer Programming Formulations Using the Traveling Salesman Problem. SIAM Rev. 45 (1) (2003)
Gábor Pataki, Levent Tunçel
On the generic properties of convex optimization problems in conic form. Math. Program. 89 (3) (2001)
Egon Balas, Sebastián Ceria, Milind Dawande, François Margot, Gábor Pataki
Octane: A New Heuristic for Pure 0-1 Programs. Oper. Res. 49 (2) (2001)
Gábor Pataki
On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues. Math. Oper. Res. 23 (2) (1998)
Sebastián Ceria, Gábor Pataki
Solving Integer and Disjunctive Programs by Lift and Project. IPCO (1998)
Gábor Pataki
Cone-LP's and Semidefinite Programs: Geometry. IPCO (1996)
Egon Balas, Sebastián Ceria, Gérard Cornuéjols, Gábor Pataki
Polyhedral methods for the maximum clique problem. Cliques, Coloring, and Satisfiability (1993)