default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGábor Pataki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]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): 347-384 (2024)- [j15]Gábor Pataki, Aleksandr Touzov:
How Do Exponential Size Solutions Arise in Semidefinite Programming? SIAM J. Optim. 34(1): 977-1005 (2024) - 2023
- [j14]Bruno F. Lourenço, Gábor Pataki
:
A simplified treatment of Ramana's exact dual for semidefinite programming. Optim. Lett. 17(2): 219-243 (2023) - 2022
- [i5]Bruno F. Lourenço, Gábor Pataki:
A Simplified Treatment of Ramana's Exact Dual for Semidefinite Programming. CoRR abs/2205.13596 (2022) - 2021
- [i4]Gábor Pataki, Aleksandr Touzov:
How do exponential size solutions arise in semidefinite programming? CoRR abs/2103.00041 (2021) - [i3]Gábor Pataki, Aleksandr Touzov:
An echelon form of weakly infeasible semidefinite programs and bad projections of the psd cone. CoRR abs/2110.11437 (2021)
2010 – 2019
- 2019
- [j13]Yuzixuan Zhu, Gábor Pataki, Quoc Tran-Dinh:
Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs. Math. Program. Comput. 11(3): 503-586 (2019) - [j12]Gábor Pataki:
Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs. SIAM Rev. 61(4): 839-859 (2019) - 2018
- [j11]Minghui Liu, Gábor Pataki:
Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming. Math. Program. 167(2): 435-480 (2018) - 2017
- [j10]Gábor Pataki:
Bad Semidefinite Programs: They All Look the Same. SIAM J. Optim. 27(1): 146-172 (2017) - 2015
- [j9]Dmitriy Drusvyatskiy, Gábor Pataki, Henry Wolkowicz:
Coordinate Shadows of Semidefinite and Euclidean Distance Matrices. SIAM J. Optim. 25(2): 1160-1178 (2015) - [j8]Minghui Liu, Gábor Pataki:
Exact Duality in Semidefinite Programming Based on Elementary Reformulations. SIAM J. Optim. 25(3): 1441-1454 (2015) - 2010
- [c4]Gábor Pataki, Mustafa Kemal Tural, Erick B. Wong:
Basis Reduction and the Complexity of Brand-and-Bound. SODA 2010: 1254-1261
2000 – 2009
- 2009
- [j7]Bala Krishnamoorthy, Gábor Pataki:
Column basis reduction and decomposable knapsack problems. Discret. Optim. 6(3): 242-270 (2009) - [i2]Gábor Pataki, Mustafa Kemal Tural:
Basis Reduction, and the Complexity of Branch-and-Bound. CoRR abs/0907.2639 (2009) - 2008
- [i1]Gábor Pataki, Mustafa Kemal Tural:
Branching proofs of infeasibility in low density subset sum problems. CoRR abs/0808.0023 (2008) - 2007
- [j6]Gábor Pataki:
On the Closedness of the Linear Image of a Closed Convex Cone. Math. Oper. Res. 32(2): 395-412 (2007) - 2004
- [j5]Srinagesh Gavirneni, Lloyd Clark, Gábor Pataki:
Schlumberger Optimizes Receiver Location for Automated Meter Reading. Interfaces 34(3): 208-214 (2004) - 2003
- [j4]Gábor Pataki:
Teaching Integer Programming Formulations Using the Traveling Salesman Problem. SIAM Rev. 45(1): 116-123 (2003) - 2001
- [j3]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): 207-225 (2001) - [j2]Gábor Pataki, Levent Tunçel:
On the generic properties of convex optimization problems in conic form. Math. Program. 89(3): 449-457 (2001)
1990 – 1999
- 1998
- [j1]Gábor Pataki:
On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues. Math. Oper. Res. 23(2): 339-358 (1998) - [c3]Sebastián Ceria, Gábor Pataki:
Solving Integer and Disjunctive Programs by Lift and Project. IPCO 1998: 271-283 - 1996
- [c2]Gábor Pataki:
Cone-LP's and Semidefinite Programs: Geometry. IPCO 1996: 162-174 - 1993
- [c1]Egon Balas, Sebastián Ceria, Gérard Cornuéjols, Gábor Pataki:
Polyhedral methods for the maximum clique problem. Cliques, Coloring, and Satisfiability 1993: 11-28
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
