An algorithm for non-negative norm minimal solutions
From MaRDI portal
Recommendations
- An algorithm for non—negative least error minimal norm solutions
- An algorithm for finding nonnegative minimal norm solutions of linear systems
- Chebyshev and L1solutions of overdetermined systems of linear equations with bounded variables
- An algorithm for computing nonnegative minimal norm solutions
- scientific article; zbMATH DE number 24382
Cites work
- A subgradient projection algorithm
- Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
- An algorithm for best approximate solutions of Ax=b with a smooth strictly convex norm
- An overdetermined linear system
- Computational experiences with discrete L\(_p\)-approximation
- scientific article; zbMATH DE number 3423018 (Why is no real title available?)
- scientific article; zbMATH DE number 3159112 (Why is no real title available?)
- scientific article; zbMATH DE number 3849762 (Why is no real title available?)
- scientific article; zbMATH DE number 3690528 (Why is no real title available?)
- scientific article; zbMATH DE number 883145 (Why is no real title available?)
- scientific article; zbMATH DE number 3257775 (Why is no real title available?)
- 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 an algorithm for best approximate solutions to Av=b in normed linear spaces
- On the convergence of an algorithm for discrete L_p approximation
- Solutions of overdetermined linear equations which minimize error in an abstract norm
- The calculation of linear best Lp approximations
- The Numerical Solution of Constrained Linear Least-squares Problems
Cited in
(15)- The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
- Duality theorem for a generalized Fermat-Weber problem
- Theorems of the alternative and duality
- Least squares methods to minimize errors in a smooth, strictly convex norm on \({\mathbb{R}}^ m\)
- Revisiting the minimum-norm problem
- Binary solutions for overdetermined systems of linear equations
- An algorithm for finding nonnegative minimal norm solutions of linear systems
- An algorithm for approximation by elements of a cone in a banach space
- An algorithm for computing nonnegative minimal norm solutions
- A least distance algorithm for a smooth strictly convex norm
- An Algorithm For A Minimum Norm Solution Of A System Of Linear Inequalities
- An algorithm for non—negative least error minimal norm solutions
- Finding the Minimal Root of an Equation
- An algorithmic proof of Brégman–Minc theorem
- Linear M-estimation with bounded variables
This page was built for publication: An algorithm for non-negative norm minimal solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777326)
