Gábor Pataki

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