scientific article; zbMATH DE number 97998

zbMATH Open0768.65016MaRDI QIDQ4022264FDOQ4022264

Authors: Chen Ning, Jiasong Wang 

Publication date: 17 January 1993

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

linear programmingalgorithmnumerical experimentsunderdetermined systems of linear equations\(\ell\) infinity norm minimization

Mathematics Subject Classification ID

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

Cited In (10)

• On Generating Discrete Linear $l_\infty $ Test Problems
• Title not available (Why is that?)
• ALGORITHM 635
• Solution of Systems of Complex Linear Equations in the $l_\infty $ Norm with Constraints on the Unknowns
• Title not available (Why is that?)
• An algorithm for minimum L-infinity solution of under-determined linear systems
• Solve exactly an under determined linear system by minimizing least squares regularized with an \(\ell_0\) penalty
• Title not available (Why is that?)
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• An iterative parallel method for minimax problems

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)