A faster interior-point method for sum-of-squares optimization
From MaRDI portal
Publication:6053475
DOI10.1007/s00453-023-01112-4arXiv2202.08489MaRDI QIDQ6053475
Omri Weinstein, Bento Natura, Shunhua Jiang
Publication date: 27 September 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.08489
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of fixed parameter clique and dominating set
- A new polynomial-time algorithm for linear programming
- Computing approximate Fekete points by QR factorizations of Vandermonde matrices
- Karmarkar's algorithm and its place in applied mathematics
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Semidefinite Approximations of the Polynomial Abscissa
- An Introduction to Polynomial and Semi-Algebraic Optimization
- Computing Multivariate Fekete and Leja Points by Numerical Linear Algebra
- Experimental Study of Energy-Minimizing Point Configurations on Spheres
- Powers of tensors and fast matrix multiplication
- New upper bounds for kissing numbers from semidefinite programming
- Positive polynomials on semi-algebraic sets
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Sum-of-Squares Optimization without Semidefinite Programming
- A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem
- Semidefinite Optimization and Convex Algebraic Geometry
- Optimal Designs for Rational Function Regression
- Sum of Squares: Theory and Applications
- Solving linear programs in the current matrix multiplication time
- Mixture models, robustness, and sum of squares proofs
- Rounding Semidefinite Programming Hierarchies via Global Correlation
This page was built for publication: A faster interior-point method for sum-of-squares optimization
