A globally most violated cutting plane method for complex minimax problems with application to digital filter design

DOI10.1007/BF02221588zbMath0799.65067OpenAlexW1969287520MaRDI QIDQ1315252

Alexander W. Potchinkov, Rembert Reemtsen

Publication date: 24 November 1994

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02221588

zbMATH Keywords

algorithmnumerical examplescutting plane methodcomplex minimax problemsconvex semi-infinite programming problemsgeneralized complex Chebyshev-approximation problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Semi-infinite programming (90C34) Approximation in the complex plane (30E10) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05)

Cites Work

• Unnamed Item
• A cutting plane method for solving minimax problems in the complex plane
• Some outer approximation methods for semi-infinite optimization problems
• A Fast Algorithm for Linear Complex Chebyshev Approximations
• Algorithm 631

This page was built for publication: A globally most violated cutting plane method for complex minimax problems with application to digital filter design