Sum-of-Squares Optimization without Semidefinite Programming
From MaRDI portal
Publication:4629344
DOI10.1137/17M1160124zbMath1412.90114arXiv1712.01792WikidataQ128181100 ScholiaQ128181100MaRDI QIDQ4629344
Publication date: 22 March 2019
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.01792
semidefinite programmingpolynomial interpolationpolynomial optimizationsum-of-squares optimizationnonsymmetric conic optimization
Semidefinite programming (90C22) Convex programming (90C25) Interior-point methods (90C51) Numerical interpolation (65D05)
Related Items
Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets, Solving Natural Conic Formulations with Hypatia.jl, Duality of sum of nonnegative circuit polynomials and optimal SONC bounds, Alfonso: Matlab Package for Nonsymmetric Conic Optimization, Sum of squares generalizations for conic sets, Rational dual certificates for weighted sums-of-squares polynomials with boundable bit size, A faster interior-point method for sum-of-squares optimization, Performance enhancements for a generic conic interior point algorithm, (Global) optimization: historical notes and recent developments, Sum-of-Squares Optimization without Semidefinite Programming, Bounds on mean energy in the Kuramoto–Sivashinsky equation computed using semidefinite programming, Time-Varying Semidefinite Programs, Finding Extremal Periodic Orbits with Polynomial Optimization, with Application to a Nine-Mode Model of Shear Flow, Bounding Extreme Events in Nonlinear Dynamics Using Convex Optimization, A Convex Relaxation to Compute the Nearest Structured Rank Deficient Matrix, Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimating arrival rate of nonhomogeneous Poisson processes with semidefinite programming
- \texttt{Padua2DM}: Fast interpolation and cubature at the Padua points in \texttt{MATLAB/Octave}
- Bivariate Lagrange interpolation at the Padua points: the generating curve approach
- Parallel and superfast algorithms for Hankel systems of equations
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey
- Computing approximate Fekete points by QR factorizations of Vandermonde matrices
- Representing polynomials by positive linear functions on compact convex polyhedra
- The \(K\)-moment problem for compact semi-algebraic sets
- On the complexity of approximating extremal determinants in matrices
- Convex optimization problems involving finite autocorrelation sequences
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- The condition number of real Vandermonde, Krylov and positive definite Hankel matrices
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- Bivariate polynomial interpolation on the square at new nodal sets
- Symmetry groups, semidefinite programs, and sums of squares
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
- Computing sum of squares decompositions with rational coefficients
- Global Optimization with Polynomials and the Problem of Moments
- An Algorithm for Computing Fekete Points in the Triangle
- Tensor product Gauss-Lobatto points are Fekete points for the cube
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Semidefinite Approximations of the Polynomial Abscissa
- GpoSolver: a Matlab/C++ toolbox for global polynomial optimization
- An Introduction to Polynomial and Semi-Algebraic Optimization
- Experimental Study of Energy-Minimizing Point Configurations on Spheres
- New upper bounds for kissing numbers from semidefinite programming
- Optimization Problems over Positive Pseudopolynomial Matrices
- Optimization of Polynomial Functions
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- CSDP, A C library for semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Sum-of-Squares Optimization without Semidefinite Programming
- Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables
- Semidefinite Optimization and Convex Algebraic Geometry
- Optimal Designs for Rational Function Regression
- Towards non-symmetric conic optimization
- Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Semi-Infinite Programming using High-Degree Polynomial Interpolants and Semidefinite Programming
- GloptiPoly
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Positive trigonometric polynomials and signal processing applications
