Pages that link to "Item:Q773483"

The following pages link to Note on Jordan elimination, linear programming and Tchebyscheff approximation (Q773483):

Displaying 28 items.

• Chebyshev approximation by linear combinations of fixed knot polynomial splines with weighting functions (Q346817) (← links)
• Ragnar Frisch and interior-point methods (Q497438) (← links)
• Dégénérescence dans les approximations de Tschebyscheff linéaires et discrètes (Q774198) (← links)
• A linear programming procedure based on de la Vallée poussin's minimax estimation procedure (Q1010377) (← links)
• The strict Chebyshev solution of overdetermined systems of linear equations with rank deficient matrix (Q1054437) (← links)
• A geometrie representation for pairs of dual quadratic or linear programs (Q1131454) (← links)
• Discrete, linear approximation problems in polyhedral norms (Q1229548) (← links)
• Goal programming and multiple objective optimizations. Part I (Q1245774) (← links)
• Numerical shakedown analysis of damaged structures (Q1299260) (← links)
• A proximal point algorithm for minimax problems (Q1371666) (← links)
• The historical development of the linear minimax absolute residual estimation procedure 1786--1960 (Q1391701) (← links)
• Approximation in normed linear spaces (Q1587393) (← links)
• The methods of Vorobyev and Lanczos (Q1908186) (← links)
• Some early statistical contributions to the theory and practice of linear algebra (Q1914228) (← links)
• On the discrete linear L\(_1\) approximation and L\(_1\) solutions of overdetermined linear equations (Q2264933) (← links)
• Testing proximity to subspaces: approximate \(\ell_\infty\) minimization in constant time (Q2309471) (← links)
• Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set (Q2532223) (← links)
• Ein Pseudo-Gradientenverfahren zur Lösung des diskreten linearen Tschebyscheff-Problems (Q2536418) (← links)
• A theorem of convex polyhedra in connection with the problem of finding the set of solutions to a system of linear inequalities (Q2542393) (← links)
• An interval programming algorithm for discrete linear \(L_ 1\) approximation problems (Q2544339) (← links)
• 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) (Q2550604) (← links)
• On the best linear one-sided Chebyshev approximation (Q2555988) (← links)
• Jordan-Elimination und Ausgleichung nach kleinsten Quadraten (Q2625943) (← links)
• Best Chebyshev approximation of functions of one and many variables (Q2654992) (← links)
• Adaptive methods for solvings minimax problems^∗ (Q2767578) (← links)
• On L1 and Chebyshev estimation (Q3215733) (← links)
• Computational Algorithms for Calculating Least Absolute Value and Chebyshev Estimates for Multiple Regression (Q3339238) (← links)
• Uniformly self-justified equilibria (Q6072253) (← links)