Saddle points and overdetermined complex equations

DOI10.1016/0024-3795(85)90266-6zbMath0559.41020OpenAlexW2043776859MaRDI QIDQ2266193

Roy L. Streit

Publication date: 1985

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(85)90266-6

zbMATH Keywords

weightsconvex optimization problemChebyshev errorbest uniform norm solution of overdetermined complex valued systems of equations

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Approximation in the complex plane (30E10) Asymptotic representations in the complex plane (30E15) Approximation by arbitrary linear expressions (41A45)

Related Items (1)

A cutting plane method for solving minimax problems in the complex plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomials of Best Approximation on a Real Finite Point Set. I
• POLYNOMIALS OF BEST APPROXIMATION ON AN INTERVAL
• A Unified Approach to Certain Problems of Approximation and Minimization
• Rate of Convergence of Lawson's Algorithm
• The Lawson Algorithm and Extensions
• The Minimum Covering Sphere Problem

This page was built for publication: Saddle points and overdetermined complex equations