Basc: constrained approximation by semidefinite programming

DOI10.1093/imanum/drw014zbMath1433.41001OpenAlexW2399103582MaRDI QIDQ4683780

Simon Foucart, Vladlena Powers

Publication date: 26 September 2018

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imanum/drw014

zbMATH Keywords

semidefinite programmingsimultaneous approximationnon-negative polynomialsconstrained approximationRiesz-Fejér theorem

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Best approximation, Chebyshev systems (41A50) Software, source code, etc. for problems pertaining to approximations and expansions (41-04)

Related Items (7)

Uncertainty Propagation; Intrusive Kinetic Formulations of Scalar Conservation Laws ⋮ Determining projection constants of univariate polynomial spaces ⋮ Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming ⋮ Full recovery from point values: an optimal algorithm for Chebyshev approximability prior ⋮ Instances of Computational Optimal Recovery: Dealing with Observation Errors ⋮ Instances of computational optimal recovery: refined approximability models ⋮ Computation of Chebyshev polynomials for union of intervals

Uses Software

• CVX
• Chebfun
• Basc

This page was built for publication: Basc: constrained approximation by semidefinite programming