No article text was recorded for this version.
semidefinite programming scalability (curse of dimensionality in polynomial optimization)
Version 2 of 2323 papers379 conceptsfrozen 2026-10-04
Papers in this version
- Blog: The Saddle Point Problem of Polynomials
- Blog: Sum of Squares Certificates for Stability of Planar, Homogeneous, and Switched Systems
- Blog: Exploiting term sparsity in noncommutative polynomial optimization
- Blog: Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension
- Blog: Exploiting Term Sparsity in Moment-SOS Hierarchy for Dynamical Systems
- Blog: POCP: A package for polynomial optimal control problems
- Blog: Error bounds for polynomial optimization over the hypercube using putinar type representations
- Blog: SOSOPT: A Toolbox for Polynomial Optimization
- Blog: Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets
- Blog: Borel measures with a density on a compact semi-algebraic set
- Blog: A Semidefinite Representation for some Minimum Cardinality Problems
- Blog: SparseJSR: A Fast Algorithm to Compute Joint Spectral Radius via Sparse SOS Decompositions
- Blog: Certifying Unstability of Switched Systems Using Sum of Squares Programming
- Blog: Special Issue: Polynomial and Tensor Optimization
- Blog: On Infinite Linear Programming and the Moment Approach to Deterministic Infinite Horizon Discounted Optimal Control Problems
- Blog: Representation of Chance-Constraints With Strong Asymptotic Guarantees
- Blog: Polynomial Optimization, Certificates of Positivity, and Christoffel Function
- Blog: Sum of squares certificates for stability of planar, homogeneous, and switched systems
- Blog: SOSOPT: A Toolbox for Polynomial Optimization
- Blog: Distributionally robust polynomial chance-constraints under mixture\n ambiguity sets
- Blog: Facial Input Decompositions for Robust Peak and Reachable Set Estimation under Polyhedral Uncertainty
- Blog: Teleoperator Imitation with Continuous-time Safety
- Blog: Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
- Blog: SOStab: a Matlab Toolbox for Approximating Regions of Attraction of Nonlinear Systems
- Blog: A real moment-HSOS hierarchy for complex polynomial optimization with real coefficients
- Blog: A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors
- Blog: Quantum Optimal Control via Magnus Expansion and Non-Commutative Polynomial Optimization
- Blog: Convex relaxations for large-scale graphically structured nonconvex problems with spherical constraints: An optimal transport approach
- Blog: Improving Efficiency and Scalability of Sum of Squares Optimization: Recent Advances and Limitations
- Blog: Hierarchy relaxations for robust equilibrium constrained polynomial problems and applications to electric vehicle charging scheduling
- Blog: TSSOS: A Moment-SOS hierarchy that exploits term sparsity
- Blog: Solving polynomial variational inequality problems via Lagrange multiplier expressions and Moment-SOS relaxations
- Blog: New approximations for the cone of copositive matrices and its dual
- Blog: Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant
- Blog: S.o.s. approximation of polynomials nonnegative on a real algebraic set
- Blog: Positive Forms and Stability of Linear Time-Delay Systems
- Blog: Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems
- Blog: On Polynomial Optimization Over Non-compact Semi-algebraic Sets
- Blog: Alternative SDP and SOCP approximations for polynomial optimization
- Blog: Exploiting Sparsity in Complex Polynomial Optimization
- Blog: Stability and robustness analysis of nonlinear systems via contraction metrics and SOS programming
- Blog: Theory and applications of the Sum-Of-Squares technique
- Blog: Convex Data-Driven Contraction With Riemannian Metrics
- Blog: Tightness and Equivalence of Semidefinite Relaxations for MIMO Detection
- Blog: TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- Blog: A prolongation-projection algorithm for computing the finite real variety of an ideal
- Blog: TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- Blog: Semidefinite descriptions of the convex hull of rotation matrices
- Blog: A bounded degree SOS hierarchy for polynomial optimization
- Blog: On Infinite Linear Programming and the Moment Approach to Deterministic Infinite Horizon Discounted Optimal Control Problems
- Blog: Convex hulls of monomial curves, and a sparse positivstellensatz
- Blog: Inference in Graphical Models via Semidefinite Programming Hierarchies
- Blog: Computer-assisted proofs for Lyapunov stability via Sums of Squares certificates and Constructive Analysis
- Blog: MINLP in transmission expansion planning
- Blog: Approximate Dynamic Programming via Sum of Squares Programming
- Blog: Optimal Hierarchical Signaling for Quadratic Cost Measures and General Distributions: A Copositive Program Characterization
- Blog: Inverse Polynomial Optimization
- Blog: Recovering models of open quantum systems from data via polynomial optimization: Towards globally convergent quantum system identification
- Blog: The non-convex Burer-Monteiro approach works on smooth semidefinite programs
- Blog: On the Construction of Barrier Certificate: A Dynamic Programming Perspective
Showing 60 of 323 papers.
History & citation
Current · Permanent link
- Global Polynomial Optimization via the Moment-SOS Hierarchy merged into this direction (87% overlap)
- Sum of Squares Programming for Nonlinear System Verification merged into this direction (65% overlap)
- real-only root isolation split from this direction (56% overlap)
- occupation measure reformulation split from this direction (58% overlap)
- polynomial non-negativity verification split from this direction (69% overlap)
- automated stability certification split from this direction (53% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_semidefinite_programming_scalability_cur_304e0d31,
title = {semidefinite programming scalability (curse of dimensionality in polynomial optimization)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/semidefinite-programming-scalability-curse-of-dimensionality-in-polynomial/rdr_304e0d31470546009fe96b017e520eeb},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_semidefinite_programming_scalability_cur_304e0d31_v2,
title = {semidefinite programming scalability (curse of dimensionality in polynomial optimization)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/semidefinite-programming-scalability-curse-of-dimensionality-in-polynomial/rdr_304e0d31470546009fe96b017e520eeb/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}