Note on Jordan elimination, linear programming and Tchebyscheff approximation
From MaRDI portal
Publication:773483
DOI10.1007/BF01386203zbMath0097.32306OpenAlexW2320420931MaRDI QIDQ773483
Publication date: 1960
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131439
Related Items (39)
Jordan-Elimination und Ausgleichung nach kleinsten Quadraten ⋮ On the Chebyshev solution of inconsistent linear equations ⋮ The methods of Vorobyev and Lanczos ⋮ Chebyshev approximation by linear combinations of fixed knot polynomial splines with weighting functions ⋮ Best Chebyshev approximation of functions of one and many variables ⋮ A proximal point algorithm for minimax problems ⋮ Some early statistical contributions to the theory and practice of linear algebra ⋮ On L1 and Chebyshev estimation ⋮ A geometrie representation for pairs of dual quadratic or linear programs ⋮ The historical development of the linear minimax absolute residual estimation procedure 1786--1960 ⋮ Uniformly self-justified equilibria ⋮ The optimal exchange algorithm and comparisons with the generalized remes algorithm†‡ ⋮ Chebyshev solution of overdetermined systems of linear equations ⋮ Ragnar Frisch and interior-point methods ⋮ Unnamed Item ⋮ 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 ⋮ Lexicographic quasiconcave multiobjective programming ⋮ Discrete, linear approximation problems in polyhedral norms ⋮ Goal programming and multiple objective optimizations. Part I ⋮ A dual method for discrete Chebychev curve fitting ⋮ A New Algorithm for the Chebyshev Solution of Overdetermined Linear Systems ⋮ A linear programming procedure based on de la Vallée poussin's minimax estimation procedure ⋮ A linear programming algorithm for curve fitting in the L∞norm ⋮ Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set ⋮ An algorithm of successive minimization in convex programming ⋮ Ein Pseudo-Gradientenverfahren zur Lösung des diskreten linearen Tschebyscheff-Problems ⋮ Testing proximity to subspaces: approximate \(\ell_\infty\) minimization in constant time ⋮ A theorem of convex polyhedra in connection with the problem of finding the set of solutions to a system of linear inequalities ⋮ An interval programming algorithm for discrete linear \(L_ 1\) approximation problems ⋮ Etude de l'algorithme de Rémès en l'absence de condition de Haar. (Study on the algorithm by Rémès in absence of the condition by Haar) ⋮ On the best linear one-sided Chebyshev approximation ⋮ Dégénérescence dans les approximations de Tschebyscheff linéaires et discrètes ⋮ Numerical shakedown analysis of damaged structures ⋮ Approximation in normed linear spaces ⋮ The strict Chebyshev solution of overdetermined systems of linear equations with rank deficient matrix ⋮ Eine elementare Methode zur Behandlung des Entartungsfalles in der linearen Optimierung ⋮ Solving Linear Programming Problems by Reducing to the Form with an Obvious Answer
Cites Work
- A finite algorithm for the solution of consistent linear equations and inequalities and for the Tchebycheff approximation of inconsistent linear equations
- Über diskrete und lineare Tschebyscheff-Approximationen
- Note on a Paper by Zuhovickii˘ Concerning the Tchebycheff Problem for Linear Equations
- Unnamed Item
- Unnamed Item
This page was built for publication: Note on Jordan elimination, linear programming and Tchebyscheff approximation
