Structure-preserving function approximation via convex optimization
From MaRDI portal
Publication:5132001
Abstract: Approximations of functions with finite data often do not respect certain "structural" properties of the functions. For example, if a given function is non-negative, a polynomial approximation of the function is not necessarily also non-negative. We propose a formalism and algorithms for preserving certain types of such structure in function approximation. In particular, we consider structure corresponding to a convex constraint on the approximant (for which positivity is one example). The approximation problem then converts into a convex feasibility problem, but the feasible set is relatively complicated so that standard convex feasibility algorithms cannot be directly applied. We propose and discuss different algorithms for solving this problem. One of the features of our machinery is flexibility: relatively complicated constraints, such as simultaneously enforcing positivity, monotonicity, and convexity, are fairly straightforward to implement. We demonstrate the success of our algorithm on several problems in univariate function approximation.
Recommendations
Cites work
- scientific article; zbMATH DE number 3477793 (Why is no real title available?)
- scientific article; zbMATH DE number 3493264 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3229228 (Why is no real title available?)
- Adaptive Polynomial Interpolation on Evenly Spaced Meshes
- Algorithms for positive polynomial approximation
- Approximation with Convex Constraints
- Approximation with Convex Constraints
- Best approximation in inner product spaces
- Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
- How to solve a semi-infinite optimization problem
- Introduction to applied linear algebra. Vectors, matrices, and least squares
- Local linear convergence for alternating and averaged nonconvex projections
- Maximum-principle-satisfying and positivity-preserving high-order schemes for conservation laws: survey and new developments
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the stability of computing polynomial roots via confederate linearizations
- Positivity preserving finite element approximation
- Proximity Maps for Convex Sets
- Restricted Range Approximation by Splines and Variational Inequalities
- Semi-Infinite Programming: Theory, Methods, and Applications
- The degree of monotone approximation
- The method of projections for finding the common point of convex sets
- The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
Cited in
(5)- Hyperbolicity-preserving and well-balanced stochastic Galerkin method for two-dimensional shallow water equations
- Convex optimization-based structure-preserving filter for multidimensional finite element simulations
- ENO-based high-order data-bounded and constrained positivity-preserving interpolation
- Structure-preserving nonlinear filtering for continuous and discontinuous Galerkin spectral/\(hp\) element methods
- Approximating optimization problems over convex functions
This page was built for publication: Structure-preserving function approximation via convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5132001)
