Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
From MaRDI portal
Publication:2532223
DOI10.1007/BF02162565zbMath0173.18801MaRDI QIDQ2532223
Publication date: 1966
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131705
Related Items
A least distance algorithm for a smooth strictly convex norm, Approximation of convex data, Two simple algorithms for discrete rational approximation, Extensions to a Best Subset Algorithm for Least Absolute Value Estimation, Algorithms for unconstrained \(L_ 1\) simple linear regression, A new technique for curve fitting based on minimum absolute deviations, The strict Chebyshev solution of overdetermined systems of linear equations with rank deficient matrix, The use of mass balances to test and improve the estimates of carbon fluxes in an ecosystem, On computing a best discrete \(L_ 1\) approximation using the method of vanishing Jacobians, Minimal compatible solutions of linear equations, Zur praktischen Behandlung linearer diskreter Approximationsprobleme in der Maximumsnorm, Computational experience with an algorithm for discrete \(L_ 1\) approximation, On the convergence of a class of nonlinear approximation methods, Sulla soluzione dell'equazione biarmonica con metodi di programmazione lineare, An algorithm for best approximate solutions of Ax=b with a smooth strictly convex norm, Clusterwise linear regression, Linear programming for weighted deviation problems using compact basis techniques, The numerical solution of the inverse Stefan problem, Piecewise linear programming via interior points, Approximation in normed linear spaces, An algorithm for \(\ell^\infty\) regression with quadratic complexity, An efficient method for \(l^\infty\) regression, Computational experiences with discrete L\(_p\)-approximation, On the discrete linear L\(_1\) approximation and L\(_1\) solutions of overdetermined linear equations, Ein Pseudo-Gradientenverfahren zur Lösung des diskreten linearen Tschebyscheff-Problems, An interval programming algorithm for discrete linear \(L_ 1\) approximation problems, Adaptive methods for solvings minimax problems∗, On L1 and Chebyshev estimation, Least absolute value and chebychev estimation utilizing least squares results, Computational Algorithms for Calculating Least Absolute Value and Chebyshev Estimates for Multiple Regression, An algorithm for non-negative norm minimal solutions, Using the least squares estimator in Chebyshev estimation, Best subsets regression using LP-norms with 1≤p<∞, Chebyshev solution of overdetermined systems of linear equations, A New Algorithm for the Chebyshev Solution of Overdetermined Linear Systems, An algorithm for approximation by elements of a cone in a banach space
Cites Work
