Methods of calculating l_ p-minimum norm solutions of consistent linear systems
From MaRDI portal
Methods of calculating \(l p\)-minimum norm solutions of consistent linear systems
A primal and dual Newton method is proposed for solving a problem of the form \(\min\{|x|^p_p/p;\) \(Ax= b\}\), where \(1< p< \infty\) and \(Ax= b\) is a consistent system of \(m\) linear equations in \(n\) unknowns, \(m\leq n\).
Recommendations
- Computing minimum norm solution of linear systems of equations by the generalized Newton method
- On minimum norm solutions
- On minimum norm problems
- scientific article; zbMATH DE number 869699
- Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems
Cites work
- A Finite Algorithm for the Minimum $l_\infty $ Solution to a System of Consistent Linear Equations
- An algorithm for discrete linear \(L_ p\) approximation
- Best L p Approximation
- Calculation of linear bestL p -approximations
- Computational experiences with discrete L\(_p\)-approximation
- scientific article; zbMATH DE number 3915531 (Why is no real title available?)
- scientific article; zbMATH DE number 3687182 (Why is no real title available?)
- scientific article; zbMATH DE number 3731221 (Why is no real title available?)
- scientific article; zbMATH DE number 194432 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Iterative algorithm for the minimum fuel and minimum amplitude problems for linear discrete systems
- Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm
- Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex norm
- On minimum norm solutions
- On the convergence of an algorithm for discrete L_p approximation
- On two methods for discrete \(L_p\) approximation
- Solutions of overdetermined linear equations which minimize error in an abstract norm
- The calculation of linear best Lp approximations
Cited in
(5)- Theorems of the alternative and duality
- Computing minimum norm solution of linear systems of equations by the generalized Newton method
- Minimum norm solutions to linear elastic analysis problems
- scientific article; zbMATH DE number 3863012 (Why is no real title available?)
- scientific article; zbMATH DE number 1086510 (Why is no real title available?)
This page was built for publication: Methods of calculating \(l_ p\)-minimum norm solutions of consistent linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1338558)
