A finite algorithm for the solution of consistent linear equations and inequalities and for the Tchebycheff approximation of inconsistent linear equations
From MaRDI portal
Publication:770302
DOI10.2140/PJM.1958.8.415zbMATH Open0084.01902OpenAlexW2015051774MaRDI QIDQ770302FDOQ770302
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
Cited In (10)
- Cubature and the Tchakaloff cone
- Computational methods of linear algebra
- Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
- Newton's method for convex programming and Tschebyscheff approximation
- Ein Pseudo-Gradientenverfahren zur Lösung des diskreten linearen Tschebyscheff-Problems
- Note on Jordan elimination, linear programming and Tchebyscheff approximation
- Semi-Markov decision processes with vector pay-offs
- Title not available (Why is that?)
- A proximal point algorithm for minimax problems
- Two new algorithms for rational approximation
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q770302)
