A cutting plane method for solving minimax problems in the complex plane
From MaRDI portal
Publication:1200545
DOI10.1007/BF02139477zbMath0756.65092MaRDI QIDQ1200545
Publication date: 16 January 1993
Published in: Numerical Algorithms (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Semi-infinite programming (90C34) Approximation in the complex plane (30E10) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05)
Related Items (9)
Some outer approximation methods for semi-infinite optimization problems ⋮ An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems ⋮ Uniform approximation of min/max functions by smooth splines ⋮ Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems ⋮ FIR filter design problems of simultaneous approximation of magnitude and phase and magnitude and group delay ⋮ An active set smoothing method for solving unconstrained minimax problems ⋮ Improved filter-SQP algorithm with active set for constrained minimax problems ⋮ An algorithm for complex linear approximation based on semi-infinite programming ⋮ A globally most violated cutting plane method for complex minimax problems with application to digital filter design
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A numerically stable dual method for solving strictly convex quadratic programs
- Ein Abstiegsverfahren für Approximationsaufgaben in normierten Räumen
- Conformal mappings onto prescribed regions via optimization techniques
- An algorithm for the construction of best approximations based on Kolmogorov's criterion
- Solving complex approximation problems by semiinfinite-finite optimization techniques: A study on convergence
- Uniform approximation as a numerical tool for constructing conformal maps
- Newton's method for convex programming and Tschebyscheff approximation
- New extremal properties for constructing conformal mappings
- Rational Chebyshev approximation on the unit disk
- Non-strong uniqueness in real and complex Chebyshev approximation
- Near-circularity of the error curve in complex Chebyshev approximation
- Discretization methods for the solution of semi-infinite programming problems
- The design of FIR filters in the complex plane by convex optimization
- Saddle points and overdetermined complex equations
- Best approximation with respect to nearby norms
- A Fast Algorithm for Linear Complex Chebyshev Approximations
- A Note on the Semi-Infinite Programming Approach to Complex Approximation
- An implementation of a discretization method for semi-infinite programming
- Solution of Systems of Complex Linear Equations in the $l_\infty $ Norm with Constraints on the Unknowns
- ALGORITHM 635
- 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
- Nonlinear Perturbation of Linear Programs
- A New Method for Chebyshev Approximation of Complex-Valued Functions
- Rate of Convergence of Discretization in Chebyshev Approximation
- A general Chebyshev complex function approximation procedure and an application to beamforming
- Complex Chebyshev Polynomials on Circular Sectors with Degree Six or Less
- Linear Chebyshev Approximation in the Complex Plane Using Lawson's Algorithm
- Linear Chebyshev Approximation of Complex-Valued Functions
- An algorithm of successive minimization in convex programming
- Numerical Chebyshev Approximation in the Complex Plane
This page was built for publication: A cutting plane method for solving minimax problems in the complex plane
