Structure-Preserving Function Approximation via Convex Optimization

DOI10.1137/19M130128XzbMath1453.90124arXiv2008.08223OpenAlexW3091645743MaRDI QIDQ5132001

Mike Kirby, Vidhi Zala, Akil C. Narayan

Publication date: 9 November 2020

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.08223

zbMATH Keywords

convex optimizationhigh-order accuracystructure-preserving approximation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Approximation with constraints (41A29) Algorithms for approximation of functions (65D15) Fourier coefficients, Fourier series of functions with special properties, special Fourier series (42A16)

Related Items (4)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local linear convergence for alternating and averaged nonconvex projections
• The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
• The degree of monotone approximation
• How to solve a semi-infinite optimization problem
• On the stability of computing polynomial roots via confederate linearizations
• Maximum-principle-satisfying and positivity-preserving high-order schemes for conservation laws: survey and new developments
• Semi-Infinite Programming: Theory, Methods, and Applications
• Positivity preserving finite element approximation
• Proximity Maps for Convex Sets
• Restricted Range Approximation by Splines and Variational Inequalities
• Algorithms For Positive Polynomial Approximation
• On Projection Algorithms for Solving Convex Feasibility Problems
• Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
• Adaptive Polynomial Interpolation on Evenly Spaced Meshes
• The method of projections for finding the common point of convex sets
• Approximation with Convex Constraints
• Approximation with Convex Constraints
• Best approximation in inner product spaces

This page was built for publication: Structure-Preserving Function Approximation via Convex Optimization