default search action
James Saunderson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j23]Bruno F. Lourenço, Vera Roshchina
, James Saunderson
Hyperbolicity cones are amenable. Math. Program. 204(1): 753-764 (2024) - [j22]Brendon McBain
Information Rates of the Noisy Nanopore Channel. IEEE Trans. Inf. Theory 70(8): 5640-5652 (2024) - [j21]Kerry He
A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms. IEEE Trans. Inf. Theory 70(8): 5710-5730 (2024) - [c17]Brendon McBain, James Saunderson, Emanuele Viterbo:
On Noisy Duplication Channels with Markov Sources. ISIT 2024: 3438-3443 - [i9]Brendon McBain, James Saunderson, Emanuele Viterbo:
On noisy duplication channels with Markov sources. CoRR abs/2405.05555 (2024) - [i8]Kerry He, James Saunderson, Hamza Fawzi:
Exploiting Structure in Quantum Relative Entropy Programs. CoRR abs/2407.00241 (2024) - [i7]Shuvayan Banerjee, Radhendushka Srivastava, James Saunderson, Ajit Rajwade:
Robust Non-adaptive Group Testing under Errors in Group Membership Specifications. CoRR abs/2409.05345 (2024) - 2023
- [j20]Alex Tritt
Spinsim: A GPU optimized python package for simulating spin-half and spin-one quantum systems. Comput. Phys. Commun. 287: 108701 (2023) - [j19]James Saunderson
A Convex Form That Is Not a Sum of Squares. Math. Oper. Res. 48(1): 569-582 (2023) - [j18]James Saunderson
Terracini convexity. Math. Program. 198(1): 399-441 (2023) - [j17]Hamza Fawzi, James Saunderson
Optimal Self-Concordant Barriers for Quantum Relative Entropies. SIAM J. Optim. 33(4): 2858-2884 (2023) - [c16]Oisin Faust, Hamza Fawzi, James Saunderson:
A Bregman Divergence View on the Difference-of-Convex Algorithm. AISTATS 2023: 3427-3439 - [c15]Chi Bach Pham
A Scalable Frank-Wolfe-Based Algorithm for the Max-Cut SDP. ICML 2023: 27822-27839 - [c14]Brendon McBain, Emanuele Viterbo, James Saunderson:
Homophonic Coding for the Noisy Nanopore Channel with Constrained Markov Sources. ISIT 2023: 376-381 - [i6]Kerry He, James Saunderson, Hamza Fawzi:
A Mirror Descent Perspective on Classical and Quantum Blahut-Arimoto Algorithms. CoRR abs/2306.04492 (2023) - [i5]Kerry He, James Saunderson, Hamza Fawzi:
Efficient Computation of the Quantum Rate-Distortion Function. CoRR abs/2309.15919 (2023) - 2022
- [j16]Bruno F. Lourenço, Vera Roshchina
Amenable Cones Are Particularly Nice. SIAM J. Optim. 32(3): 2347-2375 (2022) - [j15]Hamza Fawzi
Lifting for Simplicity: Concise Descriptions of Convex Sets. SIAM Rev. 64(4): 866-918 (2022) - [c13]Brendon McBain
Finite-State Semi-Markov Channels for Nanopore Sequencing. ISIT 2022: 216-221 - [i4]Brendon McBain, Emanuele Viterbo, James Saunderson:
Finite-State Semi-Markov Channels for Nanopore Sequencing. CoRR abs/2205.04187 (2022) - 2021
- [j14]Nimita Shinde, Vishnu Narayanan, James Saunderson
Memory-Efficient Structured Convex Optimization via Extreme Point Sampling. SIAM J. Math. Data Sci. 3(3): 787-814 (2021) - [c12]Nimita Shinde, Vishnu Narayanan, James Saunderson:
Memory-Efficient Approximation Algorithms for Max-k-Cut and Correlation Clustering. NeurIPS 2021: 8269-8281 - 2020
- [j13]James Saunderson
Limitations on the Expressive Power of Convex Cones without Long Chains of Faces. SIAM J. Optim. 30(1): 1033-1047 (2020)
2010 – 2019
- 2019
- [j12]Hamza Fawzi, James Saunderson
Semidefinite Approximations of the Matrix Logarithm. Found. Comput. Math. 19(2): 259-296 (2019) - [j11]James Saunderson
Certifying Polynomial Nonnegativity via Hyperbolic Optimization. SIAM J. Appl. Algebra Geom. 3(4): 661-690 (2019) - [j10]Nate Veldt
Metric-Constrained Optimization for Graph Clustering Algorithms. SIAM J. Math. Data Sci. 1(2): 333-355 (2019) - 2018
- [j9]Annie Raymond
Symmetric sums of squares over k-subset hypercubes. Math. Program. 167(2): 315-354 (2018) - [j8]Reza Eghbali, James Saunderson
Competitive online algorithms for resource allocation over the positive semidefinite cone. Math. Program. 170(1): 267-292 (2018) - [j7]James Saunderson
A spectrahedral representation of the first derivative relaxation of the positive semidefinite cone. Optim. Lett. 12(7): 1475-1486 (2018) - [i3]Reza Eghbali, James Saunderson, Maryam Fazel:
Competitive Online Algorithms for Resource Allocation over the Positive Semidefinite Cone. CoRR abs/1802.01312 (2018) - [i2]Nate Veldt, David F. Gleich, Anthony Wirth, James Saunderson:
A Projection Method for Metric-Constrained Optimization. CoRR abs/1806.01678 (2018) - 2017
- [j6]Hamza Fawzi, James Saunderson
Equivariant Semidefinite Lifts of Regular Polygons. Math. Oper. Res. 42(2): 472-494 (2017) - [c11]Amir Ali Ahmadi, Georgina Hall, Antonis Papachristodoulou
Improving efficiency and scalability of sum of squares optimization: Recent advances and limitations. CDC 2017: 453-462 - [c10]Amin Jalali, James Saunderson
Error bounds for Bregman denoising and structured natural parameter estimation. ISIT 2017: 2273-2277 - 2016
- [j5]Hamza Fawzi, James Saunderson
Sparse sums of squares on finite abelian groups and improved semidefinite lifts. Math. Program. 160(1-2): 149-191 (2016) - [c9]Kishore Jaganathan, James Saunderson
Phaseless super-resolution using masks. ICASSP 2016: 4039-4043 - [c8]James Saunderson
Simple algorithms and guarantees for low rank matrix completion over F2. ISIT 2016: 86-90 - 2015
- [b1]James Saunderson:
Semidenite representations with applications in estimation and inference. Massachusetts Institute of Technology, Cambridge, MA, USA, 2015 - [j4]James Saunderson
Polynomial-sized semidefinite representations of derivative relaxations of spectrahedral cones. Math. Program. 153(2): 309-331 (2015) - [j3]James Saunderson
Semidefinite Descriptions of the Convex Hull of Rotation Matrices. SIAM J. Optim. 25(3): 1314-1343 (2015) - [j2]Hamza Fawzi, James Saunderson
Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies. SIAM J. Optim. 25(4): 2212-2243 (2015) - [c7]Hamza Fawzi, James Saunderson
Sparse sum-of-squares certificates on finite abelian groups. CDC 2015: 5909-5914 - 2014
- [c6]James Saunderson
Semidefinite relaxations for optimization problems over rotation matrices. CDC 2014: 160-166 - [i1]Hamza Fawzi, James Saunderson
Equivariant semidefinite lifts of regular polygons. CoRR abs/1409.4379 (2014) - 2013
- [c5]James Saunderson
Diagonal and low-rank decompositions and fitting ellipsoids to random points. CDC 2013: 6031-6036 - [c4]Matthew J. Johnson, James Saunderson, Alan S. Willsky:
Analyzing Hogwild Parallel Gaussian Gibbs Sampling. NIPS 2013: 2715-2723 - 2012
- [j1]James Saunderson
Diagonal and Low-Rank Matrix Decompositions, Correlation Matrices, and Ellipsoid Fitting. SIAM J. Matrix Anal. Appl. 33(4): 1395-1416 (2012) - 2011
- [c3]James Saunderson
Tree-structured statistical modeling via convex optimization. CDC/ECC 2011: 2883-2888
2000 – 2009
- 2008
- [c2]Tom Coleman, James Saunderson
A Local-Search 2-Approximation for 2-Correlation-Clustering. ESA 2008: 308-319 - [c1]Tom Coleman, James Saunderson
Spectral clustering with inconsistent advice. ICML 2008: 152-159
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 2024-10-22 20:15 CEST 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: