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.1939342zbMath1489.41007arXiv2011.07731OpenAlexW3166180481MaRDI QIDQ5077162
V. Peiris, Nadezda Sukhorukova
Publication date: 18 May 2022
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.07731
quasiconvex functionsbisection methodChebyshev approximationgeneralized rational approximationlinear inequality method
Applications of mathematical programming (90C90) Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Approximation by rational functions (41A20) Algorithms for approximation of functions (65D15)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Subgradient projection algorithms and approximate solutions of convex feasibility problems
- Uniform approximation by the highest defect continuous polynomial splines: Necessary and sufficient optimality conditions and their generalisations
- Bivariate segment approximation and free knot splines: Research Problems 96-4
- Finite alternation theorems and a constructive approach to piecewise polynomial approximation in Chebyshev norm
- Functions whose best rational Chebyshev approximation are polynomials
- Rational Chebyshev approximation by Remes' algorithms
- Polynomials of best uniform approximation to certain rational functions
- Sulle stratificazioni convesse
- Generalised rational approximation and its application to improve deep learning classifiers
- Dykstras algorithm with bregman projections: A convergence proof
- An Appropriate Subdifferential for Quasiconvex Functions
- Adaptive subgradient method for the split quasi-convex feasibility problems
- On the finite termination of the Douglas-Rachford method for the convex feasibility problem
- Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem
- Algorithms for quasiconvex minimization
- Algorithms for Chebyshev Approximations Using the Ratio of Linear Forms
- On the computation of rational approximations to continuous functions
- Algorithms for Piecewise Polynomials and Splines with Free Knots
- Quasiconvex duality theory by generalized conjugation methods
- Conditions for Convexity of Quasiconvex Functions
- Chebyshev Approximation by Spline Functions with Free Knots
- On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery
- Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour
- Conjugate quasiconvex nonnegative functions
- Characterisation theorem for best polynomial spline approximation with free knots
- Generalized Rational Approximation
- An Algorithm for Minimax Approximation in the Nonlinear Case
- Uniform Approximation by Chebyshev Spline Functions. II: Free Knots
- The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation
- Best Rational Approximation and Strict Quasi-Convexity
- The AAA Algorithm for Rational Approximation
- Abstract convexity and global optimization
