scientific article; zbMATH DE number 97998

MaRDI QIDQ4022264zbMATH OpenFDO

Authors Chen Ning, Jiasong Wang

Publication date 17 January 1993

zbMATH Keywords

\(\ell\) infinity norm minimizationalgorithmlinear programmingnumerical experimentsunderdetermined systems of linear equations

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Recommendations

• An algorithm for minimum L-infinity solution of under-determined linear systems
• scientific article; zbMATH DE number 465458
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• The Minimax Solution of Linear Equations Subject to Linear Constraints
• Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems

Cited in

(11)

• Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems
• An algorithm for minimum L-infinity solution of under-determined linear systems
• scientific article; zbMATH DE number 4146762 (Why is no real title available?)
• Solution of Systems of Complex Linear Equations in the $l_\infty $ Norm with Constraints on the Unknowns
• ALGORITHM 635
• On Generating Discrete Linear $l_\infty $ Test Problems
• scientific article; zbMATH DE number 37926 (Why is no real title available?)
• scientific article; zbMATH DE number 465458 (Why is no real title available?)
• An iterative parallel method for minimax problems
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Solve exactly an under determined linear system by minimizing least squares regularized with an _0 penalty

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4022264)