Abstract
The aim of this paper is to sketch briefly the main ideas that are fundamental in the different types of methods for solving semi-infinite problems and to discuss several difficulties that are inherent in some of them. At the same time, this gives the possibility to compare several methods and to decide in which situation they profitably can be applied. It appears that a partition of the methods in two classes is appropriate: On the one side methods suitable to improve a “good” approximation to the solution efficiently and, on the other side, those being appropriate to compute those good approximations to the solution. This suggests two phase-methods for solving semi-infinite problems. A number of examples are given to illustrate the complexity of the problems and the performance and efficiency of the methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cheney, E.W., and Goldstein, A.A.: Newton’s method for convex programming and Tchebycheff approximation: Numer.Math. 1 (1959), 253–268
Cromme, L: Eine Klasse von Verfahren zur Ermittlung bester nicht-linearer Tschebyscheff-Approximation: Numer. Math. 25 (1976), 447–459
Elzinga, J., and Moore, TH.G.: A central cutting plane algorithm for the convex programming problem: Math. Programming 8 (1975), 134–145
Geiger, C.: Zur Konvergenz eines Abstiegsverfahrens für nicht-lineare gleichmäßige Approximationsaufgaben: Univ. Hamburg, preprint 77/14, 1977
Gribik, P.R.: A central cutting plane algorithm for semiinfinite programming problems, in: Hettich (ed): Semi-infinite programming, Springer, Berlin-Heidelberg-New-York, 1979, 66–82
Gustafson, S.A.: On the computational solution of a class of generalized moment problems: SIAM J. Numer. Anal. 7 (1970), 343–357
Gutknecht, M.: Ein Abstiegsverfahren für nicht-diskrete Tschebyscheff-Approximationsprobleme, in: Collatz et al. (eds.): Numer. Meth. der Approximationstheorie 4: Birkhäuser, Basel-Stuttgart, ISNM 42 (1978), 154–171
Hettich, R.: A Newton method for nonlinear Chebyshev approximation, in: Schaback; Scherer (eds.): Approximation Theory, Springer, Berlin-Heidelberg-New-York 1976, 222–236
Hettich, R., and Van Honstede, W.: On quadratically convergent methods for semi-infinite programming, in: Hettich (ed.): Semi-infinite programming, Springer, Berlin-Heidelberg-New-York, 1979, 97–111
Hettich, R., and Jongen, H.TH.: Semi-infinite programming: conditions of optimality and applications, in: Stoer (ed.): Optimization Techniques 2, Springer, Berlin-Heidelberg-New-York, 1978, 1–11
Hettich, R., and Zencke, P.: Superlinear konvergente Verfahren für semiinfinite Optimierungsprobleme im stark eindeutigen Fall, in; Collatz-Meinardus-Wetter-ling (eds.): Konstruktive Methoden der fini-ten nichtlinearen Optimierung, Birkhäuser, Basel-Bosten-Stuttgart, ISNM 55 (1980), 103–120
Hettich, R., and Zencke, P.: Numerische Methoden der Approximation und semi-infiniten Optimierung, Teubner, Stuttgart, 1982
Hoffmann, K.H., and Klostermaier, A.: A semi-infinite programming procedure, in: Lorentz et al., (eds.): Approximation Theory II, Academic Press, New-York-San Francisco-London 1976, 379–389
Van Honstede, W.: An approximation method for semi-infinite problems, in: Hettich (ed.): Semi-infinite programming, Springer, Berlin-Heidelberg-New-York, 1979, 126–136
Kelley, J.E.Jr.: The cutting plane method for solving convex programs, J.Soc.Indust.Appl.Math. 8 (1960), 703–712
Madsen, K. An algorithm for minimax solution of overdetermined systems of non-linear equations, J. Inst. Maths.Applies. 16 (1975), 321–328
Meinardus, G.: Approximation von Funktionen und ihre numerische Behandlung, Springer, Berlin-Göttingen-Heidelberg-New-York 1964
Oettershagen, K.: Ein superlinear konvergenter Algorithmus zur Lösung semi-infiniter Optimierungsprobleme, Univ. Bonn, Dissertation 1982
Osborne, M.R., and Watson, G.A.: An algorithm for minimax approximation in the nonlinear case, Computer J. 12 (1969), 63–68
Polak, E., and Tits, A.L.: A recursive quadratic programming algorithm for semi-infinite optimization problems, paper presented at: International Symp. on Semi-infinite Progr.Appl., Austin, 1981
Robinson, S.M.: Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear programming problems; Math. Programming 7 (1974), 1–16
Rockafellar, R. T.: Convex Analysis: Princeton University Press, Princeton, 1970
Roleff, K.: A stable multiple exchange algorithm for linear SIP, in: H Hettich (ed.): Semi-infinite programming, Springer, Berlin-Heidelberg-New-York 1979, 83–96
Schäfer, E.: Ein Konstruktionsverfahren bei allgemeiner linearer Approximation, Numer. Math. 18 (1971), 113–126
Stiefel, E.: Über diskrete und lineare Tschebyscheff-Approximationen, Numer.Math. 1 (1959), 1–28
Stiefel, E.: Note on Jordan elimination, linear programming and Tschebyscheff-approximation: Numer. Math. 2 (1960), 1–17
Töpfer, H.J.: Tschebyscheff-Approximation bei nicht erfüllter Haarscher Bedingung: Birkhäuser, Basel-Stuttgart, ISNM 7 (1967), 71–89
Watson, G.A.: A multiple exchange algorithm for multivariate Chebyshev approximation, SIAM J. Num.Anal. 12 (1975), 46–52
Watson, G.A.: Numerical experiments with globally convergent methods for semi-infinite programming problems: Univ. of Dundee, Rep. NA/49, 1981
Wetterling, W.: Anwendung des Newtonschen Iterationsverfahrens bei der Tschebyscheff-Approximation, insbesondere mit nichtlinear auftretenden Parametern, MTW Teil I: 61–63, Teil II: 112–115, 1963
Wilson, R.B.: A simplicial algorithm for concave programming, Diss., Harvard Univ., Cambridge (Mass.) 1963
Zoutendijk, G.: Mathematical programming methods: North-Holland, Amsterdam-New-York-Oxford 1976
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hettich, R. (1983). A Review of Numerical Methods for Semi-Infinite Optimization. In: Fiacco, A.V., Kortanek, K.O. (eds) Semi-Infinite Programming and Applications. Lecture Notes in Economics and Mathematical Systems, vol 215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46477-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-46477-5_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12304-0
Online ISBN: 978-3-642-46477-5
eBook Packages: Springer Book Archive