Best Rational Approximation and Strict Quasi-Convexity

DOI10.1137/0710002zbMath0262.41034OpenAlexW2170002937MaRDI QIDQ5677936

Ian Barrodale

Publication date: 1973

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1828/11492

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Approximation by rational functions (41A20) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Related Items (38)

Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions ⋮ Second-order duality for non-differentiable minimax fractional programming ⋮ Saddle-point-type optimality conditions and lagrangian-type duality for a class of constrained generalized fractional optimal control ⋮ A new branch and bound algorithm for minimax ratios problems ⋮ OPTIMALITY CONDITIONS AND DUALITY MODELS FOR A CLASS OF NONSMOOTH CONTINUOUS-TIME GENERALIZED FRACTIONAL PROGRAMMING PROBLEMS ⋮ Optimality conditions and duality for a class of continuous-time generalized fractional programming problems ⋮ Higher-order non-symmetric duality for nondifferentiable minimax fractional programs with square root terms ⋮ The extension of the linear inequality method for generalized rational Chebyshev approximation to approximation by general quasilinear functions ⋮ Generalised rational approximation and its application to improve deep learning classifiers ⋮ Global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing generalized \((\theta,\eta,\rho)\)-V-invex functions and arbitrary norms ⋮ A new linearization technique for minimax linear fractional programming ⋮ Duality for minmax \(B\)-vex programming involving \(n\)-set functions ⋮ DCR 2: An improved algorithm for \(\ell_\infty\) rational approximation on intervals ⋮ A solvability theorem and minimax fractional programming ⋮ Optimality and duality for \(E\)-minimax fractional programming: application to multiobjective optimization ⋮ A Fourth bibliography of fractional programming ⋮ Fractional programming by lower subdifferentiability techniques ⋮ On second-order duality for minimax fractional programming problems with generalized convexity ⋮ On second order duality for minimax fractional programming ⋮ Continuous-time generalized fractional programming ⋮ Fractional programming ⋮ Nonsmooth semi-infinite minmax programming involving generalized \((\varPhi,\rho)\)-invexity ⋮ Second-order duality for nondifferentiable minimax fractional programming problems with generalized convexity ⋮ Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions ⋮ Nonsmooth minimax fractional programming involvingη-pseudolinear functions ⋮ Duality in generalized linear fractional programming ⋮ Duality in nondifferentiable minimax fractional programming with generalized convexity ⋮ Duality for minmax programming involving nonsmooth v-invex functions ⋮ Duality for generalized fractional programs involving n-set functions ⋮ Convergence of minimizing sequences ⋮ Second order duality for minmax fractional programming ⋮ Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized \((\mathcal F,\rho,\theta)\) -convex functions ⋮ Chebyshev approximation by rationals with constrained denominators ⋮ An effective branch and bound algorithm for minimax linear fractional programming ⋮ Sufficiency and duality in nondifferentiable minimax fractional programming with \((H_p,r)\)-invexity ⋮ Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions ⋮ Global saddle-point duality for quasi-concave programs, II ⋮ Bibliography in fractional programming

This page was built for publication: Best Rational Approximation and Strict Quasi-Convexity