A convex dual programming for the rational minimax approximation and Lawson's iteration.
Lei-Hong ZhangLinyi YangWei Hong YangYa-Nan ZhangPublished in: CoRR (2023)
Keyphrases
- dual variables
- convex functions
- asymptotic properties
- error bounds
- programming language
- primal dual
- convex optimization
- approximation algorithms
- worst case
- approximation error
- evaluation function
- convex sets
- convex programming
- object oriented programming
- iterative process
- approximation methods
- stationary points
- newton raphson
- general purpose
- objective function
- development environment
- programming environment
- convex hull
- graph cuts
- risk minimization
- neyman pearson