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
An efficient method for \(l^\infty\) regression, A least distance algorithm for a smooth strictly convex norm, 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, Approximation of convex data, On L1 and Chebyshev estimation, Minimal compatible solutions of linear equations, Two simple algorithms for discrete rational approximation, Zur praktischen Behandlung linearer diskreter Approximationsprobleme in der Maximumsnorm, An algorithm for non-negative norm minimal solutions, Computational experience with an algorithm for discrete \(L_ 1\) approximation, Chebyshev solution of overdetermined systems of linear equations, On the convergence of a class of nonlinear approximation methods, Least absolute value and chebychev estimation utilizing least squares results, Adaptive methods for solvings minimax problems∗, On the discrete linear L\(_1\) approximation and L\(_1\) solutions of overdetermined linear equations, Computational Algorithms for Calculating Least Absolute Value and Chebyshev Estimates for Multiple Regression, Extensions to a Best Subset Algorithm for Least Absolute Value Estimation, 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, A New Algorithm for the Chebyshev Solution of Overdetermined Linear Systems, The numerical solution of the inverse Stefan problem, Ein Pseudo-Gradientenverfahren zur Lösung des diskreten linearen Tschebyscheff-Problems, An interval programming algorithm for discrete linear \(L_ 1\) approximation problems, Using the least squares estimator in Chebyshev estimation, An algorithm for approximation by elements of a cone in a banach space, Best subsets regression using LP-norms with 1≤p<∞, Piecewise linear programming via interior points, Computational experiences with discrete L\(_p\)-approximation, Approximation in normed linear spaces, The strict Chebyshev solution of overdetermined systems of linear equations with rank deficient matrix, An algorithm for \(\ell^\infty\) regression with quadratic complexity, Algorithms for unconstrained \(L_ 1\) simple linear regression, A new technique for curve fitting based on minimum absolute deviations
Cites Work
