Methods of calculating \(l_ p\)-minimum norm solutions of consistent linear systems
From MaRDI portal
Publication:1338558
DOI10.1007/BF02190061zbMath0831.90102OpenAlexW1992787065MaRDI QIDQ1338558
Publication date: 18 February 1996
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02190061
Nonlinear programming (90C30) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items
Cites Work
- On the convergence of an algorithm for discrete \(L_p\) approximation
- An algorithm for discrete linear \(L_ p\) approximation
- On two methods for discrete \(L_p\) approximation
- On minimum norm solutions
- Computational experiences with discrete L\(_p\)-approximation
- Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex norm
- Solutions of overdetermined linear equations which minimize error in an abstract norm
- Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm
- Iterative algorithm for the minimum fuel and minimum amplitude problems for linear discrete systems
- The calculation of linear best Lp approximations
- A Finite Algorithm for the Minimum $l_\infty $ Solution to a System of Consistent Linear Equations
- Calculation of linear bestL p -approximations
- Best L p Approximation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
