Abstract
In the first part of the paper a logarithmic barrier method for solving convex semi-infinite programming problems with bounded solution set is considered. For that the solution of a non-differentiable optimization problem by means of a logarithmic barrier method is suggested. The arising auxiliary problems are solved, for instance, via a bundle method. In the second part of the paper a regularized logarithmic barrier method for solving convex semi-infinite problems with unbounded solution set is considered, which is based on the method from the first part. The properties and the behaviour of the presented methods are studied and numerical results are given.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. Abbe. Two logarithmic barrier methods for convex semi-infinite pro gramming problems, Forschungsbericht 99–30, Universität Trier, 1999.
M. C. Ferris and A. B. Philpott. An interior point algorithm for semi infinite linear programming, Mathematical Programming, A43:257–276, 1989.
A. V. Fiacco and K. O. Kortanek, editors. Semi-Infinite Programming and Applications, University of Trier, Volume 215 of Lecture Notes in Economics and Mathematical Systems, Springer, 1983.
A. V. Fiacco and G. P. McCormick. Nonlinear Programming: Sequential Unconstrained Minimization Techniques, Wiley, 1968.
R. Fletcher. A general quadratic programming algorithm, Journal of the Institute of Mathematics and its Application, 7:76–91, 1971.
K. R. Frisch. The logarithmic potential method of convex programming. Technical report, University Institute of Economics, Oslo, 1955.
R. Hettich (editor). Semi-Infinite Programming, Volume 15 of Lecture Notes in Control and Information Sciences, Springer, 1979.
J.-B. Hiriart-Urruty and C. Lemaréchal. Convex Analysis and Minimization Algorithms II, Springer, 1993.
A. Kaplan and R. Tichatschke. Stable Metlwds for Ill-posed Variational Problems, Akademie-Verlag, Berlin, 1994.
A. Kaplan and R. Tichatschke. Proximal Interior Point Approach for Convex Semi-infinite Programming Problems. Forschungsbericht 98–09, Universität Trier, 1998. Submitted to Optimization Methods & Software.
A. Kaplan and R. Tichatschke. Proximal Interior Point Approach in Con vex Programming, Optimization, 45:117–148, 1999.
K. C. Kiwiel. Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities. Mathe matical Programming, A69:89–109, 1995.
K. O. Kortanek and P. Moulin. Semi-infinite programming in orthogonal wavelet filter design, In Reemtsen and Rückmann [16], pages 323–360, 1998.
B. Martinet. Régularisation d’inéquations variationelles par approxi mations successives, Revue Française d’Informatique et de Recherche Opérationnelle, 4:159–180, 1970.
E. Polak. On the mathematical foundations of nondifferentiable optimiza tion in engineering design, SIAM Review, 29:21–89, 1987.
R. Reemtsen and J.-J. Rückmann (editors). Semi-Infinite Programming. Nonconvex Optimization and its Applications, Kluwer, 1998.
R. T. Rockafellar. Convex Analysis. Princeton University Press, Princeton, 1972.
U. Schattier. An interior-point method for semi-infinite programming problems, Annals of Operations Research, 62:277–301, 1996.
G. Sonnevend. Applications of analytic centers for the numerical solu tion of semiinfinite, convex programs arising in control theory. In H.-J. Sebastian and K. Tammer, editors, System Modelling and Optimization, Volume 143 of Lecture Notes in Control and Information Sciences, pages 413–422, Springer, 1990.
G. Sonnevend. A new class of a high order interior point method for the solution of convex semiinfinite optimization problems. In R. Bulirsch and D. Kraft, editors, Computational and Optimal Control, pages 193–211, Birkhäuser, Basel, 1994.
M. J. Todd. Interior-point algorithms for semi-infinite programming, Mathematical Programming, A65:217–245, 1995.
M. H. Wright. Interior methods for constrained optimization, Acta Nu merica, 341–407, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Abbe, L. (2001). Two Logarithmic Barrier Methods for Convex Semi-Infinite Problems. In: Goberna, M.Á., López, M.A. (eds) Semi-Infinite Programming. Nonconvex Optimization and Its Applications, vol 57. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3403-4_8
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3403-4_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5204-2
Online ISBN: 978-1-4757-3403-4
eBook Packages: Springer Book Archive