The extension of the linear inequality method for generalized rational Chebyshev approximation to approximation by general quasilinear functions
From MaRDI portal
Publication:5077162
DOI10.1080/02331934.2021.1939342zbMATH Open1489.41007arXiv2011.07731OpenAlexW3166180481MaRDI QIDQ5077162FDOQ5077162
Authors: V. Peiris, N. Sukhorukova 
Publication date: 18 May 2022
Published in: Optimization (Search for Journal in Brave)
Abstract: In this paper we demonstrate that a well known linear inequality method developed for rational Chebyshev approximation is equivalent to the application of the bisection method used in quasiconvex optimisation. Although this correspondence is not surprising, it naturally connects rational and generalised rational Chebyshev approximation problems with modern developments in the area of quasiconvex functions and therefore offers more theoretical and computational tools for solving this problem. %In particular, this observation leads a straightforward extension of the linear inequality method to generalised rational approximation in the sense of Loeb (ratio of two linear forms). The second important contribution of this paper is the extension of the linear inequality method to a broader class of Chebyshev approximation problems, where the corresponding objective functions remain quasiconvex. In this broader class of functions, the inequalities are no longer required to be linear: it is enough for each inequality to define a convex set and the computational challenge is in solving the corresponding convex feasibility problems. Therefore, we propose a more systematic and general approach for treating Chebyshev approximation problems. In particular, we are looking at the problems where the approximations are quasilinear functions with respect to their parameters, that are also the decision variables in the corresponding optimisation problems.
Full work available at URL: https://arxiv.org/abs/2011.07731
Recommendations
- Multivariate approximation by polynomial and generalized rational functions
- Stability of the linear inequality method for rational Chebyshev approximation
- scientific article; zbMATH DE number 4020301
- An algorithm for best generalised rational approximation of continuous functions
- Stability of best rational Chebyshev approximation
bisection methodquasiconvex functionsChebyshev approximationgeneralized rational approximationlinear inequality method
Numerical optimization and variational techniques (65K10) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Minimax problems in mathematical programming (90C47) Algorithms for approximation of functions (65D15) Approximation by rational functions (41A20)
Cites Work
- The AAA algorithm for rational approximation
- Quasiconvex duality theory by generalized conjugation methods
- Title not available (Why is that?)
- Abstract convexity and global optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sulle stratificazioni convesse
- A first course in numerical analysis.
- The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation
- Bivariate segment approximation and free knot splines: Research Problems 96-4
- Title not available (Why is that?)
- Uniform Approximation by Chebyshev Spline Functions. II: Free Knots
- Uniform approximation by the highest defect continuous polynomial splines: Necessary and sufficient optimality conditions and their generalisations
- Title not available (Why is that?)
- Subgradient projection algorithms and approximate solutions of convex feasibility problems
- An appropriate subdifferential for quasiconvex functions
- Best Rational Approximation and Strict Quasi-Convexity
- Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dykstras algorithm with bregman projections: A convergence proof
- Algorithms for Piecewise Polynomials and Splines with Free Knots
- Generalized Rational Approximation
- Algorithms for quasiconvex minimization
- On the computation of rational approximations to continuous functions
- An Algorithm for Minimax Approximation in the Nonlinear Case
- Conjugate quasiconvex nonnegative functions
- Polynomials of best uniform approximation to certain rational functions
- Algorithms for Chebyshev Approximations Using the Ratio of Linear Forms
- Conditions for Convexity of Quasiconvex Functions
- Functions whose best rational Chebyshev approximation are polynomials
- Rational Chebyshev approximation by Remes' algorithms
- Title not available (Why is that?)
- Chebyshev Approximation by Spline Functions with Free Knots
- On the finite termination of the Douglas-Rachford method for the convex feasibility problem
- Adaptive subgradient method for the split quasi-convex feasibility problems
- On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery
- Generalised rational approximation and its application to improve deep learning classifiers
- Finite alternation theorems and a constructive approach to piecewise polynomial approximation in Chebyshev norm
- Characterisation theorem for best polynomial spline approximation with free knots
- Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour
Cited In (2)
Uses Software
This page was built for publication: The extension of the linear inequality method for generalized rational Chebyshev approximation to approximation by general quasilinear functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5077162)
