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

DOI10.1007/BF02139477zbMATH Open0756.65092MaRDI QIDQ1200545FDOQ1200545

Rembert Reemtsen

Publication date: 16 January 1993

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

Recommendations

• scientific article
• scientific article; zbMATH DE number 4005983
• A cutting method for finding discrete minimax with dropping of cutting planes
• A Cutting Plane Algorithm for Min-Max Fractional Programming
• scientific article
• A cutting plane theory for mixed integer optimization
• Modified cutting plane method for minimization of a convex function
• On the solution of variational inequality problems by using cutting plane methods
• scientific article; zbMATH DE number 219017
• A cutting plane method from analytic centers for stochastic programming

zbMATH Keywords

numerical examplescutting plane methodminimax problemconvex semi-infinite programming

Mathematics Subject Classification ID

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

Cites Work

• A numerically stable dual method for solving strictly convex quadratic programs
• Solution of Systems of Complex Linear Equations in the $l_\infty $ Norm with Constraints on the Unknowns
• Title not available (Why is that?)
• An implementation of a discretization method for semi-infinite programming
• Newton's method for convex programming and Tschebyscheff approximation
• Title not available (Why is that?)
• A New Method for Chebyshev Approximation of Complex-Valued Functions
• Title not available (Why is that?)
• Discretization methods for the solution of semi-infinite programming problems
• Rational Chebyshev approximation on the unit disk
• Nonlinear Perturbation of Linear Programs
• Solving complex approximation problems by semiinfinite-finite optimization techniques: A study on convergence
• New extremal properties for constructing conformal mappings
• Conformal mappings onto prescribed regions via optimization techniques
• Title not available (Why is that?)
• The design of FIR filters in the complex plane by convex optimization
• Near-circularity of the error curve in complex Chebyshev approximation
• Ein Abstiegsverfahren für Approximationsaufgaben in normierten Räumen
• An algorithm for the construction of best approximations based on Kolmogorov's criterion
• Title not available (Why is that?)
• Title not available (Why is that?)
• Best approximation with respect to nearby norms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Linear Chebyshev Approximation in the Complex Plane Using Lawson's Algorithm
• Title not available (Why is that?)
• Rate of Convergence of Discretization in Chebyshev Approximation
• Non-strong uniqueness in real and complex Chebyshev approximation
• Title not available (Why is that?)
• ALGORITHM 635
• Title not available (Why is that?)
• A general Chebyshev complex function approximation procedure and an application to beamforming
• Complex Chebyshev Polynomials on Circular Sectors with Degree Six or Less
• Uniform approximation as a numerical tool for constructing conformal maps
• A Note on the Semi-Infinite Programming Approach to Complex Approximation
• Linear Chebyshev Approximation of Complex-Valued Functions
• Saddle points and overdetermined complex equations
• A Fast Algorithm for Linear Complex Chebyshev Approximations
• Title not available (Why is that?)
• THE USE OF LINEAR PROGRAMMING IN THE DESIGN OF ANTENNA PATTERNS WITH PRESCRIBED NULLS AND OTHER CONSTRAINTS
• A Method for the Chebyshev Solution of an Overdetermined System of Complex Linear Equations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An algorithm of successive minimization in convex programming
• Title not available (Why is that?)
• Numerical Chebyshev Approximation in the Complex Plane

Cited In (12)

• Uniform approximation of min/max functions by smooth splines
• A cutting method for finding discrete minimax with dropping of cutting planes
• Some outer approximation methods for semi-infinite optimization problems
• Improved filter-SQP algorithm with active set for constrained minimax problems
• An algorithm for complex linear approximation based on semi-infinite programming
• An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems
• A globally most violated cutting plane method for complex minimax problems with application to digital filter design
• FIR filter design problems for simultaneous approximation of magnitude and phase and magnitude and group delay
• Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
• An active set smoothing method for solving unconstrained minimax problems
• Modified cutting plane method for minimization of a convex function
• Title not available (Why is that?)

Uses Software

• CAPROX

This page was built for publication: A cutting plane method for solving minimax problems in the complex plane

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