Pages that link to "Item:Q2550611"

The following pages link to Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm (Q2550611):

Displayed 18 items.

• Computational methods of linear algebra (Q1148099) ‎ (← links)
• A subgradient projection algorithm (Q1164968) ‎ (← links)
• A class of programming problems whose objective function contains a norm (Q1254496) ‎ (← links)
• Methods of calculating \(l_ p\)-minimum norm solutions of consistent linear systems (Q1338558) ‎ (← links)
• Duality theorem for a generalized Fermat-Weber problem (Q1363411) ‎ (← links)
• Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex norm (Q1846325) ‎ (← links)
• The distance between two convex sets (Q2497250) ‎ (← links)
• On an algorithm for best approximate solutions to Av=b in normed linear spaces (Q2563276) ‎ (← links)
• A characterization of an element of best simultaneous approximation (Q3678142) ‎ (← links)
• An algorithm for the best approximation by elements of a polyhedral set in banach spaces (Q3745180) ‎ (← links)
• An algorithm for non-negative norm minimal solutions (Q3777326) ‎ (← links)
• A New Algorithm for the Chebyshev Solution of Overdetermined Linear Systems (Q4045511) ‎ (← links)
• Lösung überbestimmter linearer Gleichungssysteme im Sinne einer energetischen Norm (Q4140286) ‎ (← links)
• An algorithm for approximation by elements of a cone in a banach space (Q4205248) ‎ (← links)
• An algorithm for computing nonnegative minimal norm solutions (Q4291888) ‎ (← links)
• A least distance algorithm for a smooth strictly convex norm (Q4521951) ‎ (← links)
• An Algorithm For A Minimum Norm Solution Of A System Of Linear Inequalities (Q4707313) ‎ (← links)
• An algorithm for non—negative least error minimal norm solutions (Q4714547) ‎ (← links)