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.415MaRDI QIDQ770302zbMATHOpenAlexFDO

Authors Allen A. Goldstein, E. W. Cheney

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

Cited in

(10)

• Newton's method for convex programming and Tschebyscheff approximation
• A proximal point algorithm for minimax problems
• Note on Jordan elimination, linear programming and Tchebyscheff approximation
• Two new algorithms for rational approximation
• Ein Pseudo-Gradientenverfahren zur Lösung des diskreten linearen Tschebyscheff-Problems
• scientific article; zbMATH DE number 3272790 (Why is no real title available?)
• Cubature and the Tchakaloff cone
• Computational methods of linear algebra
• Semi-Markov decision processes with vector pay-offs
• Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set

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)