<h1>Parrilo, Pablo A.</h1> <h2>Combined from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2> <ul> <li>Saunderson, J. and Chandrasekaran, V., el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20121004-133456681">Diagonal and Low-Rank Matrix Decompositions, Correlation Matrices, and Ellipsoid Fitting</a>; SIAM Journal on Matrix Analysis and Applications; Vol. 33; No. 4; 1395-1416; <a href="https://doi.org/10.1137/120872516">10.1137/120872516</a></li> <li>Chandrasekaran, Venkat and Recht, Benjamin, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20121004-152325296">The Convex Geometry of Linear Inverse Problems</a>; Foundations of Computational Mathematics; Vol. 12; No. 6; 805-849; <a href="https://doi.org/10.1007/s10208-012-9135-7">10.1007/s10208-012-9135-7</a></li> <li>Chandrasekaran, Venkat and Parrilo, Pablo A., el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130110-100237034">Convex Graph Invariants</a>; SIAM Review; Vol. 54; No. 3; 513-541; <a href="https://doi.org/10.1137/100816900">10.1137/100816900</a></li> <li>Chandrasekaran, Venkat and Parrilo, Pablo A., el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130207-085454891">Latent Variable Graphical Model Selection via Convex Optimization</a>; Annals of Statistics; Vol. 40; No. 4; 1935-1967; <a href="https://doi.org/10.1214/11-AOS949">10.1214/11-AOS949</a></li> <li>Chandrasekaran, Venkat and Parrilo, Pablo A., el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130205-141004858">Rejoinder: Latent variable graphical model selection via convex optimization</a>; Annals of Statistics; Vol. 40; No. 4; 2005-2013; <a href="https://doi.org/10.1214/12-AOS1020">10.1214/12-AOS1020</a></li> <li>Chandrasekaran, Venkat and Sanghavi, Sujay, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20121008-095909823">Rank-Sparsity Incoherence for Matrix Decomposition</a>; SIAM Journal of Optimization; Vol. 21; No. 2; 572-596; <a href="https://doi.org/10.1137/090761793">10.1137/090761793</a></li> <li>Chandrasekaran, Venkat and Sanghavi, Sujay, el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20121008-082643123">Sparse and low-rank matrix decompositions</a>; ISBN 978-1-4244-5870-7; Forty-Seventh annual Allerton Conference on Communication, Control, and Computing; 962-967; <a href="https://doi.org/10.1109/ALLERTON.2009.5394889">10.1109/ALLERTON.2009.5394889</a></li> <li>Fazel, M. and Candès, E., el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170411-162244274">Compressed sensing and robust recovery of low rank matrices</a>; ISBN 978-1-4244-2940-0; 42nd Asilomar Conference on Signals, Systems and Computers; 1043-1047; <a href="https://doi.org/10.1109/ACSSC.2008.5074571">10.1109/ACSSC.2008.5074571</a></li> <li>Boyd, Stephen and Diaconis, Persi, el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110602-133842599">Symmetry Analysis of Reversible Markov Chains</a>; Internet Mathematics; Vol. 2; No. 1; 31-71; <a href="https://doi.org/10.1080/15427951.2005.10129100">10.1080/15427951.2005.10129100</a></li> <li>Childs, Andrew M. and Landahl, Andrew J., el al. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150331-150443251">Finding quantum algorithms via convex optimization</a>; ISBN 978-3-9524173-8-6; 2007 European Control Conference (ECC); 854-859</li> <li>Tarraf, Danielle C. and Parrilo, Pablo A. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20101013-121426898">Solving Commutative Relaxations of Word Problems</a>; ISBN 978-1-4244-1497-0; 46th IEEE Conference on Decision and Control; 5575-5580; <a href="https://doi.org/10.1109/CDC.2007.4435013">10.1109/CDC.2007.4435013</a></li> <li>Doherty, Andrew C. and Spedalieri, Federico M., el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:DOHpra05">Detecting multipartite entanglement</a>; Physical Review A; Vol. 71; No. 3; Art. No. 032333; <a href="https://doi.org/10.1103/PhysRevA.71.032333">10.1103/PhysRevA.71.032333</a></li> <li>Prajna, Stephen and Papachristodoulou, Antonis, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200330-073159726">SOSTOOLS and Its Control Applications</a>; ISBN 978-3-540-23948-2; Positive Polynomials in Control; 273-292; <a href="https://doi.org/10.1007/10997703_14">10.1007/10997703_14</a></li> <li>Prajna, Stephen and Papachristodoulou, Antonis, el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111012-135901478">SOSTOOLS: control applications and new developments</a>; ISBN 0-7803-8636-1; 2004 IEEE International Symposium on Computer-Aided Control System Design; 315-320; <a href="https://doi.org/10.1109/CACSD.2004.1393895">10.1109/CACSD.2004.1393895</a></li> <li>Prajna, Stephen and Papachristodoulou, Antonis, el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110824-111502553">New developments in sum of squares optimization and SOSTOOLS</a>; ISBN 0-7803-8335-4; Proceedings of the 2004 American Control Conference; 5606-5611</li> <li>Doherty, Andrew C. and Parrilo, Pablo A., el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:DOHpra04">Complete family of separability criteria</a>; Physical Review A; Vol. 69; No. 2; Art. No. 022308; <a href="https://doi.org/10.1103/PhysRevA.69.022308">10.1103/PhysRevA.69.022308</a></li> <li>Prajna, Stephen and Parrilo, Pablo A., el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:PRAieeetac04">Nonlinear control synthesis by convex optimization</a>; IEEE Transactions on Automatic Control; Vol. 49; No. 2; 310-314; <a href="https://doi.org/10.1109/TAC.2003.823000">10.1109/TAC.2003.823000</a></li> <li>Parrilo, Pablo A. (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200324-151107160">Semidefinite programming relaxations for semialgebraic problems</a>; Mathematical Programming; Vol. 96; No. 2; 293-320; <a href="https://doi.org/10.1007/s10107-003-0387-5">10.1007/s10107-003-0387-5</a></li> <li>Prajna, Stephen and Papachristodoulou, Antonis, el al. (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111109-140347153">Introducing SOSTOOLS: A General Purpose Sum of Squares Programming Solver</a>; ISBN 0-7803-7516-5; Proceedings of the 41st IEEE Conference on Decision and Control; 741-746; <a href="https://doi.org/10.1109/CDC.2002.1184594">10.1109/CDC.2002.1184594</a></li> <li>Vargas, Andras and Parrilo, Pablo (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:VARcdc01">Fast algorithms for solving H∞-norm minimization problems</a>; ISBN 0-7803-7061-9; Proceedings of the 40th IEEE Conference on Decision and Control, December 4-7, 2001, Hyatt Regency Grand Cypress, Orlando, Florida, USA; 261-266; <a href="https://doi.org/10.1109/.2001.980109">10.1109/.2001.980109</a></li> <li>Doherty, A. C. and Parrilo, Pablo A., el al. (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:DOHprl02">Distinguishing Separable and Entangled States</a>; Physical Review Letters; Vol. 88; No. 18; Art. No. 187904; <a href="https://doi.org/10.1103/PhysRevLett.88.187904">10.1103/PhysRevLett.88.187904</a></li> <li>Parrilo, Pablo A. and Lall, Sanjay, el al. (1999) <a href="https://resolver.caltech.edu/CaltechAUTHORS:PARacc99">Model reduction for analysis of cascading failures in power systems</a>; ISBN 0-7803-4990-3; American Control Conference, 1999. San Diego, CA, 2-4 June 1999; 4208-4212; <a href="https://doi.org/10.1109/ACC.1999.786351">10.1109/ACC.1999.786351</a></li> </ul>