Multivariate approximation by polynomial and generalized rational functions

Abstract

In this paper, we develop an optimization-based approach to multivariate Chebyshev approximation on a finite grid. We consider two models: multivariate polynomial approximation and multivariate generalized rational approximation. In the second case, the approximations are ratios of linear forms and the basis functions are not limited to monomials. It is already known that in the case of multivariate polynomial approximation on a finite grid the corresponding optimization problems can be reduced to solving a linear programming problem, while the area of multivariate rational approximation is not so well understood. In this paper we demonstrate that in the case of multivariate generalized rational approximation the corresponding optimization problems are quasiconvex. This statement remains true even when the basis functions are not limited to monomials. Then we apply a bisection method, which is a general method for quasiconvex optimization. This method converges to an optimal solution with given precision. We demonstrate that the convex feasibility problems appearing in the bisection method can be solved using linear programming. Finally, we compare the deviation error and computational time for multivariate polynomial and generalized rational approximation with the same number of decision variables.

Keywords:

• Generalized rational approximation
• Chebyshev approximation
• quasiconvex functions
• bisection method

AMS Classifications:

• 90C25
• 90C26
• 90C90
• 90C47
• 65D15

Disclosure statement

No potential conflict of interest was reported by the author(s).

Additional information

Funding

This research was supported by the Australian Research Council (ARC), Solving hard Chebyshev approximation problems through non-smooth analysis (Discovery Project DP180100602).