Approximation in normed linear spaces
From MaRDI portal
Publication:1587393
DOI10.1016/S0377-0427(00)00333-2zbMath0964.41020WikidataQ114829826 ScholiaQ114829826MaRDI QIDQ1587393
Publication date: 9 July 2001
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Related Items
On smooth reformulations and direct non-smooth computations for minimax problems, An algorithm for minimum L-infinity solution of under-determined linear systems, Combinatorial properties of support vectors of separating hyperplanes, An algorithm for fitting circular arcs to data using the \(l_1\) norm, Explicit solution of the finite time \(L_{2}\)-norm polynomial approximation problem, On the existence of the best discrete approximation in \(l_p\) norm by reciprocals of real polynomials, Distance regression by Gauss-Newton-type methods and iteratively re-weighted least-squares, Learning weights in the generalized OWA operators
Uses Software
Cites Work
- Über die genaue Berechnung von besten \(L^1\)-Approximierenden
- Bivariate segment approximation and splines
- A new polynomial-time algorithm for linear programming
- Über diskrete und lineare Tschebyscheff-Approximationen
- On the numerical determination of the best approximations in the Chebyshev sense
- Note on Jordan elimination, linear programming and Tchebyscheff approximation
- On rational Chebyshev approximation
- Uniform approximation by generalized splines with free knots
- An algorithm for composite nonsmooth optimization problems
- An algorithm for segment approximation
- The convergence of the best discrete linear \(L_ p\) approximation as p\(\to 1\)
- On a class of algorithms for total approximation
- Strongly unique spline approximations with free knots
- The differential correction algorithm for generalized rational functions
- Approximation with one (or few) parameters nonlinear
- Approximation by generalized splines
- Newton's method for convex programming and Tschebyscheff approximation
- DCR 2: An improved algorithm for \(\ell_\infty\) rational approximation on intervals
- On the convergence of an algorithm for discrete \(L_p\) approximation
- The weakened first algorithm of Remez
- Uniform approximation by rational functions having restricted denominators
- Natural choice of \(L_ 1-\)approximants
- Strong uniqueness and second order convergence in nonlinear discrete approximation
- A Remez type algorithm for spline functions
- A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems
- Eine Klasse von Verfahren zur Ermittlung bester nichtlinearer Tschebyscheff-Approximationen
- Best \(L^1\) approximation by weak Chebyshev systems and the uniqueness of interpolating perfect splines
- Discrete, non-linear approximation problems in polyhedral norms
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- On two methods for discrete \(L_p\) approximation
- Chebyshev approximation by exponential-polynomial sums
- Fitting linear relationships. A history of the calculus of observations 1750-1900
- P. L. Chebyshev (1821-1894). A guide to his life and work
- A projected conjugate gradient method for sparse minimax problems
- Discretization methods for the solution of semi-infinite programming problems
- Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems
- Corrected sequential linear programming for sparse minimax optimization
- New characterizations of \(\ell_ 1\) solutions to overdetermined systems of linear equations
- Bivariate segment approximation and free knot splines: Research Problems 96-4
- The Gaussian hare and the Laplacian tortoise: computability of squared-error versus absolute-error estimators. With comments by Ronald A. Thisted and M. R. Osborne and a rejoinder by the authors
- Numerical experiments in semi-infinite programming
- Uniqueness and strong uniqueness of best approximations by spline subspaces and other subspaces
- Computational experiences with discrete L\(_p\)-approximation
- Uniform piecewise polynomial approximation with variable joints
- Geometrical characterizations for nonlinear uniform approximation
- An algorithm for Chebyshev approximation by rationals with constrained denominators
- Nicht-lineare Approximationen
- Rational Chebyshev approximation by Remes' algorithms
- Approximation mit Exponentialsummen
- Die konstruktive Ermittlung der Tschebyscheff-Approximierenden im Bereich der rationalen Funktionen
- Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
- Computational methods for best spline function approximation
- A note on singular minimax approximation problems
- Approximation from a curve of functions
- Equioscillation under nonuniqueness in the approximation of continuous functions
- Rationale Tschebyscheff-Approximation, Eigenwerttheorie und Differenzenrechnung
- Methods of nonlinear analysis. Vol. 1
- An interval programming algorithm for discrete linear \(L_ 1\) approximation problems
- Chebyshev approximation by spline functions with free knots
- The Newton differential correction algorithm for rational Chebyshev approximation with constrained denominators
- Two new algorithms for rational approximation
- Characteristic properties of the segmented rational minmax approximation problem
- Optimal Estimation of Executive Compensation by Linear Programming
- A Globally Convergent Method for $l_p $ Problems
- On Haar's Theorem Concerning Chebychev Approximation Problems Having Unique Solutions
- Least pth Power Polynomials on a Finite Point Set
- An Application of Linear Programming to Curve Fitting
- Linear Programming Techniques for Regression Analysis
- On monosplines of least deviation
- Das Austauschverfahren der linearen Tschebyscheff-Approximation bei nicht erfüllter Haarscher Bedingung
- Chebyshev Approximation by $ab^x + c$
- On the computation of rational approximations to continuous functions
- The Mathematical Structure of Huber’s M-Estimator
- Modifications of the First Remez Algorithm
- An Algorithm for General Restricted Rational Chebyshev Approximation
- Combined LP and Quasi-Newton Methods for Nonlinear $l_1 $ Optimization
- An implementation of a discretization method for semi-infinite programming
- An Algorithm for Computing Continuous Chebyshev Approximations
- Algorithms for Piecewise Polynomials and Splines with Free Knots
- Primal Methods are Better than Dual Methods for Solving Overdetermined Linear Systems in the $l_\infty $ Sense?
- Two Linear Programming Algorithms for the Linear Discrete L 1 Norm Problem
- Suboptimal Exponential Approximations
- Variable metric methods for minimizing a class of nondifferentiable functions
- A dual method for discrete Chebychev curve fitting
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- A Projected Lagrangian Algorithm for Nonlinear $l_1 $ Optimization
- An Algorithm for Linear L1 Approximation of Continuous Functions
- Chebyshev Approximation by Spline Functions with Free Knots
- On the Implementation of a Primal-Dual Interior Point Method
- A Global and Quadratically Convergent Method for Linear $l_\infty $ Problems
- A New Algorithm for the Chebyshev Solution of Overdetermined Linear Systems
- A Multiple Exchange Algorithm for Multivariate Chebyshev Approximation
- An Efficient Method for the Discrete Linear L 1 Approximation Problem
- Algorithm 495: Solution of an Overdetermined System of Linear Equations in the Chebychev Norm [F4]
- Chebyshev Approximation of Completely Monotonic Functions by Sums of Exponentials
- A Descent Method for the Uniform Solution to Over-Determined Systems of Linear Equations
- A Method for Calculating Best Non-linear Chebyshev Approximations
- Linear Chebyshev approximation without Chebyshev sets
- An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear Equations
- A Combined Remes-Differential Correction Algorithm for Rational Approximation
- Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
- On Cline’s Direct Method for Solving Overdetermined Linear Systems in the $L_\infty $ Sense
- An algorithm of successive minimization in convex programming
- The Minimax Solution of an Overdetermined System of Non-linear Equations
- The Linear l1 Estimator and the Huber M-Estimator
- The Existence of Rational Functions of Best Approximation
- The Fitting of Power Series, Meaning Polynomials, Illustrated on Band-Spectroscopic Data
- Linear Minimax Approximation as the Limit of Best $L_p $-Approximation
- An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
- Numerical treatment of a class of semi‐infinite programming problems
- Some Aspects of Degeneracy in Rational Approximations
- A Finite Smoothing Algorithm for Linear $l_1 $ Estimation
- Approximations in $L^p $ and Chebyshev Approximations
- A Direct Method for Chebyshev Approximation by Rational Functions
- Generalized Rational Approximation
- A Moment Problem in L 1 Approximation
- Chebyshev Approximation by Exponentials
- The Characterization of Best Nonlinear Tchebycheff Approximations
- Tchebycheff Approximations by Functions Unisolvent of Variable Degree
- On $L_1 $ Approximation I: Computation for Continuous Functions and Continuous Dependence
- The Construction of Minimax Rational Approximations to Functions
- On the Best Linear Chebyshev Approximation
- Optimal starting values for Newton-Raphson calculation of √x ½
- Numerical Analysis: Stable numerical methods for obtaining the Chebyshev solution to an overdetermined system of equations
- An Algorithm for Minimax Approximation in the Nonlinear Case
- On $L_1 $ Approximation II: Computation for Discrete Functions and Discretization Effects
- A Note on Numerical Procedures for Approximation by Spline Functions
- Characterization of Chebyshev Approximations by Splines
- Linear L 1 Approximation for a Discrete Point Set and L 1 Solutions of Overdetermined Linear Equations
- On the Computational Solution of a Class of Generalized Moment Problems
- On an algorithm for discrete nonlinear L1 approximation
- The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation
- Discrete approximation in the L1 norm
- An Improved Algorithm for Discrete $l_1 $ Linear Approximation
- Further Remarks on the Differential Correction Algorithm
- A Survey of Methods for Rational Approximation, with Particular Reference to a New Method Based on a Forumla of Darboux
- Approximation by curves of a unisolvent family
- Orthogonality and Linear Functionals in Normed Linear Spaces
- On n-Parameter Families of Functions and Associated Convex Functions
- Über Gleichungssysteme der Tschebyscheffschen Approximation
- Least pth Power Polynomials on a Real Finite Point Set
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
