Computation of Sum of Squares Polynomials from Data Points
From MaRDI portal
Publication:5113128
DOI10.1137/19M1273955zbMath1456.90121arXiv1812.02444MaRDI QIDQ5113128
Publication date: 10 June 2020
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.02444
65K05: Numerical mathematical programming methods
11E25: Sums of squares and representations by other particular quadratic forms
90C23: Polynomial optimization
Related Items
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
- Convergence rates of moment-sum-of-squares hierarchies for optimal control problems
- Correction to: ``Polynomials with bounds and numerical approximation
- Gradient methods with adaptive step-sizes
- On the complexity of Putinar's Positivstellensatz
- An algorithm for sums of squares of real polynomials
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Polynomials with bounds and numerical approximation
- On the steplength selection in gradient methods for unconstrained optimization
- An Introduction to Polynomial and Semi-Algebraic Optimization
- Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- Algorithms For Positive Polynomial Approximation
- A Dual Approach to Semidefinite Least-Squares Problems
- Mathematical analysis of variational isogeometric methods
- Bound-Preserving High Order Finite Volume Schemes for Conservation Laws and Convection-Diffusion Equations
