An accelerated central cutting plane algorithm for linear semi-infinite programming

Mathematical Programming

Volumn 101, Issue 3, 2004, Pages 479-495

  Betrò, Bruno ^a  

^a CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; OPTIMIZATION; PROBLEM SOLVING;

DUAL PROBLEM; LINEAR SEMI-INFINITE PROGRAMMING;

LINEAR PROGRAMMING;

EID: 24044435526     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-003-0492-5     Document Type: Article

References (15)

1. Bahn, O., Goffin J.L., Vial, J.Ph., Du Merle, O.: Experimental behavior of an interior point cutting plane algorithm for convex programming: an application to geometric programming. Disc. Appl. Math. 49, 3-23 (1994)
2. Betrò, B., Guglielmi, A.: Methods for global prior robustness under generalized moment conditions. In: Rios Insua, D., Ruggeri, F. (eds.), Robust Bayesian Analysis, Springer-Verlag, New York, 2000, pp. 273-293
3. den Hertog, D., Kaliski, J., Roos, C., Terlaky, T.: A logarithmic barrier cutting plane method for convex programming. Ann. Oper. Res. 58, 69-98 (1995)
4. Elzinga, J., Moore, Th.: A central cutting plane algorithm for the convex programming problem. Math. Program. 8, 134-145 (1975)
5. Glashoff, K., Gustafson, S.A.: Linear Optimization and Approximation. Springer-Verlag, Berlin, 1983
6. Goberna, M.A., López, M.A.: Linear Semi-Infinite Optimization. Wiley. New York, 1998
7. Hu, H.: A one-phase algorithm for semi-infinite linear programming. Math. Program. 46, 85-103 (1990)
8. Knüppel, O.: A PROFIL/BIAS implementation of a global minimization algorithm. Berichte des Forschungsschwerpunktes Informations- und Kommunikationstechnik 95.4, TU Hamburg-Marburg, 1995
9. Kortanek, K.O., Moulin P.: Semi-infinite programming in orthogonal wavelet filter design. In: Reemsten, R., Rückmann, J.J. (eds.), Semi-Infinite Programming, Kluwer Academic Publishers, Dordrecht, 1998, pp. 323-360
10. Kortanek, K.O., No, H.: A central cutting plane for convex semi-infinite programming problems. SIAM J. Optim. 3, 901-918 (1993)
11. Leon, T., Vercher E.: A purification algorithm for semi-infinite programming. Eur. J. Oper. Res. 57, 412-420 (1992)
12. Moulin, P., Anitescu M., Kortanek K.O., Potra F.A.: The role of linear semi-infinite programming in signal-adapted QMF bank design. IEEE Trans. Signal Processing 45, 2160-2174 (1997)
13. Potchinkov, A.W.: Design of optimal linear phase FIR filters by a semi-infinite programming technique. Signal Processing 58, 165-180 (1997)
14. Reemsten, R., Görner, S.: Numerical methods for semi-infinite programming: a survey. In: Reemsten, R., Rückmann, J.J. (eds.), Semi-Infinite Programming, Kluwer Academic Publishers, Dordrecht, 1998, pp. 195-275
15. Vial, J.P.: Computational experience with a primal-dual interior point method for smooth convex programming. Optim. Methods Softw. 3, 285-316 (1994)