A cutting plane method for solving minimax problems in the complex plane
From MaRDI portal
The author's recent discretization and cutting plane method for general convex semi-infinite programming problems is implemented for the solution of a minimax problem in the complex plane; the problem need not be linearized. The method is illustrated on several examples.
Recommendations
- scientific article; zbMATH DE number 996545
- 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; zbMATH DE number 4176856
- 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
Cites work
- A Fast Algorithm for Linear Complex Chebyshev Approximations
- A general Chebyshev complex function approximation procedure and an application to beamforming
- A Method for the Chebyshev Solution of an Overdetermined System of Complex Linear Equations
- A New Method for Chebyshev Approximation of Complex-Valued Functions
- A Note on the Semi-Infinite Programming Approach to Complex Approximation
- A numerically stable dual method for solving strictly convex quadratic programs
- ALGORITHM 635
- An algorithm for the construction of best approximations based on Kolmogorov's criterion
- An algorithm of successive minimization in convex programming
- An implementation of a discretization method for semi-infinite programming
- Best approximation with respect to nearby norms
- Complex Chebyshev Polynomials on Circular Sectors with Degree Six or Less
- Conformal mappings onto prescribed regions via optimization techniques
- Discretization methods for the solution of semi-infinite programming problems
- Ein Abstiegsverfahren für Approximationsaufgaben in normierten Räumen
- scientific article; zbMATH DE number 3834771 (Why is no real title available?)
- scientific article; zbMATH DE number 3843064 (Why is no real title available?)
- scientific article; zbMATH DE number 4149477 (Why is no real title available?)
- scientific article; zbMATH DE number 3979662 (Why is no real title available?)
- scientific article; zbMATH DE number 3988596 (Why is no real title available?)
- scientific article; zbMATH DE number 4029351 (Why is no real title available?)
- scientific article; zbMATH DE number 3755766 (Why is no real title available?)
- scientific article; zbMATH DE number 19425 (Why is no real title available?)
- scientific article; zbMATH DE number 19426 (Why is no real title available?)
- scientific article; zbMATH DE number 19438 (Why is no real title available?)
- scientific article; zbMATH DE number 48566 (Why is no real title available?)
- scientific article; zbMATH DE number 3473169 (Why is no real title available?)
- scientific article; zbMATH DE number 3598907 (Why is no real title available?)
- scientific article; zbMATH DE number 3436516 (Why is no real title available?)
- scientific article; zbMATH DE number 194309 (Why is no real title available?)
- scientific article; zbMATH DE number 3994877 (Why is no real title available?)
- scientific article; zbMATH DE number 3244284 (Why is no real title available?)
- Linear Chebyshev Approximation in the Complex Plane Using Lawson's Algorithm
- Linear Chebyshev Approximation of Complex-Valued Functions
- Near-circularity of the error curve in complex Chebyshev approximation
- New extremal properties for constructing conformal mappings
- Newton's method for convex programming and Tschebyscheff approximation
- Non-strong uniqueness in real and complex Chebyshev approximation
- Nonlinear Perturbation of Linear Programs
- Numerical Chebyshev Approximation in the Complex Plane
- Rate of Convergence of Discretization in Chebyshev Approximation
- Rational Chebyshev approximation on the unit disk
- Saddle points and overdetermined complex equations
- Solution of Systems of Complex Linear Equations in the $l_\infty $ Norm with Constraints on the Unknowns
- Solving complex approximation problems by semiinfinite-finite optimization techniques: A study on convergence
- The design of FIR filters in the complex plane by convex optimization
- THE USE OF LINEAR PROGRAMMING IN THE DESIGN OF ANTENNA PATTERNS WITH PRESCRIBED NULLS AND OTHER CONSTRAINTS
- Uniform approximation as a numerical tool for constructing conformal maps
Cited in
(12)- Modified cutting plane method for minimization of a convex function
- 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
- Some outer approximation methods for semi-infinite optimization problems
- A cutting method for finding discrete minimax with dropping of cutting planes
- Improved filter-SQP algorithm with active set for constrained minimax problems
- An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems
- 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
- scientific article; zbMATH DE number 7514021 (Why is no real title available?)
- Uniform approximation of min/max functions by smooth splines
- An active set smoothing method for solving unconstrained minimax problems
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)
