Hostname: page-component-74656f9884-54qdv Total loading time: 0 Render date: 2026-11-10T09:22:49.713Z Has data issue: false hasContentIssue false
  • English
  • Français

Investigating semi-infinite programs using penalty functions and Lagrangian methods

Published online by Cambridge University Press:  17 February 2009

Sven-Åke Gustafson
Sven-Åke Gustafson
Affiliation:
Department of Numerical Analysis and Computing Science, The Royal Institute of Technology, S-10044 Stockholm 70, Sweden.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper the relations between semi-infinite programs and optimisation problems with finitely many variables and constraints are reviewed. Two classes of convex semi-infinite programs are defined, one based on the fact that a convex set may be represented as the intersection of closed halfspaces, while the other class is defined using the representation of the elements of a convex set as convex combinations of points and directions. Extension to nonconvex problems is given. A common technique of solving a semi-infinite program computationally is to derive necessary conditions for optimality in the form of a nonlinear system of equations with finitely many equations and unknowns. In the three-phase algorithm, this system is constructed from the optimal solution of a discretised version of the given semi-infinite program. i.e. a problem with finitely many variables and constraints. The system is solved numerically, often by means of some linearisation method. One option is to use a direct analog of the familiar SOLVER method.

Information

Type
Research Article
Information
The ANZIAM Journal , Volume 28 , Issue 2 , October 1986 , pp. 158 - 169
Copyright
Copyright © Australian Mathematical Society 1986

References

[1]Fiacco, A. V. and Kortanek, K. O. (eds), “Semi-infinite programming and applications”, Lecture notes in economics and mathematical systems No 215 (Springer-Verlag, Berlin-Heidelberg-New York-Tokyo, 1983).Google Scholar
[2]Fletcher, R., Practical methods of optimization, Volume 1. Unconstrained optimization (John Wiley & Sons, Chichester-New York-Brisbane-Toronto, 1980).Google Scholar
[3]Fletcher, R., Practical methods of optimization, Volume 2. Constrained optimization (John Wiley & Sons, Chichester-New York-Brisbane-Toronto, 1981).Google Scholar
[4]Glashoff, K. and Gustafson, S-Å., Linear optimization and approximation (Springer-Verlag, New York-Heidelberg-Berlin, 1983).CrossRefGoogle Scholar
[5]Gustafson, S-Å., “Stability aspects on the numerical treatment of linear semi-infinite programs”, TRITA-NA-7604, Dept. of Numerical Analysis and Computing Science, The Royal Institute of Technology, S-10044 Stockholm 70, Sweden.Google Scholar
[6]Gustafson, S-Å., “A general three-phase algorithm for nonlinear semi-infinite programs”, in Operations Research '81 (ed. Brans, J. P.) (North-Holland, Amsterdam-New York-Oxford, 1981), 343–356.Google Scholar
[7]Gustafson, S-Å., “A three-phase algorithm for semi-infinite programs”, pp 138–157 in [1].CrossRefGoogle Scholar
[8]Gustafson, S-Å. and Kortanek, K. O., “Semi-infinite programming and applications”, in Mathematical programming. The state of the art. Bonn 1982 (eds. Bachem, A., Grötschel, M. and Korte, K.) (Springer-Verlag, Berlin-Heidelberg-New York-Tokyo, 1983), 132–157.Google Scholar
[9]Hettich, R. (ed.), “Semi-infinite programming”, Lecture notes in control and information sciences No 15 (Springer-Verlag, Berlin-Heidelberg-New York, 1979).Google Scholar
[10]Luenberger, D., Optimization by vector space methods (John Wiley & Sons, New York-London-Sydney-Toronto, 1969).Google Scholar
[11]Rockafellar, R. T., Convex analysis (Princeton University Press, Princeton, 1970).CrossRefGoogle Scholar
[12]Watson, G. A., “Globally convergent methods for semi-infinite programming”, BIT 21 (1981), 362–373.CrossRefGoogle Scholar