{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T07:57:25Z","timestamp":1790495845015,"version":"4.1.0"},"reference-count":46,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2016,5,4]],"date-time":"2016-05-04T00:00:00Z","timestamp":1462320000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["MSPA-MCS 0528414, CCF 0514993, and ITR 0205594"],"award-info":[{"award-number":["MSPA-MCS 0528414, CCF 0514993, and ITR 0205594"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2016,5,4]]},"abstract":"<jats:p>\n                    Semidefinite programs (SDPs) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-known multiplicative weights update rule to symmetric matrices. For a number of problems, such as S\n                    <jats:sc>parsest<\/jats:sc>\n                    C\n                    <jats:sc>ut<\/jats:sc>\n                    and B\n                    <jats:sc>alanced<\/jats:sc>\n                    S\n                    <jats:sc>eparator<\/jats:sc>\n                    in undirected and directed weighted graphs, M\n                    <jats:sc>in<\/jats:sc>\n                    U\n                    <jats:sc>n<\/jats:sc>\n                    C\n                    <jats:sc>ut<\/jats:sc>\n                    and M\n                    <jats:sc>in<\/jats:sc>\n                    2CNF D\n                    <jats:sc>eletion<\/jats:sc>\n                    , this yields combinatorial approximation algorithms that are significantly more efficient than interior point methods. The design of our primal-dual algorithms is guided by a robust analysis of rounding algorithms used to obtain integer solutions from fractional ones. Our ideas have proved useful in quantum computing, especially the recent result of Jain et al. [2011] that QIP = PSPACE.\n                  <\/jats:p>","DOI":"10.1145\/2837020","type":"journal-article","created":{"date-parts":[[2016,5,5]],"date-time":"2016-05-05T09:23:22Z","timestamp":1462440202000},"page":"1-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":39,"title":["A Combinatorial, Primal-Dual Approach to Semidefinite Programs"],"prefix":"10.1145","volume":"63","author":[{"given":"Sanjeev","family":"Arora","sequence":"first","affiliation":[{"name":"Princeton University, Princeton, NJ"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Satyen","family":"Kale","sequence":"additional","affiliation":[{"name":"Princeton University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,5,4]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"106","article-title":"The learnability of quantum states","volume":"13","author":"Aaronson S.","year":"2006","unstructured":"S. Aaronson. 2006. The learnability of quantum states. Electronic Colloquium on Computational Complexity 13, 106.","journal-title":"Electronic Colloquium on Computational Complexity"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00025-4"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060675"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103437"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.985947"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/0805002"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.35"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1958016.1958019"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a006"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250823"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007355"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00231-6"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0553-4"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237827"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","unstructured":"S. Boyd and L. Vandenberghe. 2004. Convex Optimization. Cambridge University Press.","DOI":"10.5555\/993483"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301257"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480199355754"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796457"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","unstructured":"M. X. Goemans and D. P. Williamson. 1997. The primal-dual method for approximation algorithms and its application to network design problems. In Approximation Algorithms for NP-Hard Problems. PWS Publishing Boston MA 144--191.","DOI":"10.5555\/241938.241942"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290181"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRev.137.B1127"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","unstructured":"R. A. Horn and C. R. Johnson. 1990. Matrix Analysis. Cambridge University Press.","DOI":"10.5555\/5509"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/375827.375845"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049697.2049704"},{"key":"e_1_2_1_26_1","unstructured":"S. Kale. 2007. Efficient Algorithms Using the Multiplicative Weights Update Method. Technical Report TR-804-07. Princeton University Princeton NJ."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/331605.331608"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634090"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132574"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237980"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/1070432.1070446"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/1020098"},{"key":"e_1_2_1_33_1","unstructured":"A. Nemirovski and D. B. Yudin. 1983. Problem Complexity and Method Efficiency in Optimization. John Wiley & Sons."},{"key":"e_1_2_1_34_1","volume-title":"Convex Programming: Theory and Applications","author":"Nesterov Y.","year":"1994","unstructured":"Y. Nesterov and A. Nemirovskii. 1994. Interior Point Polynomial Methods in Convex Programming: Theory and Applications. SIAM, Philadelphia, PA."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374442"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185411"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.66"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.36"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/285861.285868"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.1704727"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536452"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/1046920.1088706"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/11776420_38"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.8"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2008.v004a003"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/313651.313689"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837020","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2837020","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2837020","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:44:12Z","timestamp":1763459052000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,4]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,5,4]]}},"alternative-id":["10.1145\/2837020"],"URL":"https:\/\/doi.org\/10.1145\/2837020","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,4]]},"assertion":[{"value":"2013-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-10-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-05-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}