Solution of Systems of Complex Linear Equations in the l_\infty Norm with Constraints on the Unknowns

DOI10.1137/0907010zbMATH Open0612.65021OpenAlexW2095033315MaRDI QIDQ3753387FDOQ3753387

Roy L. Streit

Publication date: 1986

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0907010

zbMATH Keywords

convex constraintssemi-infinite programmingcomplex approximationChebyshev solutioncomplex linear equations

Mathematics Subject Classification ID

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

Cited In (6)

• Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
• Proximity control in bundle methods for convex nondifferentiable minimization
• Proxy-GMRES: Preconditioning via GMRES in Polynomial Space
• Novel approach to accelerating Newton's method for sup-norm optimization arising in \(H^ \infty\)-control
• A cutting plane method for solving minimax problems in the complex plane
• The feasible set algorithm for least median of squares regression

   Recommendations

• ALGORITHM 635 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The Minimax Solution of Linear Equations Subject to Linear Constraints 👍 👎
• A Method for the Chebyshev Solution of an Overdetermined System of Complex Linear Equations 👍 👎

This page was built for publication: Solution of Systems of Complex Linear Equations in the $l_\infty $ Norm with Constraints on the Unknowns

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