English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

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 optimization. Although this correspondence is not surprising, it naturally connects rational and generalized 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. 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 optimization problems.

The extension of the linear inequality method for generalized rational Chebyshev approximation to approximation by general quasilinear functions