Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions

DOI10.1007/s00158-007-0135-1zbMath1273.65203OpenAlexW3122196336MaRDI QIDQ373942

Dick den Hertog, Etienne de Klerk, A. Y. D. Siem

Publication date: 25 October 2013

Published in: Structural and Multidisciplinary Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00158-007-0135-1

Mathematics Subject Classification ID

Semidefinite programming (90C22) Approximation by rational functions (41A20) Numerical methods for trigonometric approximation and interpolation (65T40)

Uses Software

• SeDuMi
• COL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial genetic programming for response surface modeling. I. A methodology
• On the convergence of derivatives of Bernstein approximation
• Convexity preserving interpolatory subdivision schemes
• Global optimization of rational functions: a semidefinite programming approach
• On numerical methods for discrete least-squares approximation by trigonometric polynomials
• On convex quadratic approximation
• Polynomials that are positive on an interval
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
• Optimization of Polynomials on Compact Semialgebraic Sets
• A linear approach to shape preserving spline approximation