Fetching the paper…
Reading the bibliography…
We provide a new hierarchy of semidefinite programming relaxations, called NCTSSOS, to solve large-scale sparse noncommutative polynomial optimization problems.
Extremal psd forms with few terms
Bruce Reznick et al · 1978
Earlier work this paper cites.
An introduction to chordal graphs and clique trees
Jean RS Blair and Barry Peyton · 1993
Earlier work this paper cites.
Positive polynomials on compact semi-algebraic sets
Mihai Putinar · 1993
Earlier work this paper cites.
A unified algebraic approach to control design
Robert E Skelton, Tetsuya Iwasaki, and Dimitri E Grigoriadis · 1997
Earlier work this paper cites.
Global Optimization with Polynomials and the Problem of Moments
J.-B. Lasserre · 2001
Earlier work this paper cites.
“positive” noncommutative polynomials are sums of squares
J William Helton · 2002
Earlier work this paper cites.
Theory of operator algebras. III
Masamichi Takesaki · 2003
Earlier work this paper cites.
A positivstellensatz for non-commutative polynomials
J Helton and Scott McCullough · 2004
Earlier work this paper cites.
A Positivstellensatz for non-commutative polynomials
J. William Helton and Scott A. McCullough · 2004
Earlier work this paper cites.
Convergent sdp-relaxations in polynomial optimization with sparsity
J.-B. Lasserre · 2006
Earlier work this paper cites.
Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity
H. Waki, S. Kim, M. Kojima, and M. Muramatsu · 2006
Earlier work this paper cites.
A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
Miguel Navascués, Stefano Pironio, and Antonio Acín · 2008
Earlier work this paper cites.
Algorithm 883: Sparsepop—a sparse semidefinite programming relaxation of polynomial optimization problems
Hayato Waki, Sunyoung Kim, Masakazu Kojima, Masakazu Muramatsu, and Hiroshi Sugimoto · 2008
Earlier work this paper cites.
Sums of squares, moment matrices and optimization over polynomials
Monique Laurent · 2009
Earlier work this paper cites.
Quantum bounds on bell inequalities
Károly F Pál and Tamás Vértesi · 2009
Earlier work this paper cites.
Treewidth computations i. upper bounds
Hans L Bodlaender and Arie MCA Koster · 2010
Earlier work this paper cites.
Convergent relaxations of polynomial optimization problems with noncommuting variables
Stefano Pironio, Miguel Navascués, and Antonio Acín · 2010
Earlier work this paper cites.
Convergent relaxations of polynomial optimization problems with noncommuting variables
Stefano Pironio, Miguel Navascués, and Antonio Acin · 2010
Cited alongside, same era.
Handbook on semidefinite, conic and polynomial optimization
Miguel F. Anjos and Jean B. Lasserre, editors · 2012
Cited alongside, same era.
Constrained polynomial optimization problems with noncommuting variables
Kristijan Cafuta, Igor Klep, and Janez Povh · 2012
Cited alongside, same era.
The tracial moment problem and trace-optimization of polynomials
Sabine Burgdorf, Kristijan Cafuta, Igor Klep, and Janez Povh · 2013
Cited alongside, same era.
Chordal graphs and semidefinite optimization
Lieven Vandenberghe, Martin S Andersen, et al · 2015
Cited alongside, same era.
Minimizing the sum of many rational functions
Florian Bugarin, Didier Henrion, and Jean Bernard Lasserre · 2016
Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
Sander Gribling, David De Laat, and Monique Laurent · 2019
Later among the works it cites.
Sparse noncommutative polynomial optimization
Igor Klep, Victor Magron, and Janez Povh · 2019
Later among the works it cites.
Exploiting Sparsity for Semi-Algebraic Set Volume Computation
M. Tacchi, T. Weisser, J.-B. Lasserre, and D. Henrion · 2019
Later among the works it cites.
A new sparse sos decomposition algorithm based on term sparsity
Jie Wang, Haokun Li, and Bican Xia · 2019
Later among the works it cites.
TSSOS: A Moment-SOS hierarchy that exploits term sparsity
Jie Wang, Victor Magron, and Jean-Bernard Lasserre · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Optimization of polynomials in non-commuting variables
Sabine Burgdorf, Igor Klep, and Janez Povh · 2016
Cited alongside, same era.
Optimization of polynomials in non-commuting variables
Sabine Burgdorf, Igor Klep, and Janez Povh · 2016
Cited alongside, same era.
Strong duality in lasserre’s hierarchy for polynomial optimization
Cédric Josz and Didier Henrion · 2016
Cited alongside, same era.
The MOSEK optimization toolbox. Version 8.1
MOSEK ApS · 2017
Cited alongside, same era.
Julia: A fresh approach to numerical computing
Jeff Bezanson, Alan Edelman, Stefan Karpinski, and Viral B Shah · 2017
Cited alongside, same era.
Juliagraphs/lightgraphs.jl: an optimized graphs package for the julia programming language, 2017
Seth Bromberger, James Fairbanks, and other contributors · 2017
Cited alongside, same era.
Scalable semidefinite programming
Alp Yurtsever, Joel A Tropp, Olivier Fercoq, Madeleine Udell, and Volkan Cevher · 2019
Later among the works it cites.
Polynomial optimization for bounding lipschitz constants of deep networks
Tong Chen, Jean-Bernard Lasserre, Victor Magron, and Edouard Pauwels · 2020
Closest in time.
Optimization over trace polynomials
Igor Klep, Victor Magron, and Jurij Volčič · 2020
Closest in time.
A sparse version of reznick’s positivstellensatz
Ngoc Hoang Anh Mai, Victor Magron, and J-B Lasserre · 2020
Closest in time.
A hierarchy of spectral relaxations for polynomial optimization
Ngoc Hoang Anh Mai, Victor Magron, and Jean-Bernard Lasserre · 2020
Closest in time.
Quantum optimal control via magnus expansion: The non-commutative polynomial optimization problem
Jakub Marecek and Jiri Vala · 2020
Closest in time.
ChordalGraph: A Julia Package to Handle Chordal Graphs
Jie Wang · 2020
Closest in time.
SparseJSR: A Fast Algorithm to Compute Joint Spectral Radius via Sparse SOS Decompositions
Jie Wang, Martina Maggio, and Victor Magron · 2020
Closest in time.
Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
Jie Wang, Victor Magron, and Jean-Bernard Lasserre · 2020
Closest in time.
CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimization
Jie Wang, Victor Magron, Jean-Bernard Lasserre, and Ngoc Hoang Anh Mai · 2020
Closest in time.
Proper learning of linear dynamical systems as a non-commutative polynomial optimisation problem
Quan Zhou and Jakub Marecek · 2020
Closest in time.
Fairness in forecasting and learning linear dynamical systems
Quan Zhou, Jakub Marecek, and Robert N Shorten · 2020
Closest in time.