Abstract
Numerical methods for general non-linear semi-infinite problems, which make use of linear approximations, need strong assumptions to ensure local quadratic convergence.
An algorithm, solving a sequence of linearly constrained semi-infinite problems, is proposed which under weaker assumptions converges locally quadratic too.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. Cromme, Eine Klasse von Verfahren zur Ermittlung bester nichtlinearer Chebyshev-Approximationen, Numer. Math., 25 (1976), 447–459.
P.E. Gill and W. Murray, Numerically stable methods for quadratic programming, Math. Programming, 14 (1978), 349–372.
S.A. Gustafson and K.O. Kortanek, Mathematical models for air-pollution control: determination of abatement policies, in: Models for Environmental Pollution Control, R.A. Deininger ed., Ann Arbor Science Press, Ann Arbor, Michigan, 1973, 251–265.
R. Hettich and W. van Honstede, On quadratically convergent methods for semi-infinite programming, this volume.
R.B. Wilson, A simplicial algorithm for concave programming, Graduate School of Business Administration, Harvard University, Cambridge, Mass., Dissertation, 1963.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag
About this paper
Cite this paper
van Honstede, W. (1979). An approximation method for semi-infinite problems. In: Hettich, R. (eds) Semi-Infinite Programming. Lecture Notes in Control and Information Sciences, vol 15. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0003888
Download citation
DOI: https://doi.org/10.1007/BFb0003888
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09479-1
Online ISBN: 978-3-540-35213-6
eBook Packages: Springer Book Archive