Pages that link to "Item:Q1200545"
From MaRDI portal
The following pages link to A cutting plane method for solving minimax problems in the complex plane (Q1200545):
Displaying 12 items.
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems (Q481052) (← links)
- Uniform approximation of min/max functions by smooth splines (Q651900) (← links)
- An active set smoothing method for solving unconstrained minimax problems (Q779576) (← links)
- Modified cutting plane method for minimization of a convex function (Q1280984) (← links)
- An algorithm for complex linear approximation based on semi-infinite programming (Q1315207) (← links)
- A globally most violated cutting plane method for complex minimax problems with application to digital filter design (Q1315252) (← links)
- Some outer approximation methods for semi-infinite optimization problems (Q1343650) (← links)
- A cutting method for finding discrete minimax with dropping of cutting planes (Q2263093) (← links)
- Improved filter-SQP algorithm with active set for constrained minimax problems (Q2336309) (← links)
- An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems (Q2439373) (← links)
- FIR filter design problems for simultaneous approximation of magnitude and phase and magnitude and group delay (Q2731608) (← links)
- (Q5072169) (← links)