SPLD polynomial optimization and bounded degree SOS hierarchies
From MaRDI portal
Cites work
- A bounded degree SOS hierarchy for polynomial optimization
- A complete characterization of the gap between convexity and sos-convexity
- A Convex Form That Is Not a Sum of Squares
- A convex polynomial that is not sos-convex
- A dynamic inequality generation scheme for polynomial programming
- A Frank--Wolfe type theorem for convex polynomial programs
- A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
- A well-conditioned estimator for large-dimensional covariance matrices
- Alternative SDP and SOCP approximations for polynomial optimization
- An introduction to polynomial and semi-algebraic optimization
- Anneaux preordonnes
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- Extremal psd forms with few terms
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 193113 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Lasserre hierarchy for large scale polynomial optimization in real and complex variables
- Moments, positive polynomials and their applications
- On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Point Estimates of Ordinates of Concave Functions
- Regularization methods for SDP relaxations in large-scale polynomial optimization
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Semidefinite Programming
- Semidefinite programming relaxations for semialgebraic problems
- Semidefinite representation of convex sets
- Shape-constrained regression using sum of squares polynomials
- Sparse Polynomial Optimization
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- Sums of Separable and Quadratic Polynomials
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Technical Note—On the Estimation of Convex Functions
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- Über die Darstellung definiter Formen als Summe von Formenquadraten.
This page was built for publication: SPLD polynomial optimization and bounded degree SOS hierarchies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7228833)
