Polynomial Norms
From MaRDI portal
Publication:4620456
DOI10.1137/18M1172843zbMath1431.90107arXiv1704.07462OpenAlexW2795814988MaRDI QIDQ4620456
Etienne de Klerk, Amir Ali Ahmadi, Georgina Hall
Publication date: 8 February 2019
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.07462
Semidefinite programming (90C22) Semialgebraic sets and related spaces (14P10) Approximation by convex sets (52A27)
Related Items
On random walks and switched random walks on homogeneous spaces, Marstrand-Mattila rectifiability criterion for 1-codimensional measures in Carnot groups
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds on complexity of Lyapunov functions for switched linear systems
- Notions of positivity and the geometry of polynomials. Dedicated to the memory of Julius Borcea
- A convex polynomial that is not sos-convex
- Semidefinite representation of convex sets
- A non-commutative real Nullstellensatz and Hilbert's 17th problem
- Banach spaces with polynomial norms
- Semidefinite programming relaxations for semialgebraic problems
- The boundedness of all products of a pair of matrices is undecidable
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
- Positive polynomials in control.
- Symmetry groups, semidefinite programs, and sums of squares
- Uniform denominators in Hilbert's seventeenth problem
- The convex geometry of linear inverse problems
- NP-hardness of deciding convexity of quartic polynomials and related problems
- Global Optimization with Polynomials and the Problem of Moments
- A Complete Characterization of the Gap between Convexity and SOS-Convexity
- Optimization with Sparsity-Inducing Penalties
- Regularization Methods for SDP Relaxations in Large-Scale Polynomial Optimization
- Analysis of the joint spectral radius via lyapunov functions on path-complete graphs
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Moments of non-negative mass
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Semidefinite Programming
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- An elementary and constructive solution to Hilbert’s 17th Problem for matrices
- On the absence of uniform denominators in Hilbert’s 17th problem
