A finite algorithm for the solution of consistent linear equations and inequalities and for the Tchebycheff approximation of inconsistent linear equations

DOI10.2140/PJM.1958.8.415zbMath0084.01902OpenAlexW2015051774MaRDI QIDQ770302

E. W. Cheney, Allen A. Goldstein

Publication date: 1958

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1958.8.415

zbMATH Keywords

linear algebra, polynomials, forms

Related Items (10)

Two new algorithms for rational approximation ⋮ A proximal point algorithm for minimax problems ⋮ Newton's method for convex programming and Tschebyscheff approximation ⋮ Computational methods of linear algebra ⋮ Unnamed Item ⋮ Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set ⋮ Ein Pseudo-Gradientenverfahren zur Lösung des diskreten linearen Tschebyscheff-Problems ⋮ Cubature and the Tchakaloff cone ⋮ Note on Jordan elimination, linear programming and Tchebyscheff approximation ⋮ Semi-Markov decision processes with vector pay-offs

This page was built for publication: A finite algorithm for the solution of consistent linear equations and inequalities and for the Tchebycheff approximation of inconsistent linear equations