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