Abstract.
An algorithm for linear semi-infinite programming is presented which accelerates the convergence of the central cutting plane algorithm first proposed in [4]. Compared with other algorithms, the algorithm in [4] has the advantage of being applicable under mild conditions and of providing feasible solutions. However its convergence has been shown to be rather slow in practical instances. The algorithm proposed in this paper introduces a simple acceleration scheme which gives faster convergence, as confirmed by several examples, as well as an interval of prefixed length containing the optimum value. It is also shown that the algorithm provides a solution of the dual problem and that it can be used for convex semi-infinite programming too.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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)
Betrò, B., Guglielmi, A.: Methods for global prior robustness under generalized moment conditions. In: Ríos Insua, D., Ruggeri, F. (eds.), Robust Bayesian Analysis, Springer-Verlag, New York, 2000, pp. 273–293
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)
Elzinga, J., Moore, Th.: A central cutting plane algorithm for the convex programming problem. Math. Program. 8, 134–145 (1975)
Glashoff, K., Gustafson, S.A.: Linear Optimization and Approximation. Springer-Verlag, Berlin, 1983
Goberna, M.A., López, M.A.: Linear Semi-Infinite Optimization. Wiley, New York, 1998
Hu, H.: A one-phase algorithm for semi-infinite linear programming. Math. Program. 46, 85–103 (1990)
Knüppel, O.: A PROFIL/BIAS implementation of a global minimization algorithm. Berichte des Forschungsschwerpunktes Informations- und Kommunikationstechnik 95.4, TU Hamburg-Harburg, 1995
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
Kortanek, K.O., No, H.: A central cutting plane for convex semi-infinite programming problems. SIAM J. Optim. 3, 901–918 (1993)
Leon, T., Vercher E.: A purification algorithm for semi-infinite programming. Eur. J. Oper. Res. 57, 412–420 (1992)
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)
Potchinkov, A.W.: Design of optimal linear phase FIR filters by a semi-infinite programming technique. Signal Processing 58, 165–180 (1997)
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
Vial, J.P.: Computational experience with a primal-dual interior point method for smooth convex programming. Optim. Methods Softw. 3, 285–316 (1994)
Author information
Authors and Affiliations
Corresponding author
Additional information
Mathematics Subject Classification (1991): 90C05, 90C34, 65K05, 90C51
Acknowledgments. The author whishes to thank the three anonymous referees and an associate editor for many useful comments and valuable suggestions.
Rights and permissions
About this article
Cite this article
Betrò, B. An accelerated central cutting plane algorithm for linear semi-infinite programming. Math. Program., Ser. A 101, 479–495 (2004). https://doi.org/10.1007/s10107-003-0492-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-003-0492-5