A new exchange method for convex semi-infinite programming

SIAM Journal on Optimization

Volumn 20, Issue 6, 2010, Pages 2959-2977

  Zhang, Liping ^a   Wu, Soon Yi ^b,c   López, Marco A ^d  

^a TSINGHUA UNIVERSITY   (China)

^b NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

^c NATIONAL CENTER FOR THEORETICAL SCIENCES   (Taiwan)

^d UNIVERSITY OF ALICANTE   (Spain)

Author keywords

Adding dropping rules; Complex approximation theory; Convex semi infinite programming; Exchange methods; Filter design

Indexed keywords

ADDING-DROPPING RULES; COMPLEX APPROXIMATION THEORY; EXCHANGE METHODS; FILTER DESIGNS; SEMI INFINITE PROGRAMMING;

APPROXIMATION THEORY; DESIGN; FILTER BANKS; FIR FILTERS; LAGRANGE MULTIPLIERS; OPTIMIZATION;

APPROXIMATION ALGORITHMS;

EID: 79251504635     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/090767133     Document Type: Article

References (33)

1. A. Auslender, M. A. Goberna, and M. A. López, Penalty and smoothing methods for convex semi-infinite programming, Math. Oper. Res., 34 (2009), pp. 303-319.
2. I. Barrodale, L. M. Delves, and J. C. Mason, Linear Chebyshev approximation of complexvalued functions, Math. Comp., 32 (1978), pp. 853-863.
3. B. Betrò, An accelerated central cutting plane algorithm for linear semi-infinite programming, Math. Program., 101 (2004), pp. 479-495.
4. E. W. Cheney, Introduction to Approximation Theory, 2nd ed., Chelsea, New York, 1982.
5. I. D. Coope and G. A. Watson, A projected Lagrangian algorithm for semi-infinite programming, Math. Program., 32 (1985), pp. 337-356.
6. H. H. Dam, K. L. Teo, S. Nordebo, and A. Cantoni, The dual parameterization approach to optimal least square FIR filter design subject to maximum error constraints, IEEE Trans. Signal Process., 48 (2000), pp. 2314-2320.
7. A. V. Fiacco and K. O. Kortanek, Semi-Infinite Programming and Applications, Lecture Notes in Econ. and Math. Systems 215, Springer, New York, 1983.
8. K. Glashoff and S. A. Gustafon, Linear Optimization and Application, Springer, Berlin, 1983.
9. K. Glashoff and K. Roleff, A new method for Chebyshev approximation of complex-valued functions, Math. Comp., 36 (1981), pp. 233-239.
10. M. A. Goberna and M. A. López, Linear Semi-Infinite Optimization, Wiley, New-York, 1998.
11. M. A. Goberna and M. A. López, Linear semi-infinite programming theory: An updated survey, European J. Oper. Res., 143 (2002), pp. 390-405.
12. C. Gonzaga, E. Polak, and R. Trahan, An improved algorithm for optimization problems with functional inequality constraints, IEEE Trans. Automat. Control, 25 (1980), pp. 49-54.
13. R. Hettich and K. O. Kortanek, Semi-infinite programming: Theory, methods and applications, SIAM Rev., 35 (1993), pp. 380-429.
14. R. Hettich, An implementation of a discretization method for semi-infinite programming, Math. Program., 34 (1986), pp. 354-361.
15. R. Hettich and G. Gramlich, A note on an implementation of a method for quadratic semiinfinite programming, Math. Program., 46 (1990), pp. 249-254.
16. D. Klatte and R. Henrion, Regularity and stability in nonlinear semi-infinite optimization, in Semi-Infinite Programming, R. Reemsten and J. Rückmann, eds., Kluwer Academic Publishers, Boston, 1998, pp. 69-99.
17. K. O. Kortanek and H. No, A central cutting plane algorithm for convex semi-infinite programming problems, SIAM J. Optim., 3 (1993), pp. 901-918.
18. R. T. Kreyszig, Advanced Engineering Mathematics, Wiley, New York, 1993.
19. H.-C. Lai and S.-Y. Wu, On linear semi-infinite programming problems-an algorithm, Numer. Funct. Anal. Optim., 13 (1992), pp. 287-304.
20. P. J. Laurent and C. Carasso, An algorithm of successive minimization in convex programming, Numer. Anal., 12 (1978), pp. 377-400.
21. M. A. López and G. Still, Semi-infinite programming, European J. Oper. Res., 80 (2007), pp. 491-518.
22. D. G. Luenberger, Linear and Nonlinear Programming, 2nd ed., Kluwer Academic Publishers, Boston/Dordrecht/London, 2004.
23. H. Mine, M. Fukushima, and Y. Tanaka, On the use of ?-most-active constraints in an exact penalty function method for nonlinear optimization, IEEE Trans. Automat. Control, 29 (1984), pp. 1040-1042.
24. C. J. Price and I. D. Coope, Numerical experiments in semi-infinite programming, Comput. Optim. Appl., 6 (1996), pp. 169-189.
25. E. Polak, On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems, Math. Program., 62 (1993), pp. 385-414.
26. A. Potchinkov and R. Reemsten, The design of FIR filter in the complex plane by convex optimization, Signal Process., 46 (1995), pp. 127-146.
27. R. Reemsten and S. Görner, Numerical methods for semi-infinite programming: A survey, in Semi-Infinite Programming, R. Reemsten and J. Rückmann, eds., Kluwer Academic Publishers, Boston, 1998, pp. 195-275.
28. O. Stein and G. Still, Solving semi-infinite optimization problems with interior point techniques, SIAM J. Control Optim., 42 (2003), pp. 769-788.
29. G. Still, Discretization in semi-infinite programming: The rate of convergence, Math. Program., 91 (2001), pp. 53-69.
30. K. L. Teo, X. Q. Yang, and L. S. Jennings, Computational discretization algorithms for functional inequality constrained optimization, Ann. Oper. Res., 28 (2000), pp. 215-234.
31. Y. Liu and K. L. Teo, An adaptive dual parametrization algorithm for quadratic semi-infinite programming problems, J. Global Optim., 24 (2002), pp. 205-217.
32. R. Tichatschke and V. Nebeling, A cutting plane method for quadratic semi-infinite programming problems, Optimization, 19 (1988), pp. 803-817.
33. G. A. Watson, Numerical experiments with globally convergent methods for semi-infinite programming problems, in Semi-infinite Programming and Applications, Lecture Notes in Econ. and Math. Systems 215, A.V. Fiacco, K. O. Kortanek, eds., Springer, New York, 1983, pp. 193-205.