Abstract
It is shown how the combined discretization and cutting plane method for general convex semi-infinite programming problems recently presented in [40] can be effectively implemented for the solution of minimax problems in the complex plane. In contrast to other approaches, the minimax problem does not have to be linearized. The performance of the algorithm is demonstrated by a number of highly accurate numerical examples.
Similar content being viewed by others
References
I. Barrodale, Best approximation of complex-valued data, in:Numerical Analysis, ed. G.A. Watson (Springer, Berlin/Heidelberger/New York, 1978) pp. 14–22.
I. Barrodale, L.M. Delves and J.C. Mason, Linear Chebyshev approximation of complex-valued functions, Math. Comp. 32 (1978) 853–863.
H.-P. Blatt, U. Kaiser and B. Ruffer-Beedgen, A multiple exchange algorithm in convex programming, in:Optimization: Theory and Applications, eds. J.-B. Hiriart-Urruty, W. Oettli and J. Stoer, Lecture Notes in Pure and Applied Mathematics, vol. 86 (Marcel Dekker, New York/Basel, 1983) pp. 113–130.
E.W. Cheney,Introduction to Approximation Theory, 2nd ed. (Chelsea, New York, 1986).
E.W. Cheney and A.A. Goldstein, Newton's method for convex programming and Tchebycheff approximation, Numer. Math. 1 (1959) 253–268.
C.B. Dunham and J. Williams, Rate of convergence of discretization in Chebyshev approximation, Math. Comp. 37 (1981) 135–139.
S.W. Ellacott and J. Williams, Linear Chebyshev approximation in the complex plane using Lawson's algorithm, Math. Comp. 30 (1976) 35–44.
K. Glashoff and K. Roleff, A new method for Chebyshev approximation of complex-valued functions, Math. Comp. 36 (1981) 233–239.
D. Goldfarb and A. Idnani, A numerically stable dual method for solving strictly convex quadratic programs, Math. Progr. 27 (1983) 1–33.
G.M. Gramlich, SQP-Methoden für semiinfinite Optimierungsprobleme, Ph.D. Thesis, Fachbereich Mathematik, Universität Trier (April 1990).
U. Grothkopf and G. Opfer, Complex Chebyshev polynomials on circular sectors with degree six or less, Math. Comp. 39 (1982) 599–615.
M.H. Gutknecht, Ein Abstiegsverfahren für gleichmässige Approximation, mit Anwendungen, Ph.D. Thesis, Eidgenössische Technische Hochschule Zürich (1973).
M.H. Gutknecht, Ein Abstiegsverfahren für nicht-diskrete Tschebyscheff-Approximationsprobleme, in:Numerische Methoden der Approximationstheorie, vol. 4, eds. L. Collatz, G. Meinardus and H. Werner (Birkhäuser, 1978) pp. 154–171.
M.H. Gutknecht, Non-strong uniqueness in real and complex Chebyshev approximation, J. Approx. Theory 23 (1978) 204–213.
M. Hartmann and G. Opfer, Uniform approximation as a numerical tool for constructing conformal maps, J. Comput. Appl. Math. 14 (1986) 193–206.
R. Hettich, An implementation of a discretization method for semi-infinite programming, Math. Progr. 34 (1986) 354–361.
R. Hettich and P. Zencke,Numerische Methoden der Approximation und semi-infiniten Optimierung, (B. G. Teubner, Stuttgart, 1982).
V. Klotz, Polynomiale und rationale Tschebyscheff-Approximation in der komplexen Ebene, Ph. D. Thesis, Friedrich-Alexander-Universität, Erlangen-Nürnberg (1974).
K.O. Kortanek and Hoon No, A central cutting plane algorithm for convex semi-infinite programming problems, Working Paper Series No. 90-08, College of Business Administration, The University of Iowa, Iowa City, Iowa (revised February 1992).
W. Krabs and G. Opfer, Eine Methode zur Lösung des komplexen Approximationsproblems mit einer Anwendung auf konforme Abbildungen. ZAMM 55 (1975) T208-T211.
B.R. Kripke, Best approximation with respect to nearby norms, Numer. Math. 6 (1964) 103–105.
P.J. Laurent and C. Carasso, An algorithm of successive minimization in convex programming, R.A.I.R.O., Analyse numérique, Numer. Anal. 12 (1978) 377–400.
O.L. Mangasarian and R.R. Meyer, Nonlinear perturbation of linear programs, SIAM J. Control Optim. 17 (1979) 745–752.
J.C. Mason and G. Opfer, An algorithm for complex polynomial approximation with nonlinear constraints, in:Approximation Theory V, eds. C.K. Chu, L. Schumaker and J. Ward (Academic Press, New York, 1986) pp. 471–474.
J.C. Mason and P. Owen, Some simple algorithms for constrained complex and rational approximation, in:Algorithms for Approximation, eds. J.C. Mason and M.G. Cox (Clarendon Press, 1987) pp. 357–369.
J.C. Mason and S.J. Wilde, Constrained complex approximation algorithms in communication engineering, in:Algorithms for Approximation II, eds. J.C. Mason and M.G. Cox (Chapman and Hill, London/New York, 1990) pp. 424–448.
J.C. Mason and S.J. Wilde, A complex minimax algorithm for phase-only adaptation in antenna arrays, in:Algorithms for Approximation II, eds. J.C. Mason, and M.G. Cox (Chapman and Hill, London/New York, 1990) pp. 466–475.
J.C. Mason, S.J. Wilde and G. Opfer, Constrained minimax and least squares problems in antenna array pattern synthesis, Technical Note COMAG 1/87, Royal Military College of Science, Computational Mathematics Group, Shrivenham, Swindon, Wiltshire, England (1987).
G. Meinardus,Approximation of Functions: Theory and Numerical Methods (Springer, Berlin/Heidelberg/New York, 1967).
G. Opfer, An algorithm for the construction of best approximations based on Kolmogorov's criterion, J. Approx. Theory 23 (1978) 299–317.
G. Opfer, New extremal properties for constructing conformal mappings, Numer. Math. 32 (1979) 423–429.
G. Opfer, Conformal mappings onto prescribed regions via optimization techniques, Numer. Math. 35 (1980) 189–200.
G. Opfer, Solving complex approximation problems by semiinfinite-finite optimization techniques: a study on convergence, Numer. Math. 39 (1982) 411–420.
G. Opfer, Anwendung komplexer Approximation auf die Lösung linearer Gleichungssysteme mit der Richardson-Iteration, ZAMM 63 (1983) T367-T369.
G. Opfer, Numerische Behandlung komplexer Approximationsaufgaben, Nova Acta Leopoldina NF 61, 267 (1989) 75–80.
P.R. Owen and J.C. Mason, The use of linear programming in the design of antenna patterns with prescribed nulls and other constraints, Int. J. Comp. Math. in EEE 3 (1984) 201–215.
T.W. Parks and C.S. Burrus,Digital Filter Design (Wiley, New York, 1987).
A. Potchinkov and R. Reemtsen, The design of FIR filters in the complex domain by a semi-infinite programming technique, Preprint, Technische Universität Berlin (April 1992).
R. Reemtsen, Discretization methods for the solution of semi-infinite programming problems, J. Optim. Theory Appl. 71 (1991) 85–103.
R. Reemtsen, Outer approximation methods for semi-infinite optimization problems, Preprint No. 280/1991, Fachbereich Mathematik, TU Berlin, 1000 Berlin 12 (1991).
R. Schultz, Ein Abstiegsverfahren für Approximationsaufgaben in normierten Räumen, Ph.D. Thesis, Universität Hamburg, Hamburg (1977).
M.S. Sherrill and R.L. Streit, In situ optimal reshading of arrays with failed elements, IEEE. J. Oceanic Eng. 12 (1987) 155–162.
C. Spagl, Charakterisierung und Numerik in der linearen komplexen Tschebyscheff-Approximation, Ph.D. Thesis, Mathematisch-Geographische Fakultät, Katholische Universität Eichstätt (1988).
R.L. Streit, Algorithm 635. An algorithm for the solution of systems of complex linear equations in the L∞ norm with constraints on the unknowns, ACM Trans. Math. Software 11 (1985) 242–249.
R.L. Streit, Saddle points and overdetermined complex equations, Lin. Alg. Appl. 64 (1985) 57–76.
R.L. Streit, Solution of systems of complex linear equations in the l∞ norm with constraints on the unknowns, SIAM J. Sci. Stat. Comput. 7 (1986) 132–149.
R.L. Streit and A.H. Nuttall, A general Chebyshev complex function approximation procedure and an application to beamforming, J. Acoust. Soc. Amer. 72 (1982) 181–190.
R.L. Streit and A.H. Nuttall, A note on the semi-infinite programming approach to complex approximation, Math. Comp. 40 (1983) 599–605.
P.T.P. Tang, Chebyshev approximation on the complex plane, Ph.D. thesis, Department of Mathematics, University of California at Berkeley (May 1987).
P.T.P. Tang, A fast algorithm for linear complex Chebyshev approximations, Math. Comp. 51 (1988) 721–739.
P.T.P. Tang, A fast algorithm for linear complex Chebyshev approximation, in:Algorithms for Approximation II, eds. J.C. Mason and M.G. Cox (Chapman and Hill, London/New York, 1990) pp. 265–273.
L.N. Trefethen, Near circularity of the error curve in complex Chebyshev approximation, J. Approx. Theory 31 (1981) 344–366.
L.N. Trefethen, Rational Chebyshev approximation on the unit disk, Numer. Math. 37 (1981) 297–320.
G.A. Watson, A method for the Chebyshev solution of an overdetermined system of complex linear equations, IMA J. Numer. Anal. 8 (1988) 461–471.
G.A. Watson, Numerical methods for Chebyshev approximation of complex-valued functions, in:Algorithms for approximation II, eds. J.C. Mason and M.G. Cox (Chapman and Hill, London/New York, 1990) pp. 246–264.
J. Williams, Numerical Chebyshev approximation in the complex plane, SIAM J. Numer. Anal. 9 (1972) 638–649.
Author information
Authors and Affiliations
Additional information
Communicated by M.H. Gutknecht
Rights and permissions
About this article
Cite this article
Reemtsen, R. A cutting plane method for solving minimax problems in the complex plane. Numer Algor 2, 409–436 (1992). https://doi.org/10.1007/BF02139477
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02139477