Skip to main content

On numerical analysis in semi-infinite programming

  • Methods For Linear Problems
  • Conference paper
  • First Online:
Semi-Infinite Programming

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 15))

Abstract

In this paper which is a companion to [9] we shall discuss the theoretical questions which arise by the computational treatment of semi-infinite programs. Fairly strong regularity assumptions will be needed to insure satisfactory results of the computational schemes described here and which have proved effective in actual calculations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Charnes, A., W.W. Cooper and K.O. Kortanek, Duality, Haar programs and finite sequence spaces, Proc. Nat. Acad. Sci., U.S. 48 (1962), 783–786

    Google Scholar 

  2. Fahlander, K., Computer programs for semi-infinite optimization, TRITA-NA-7312, Dept of Numerical Analysis, Royal Institute of Technology, S-10044 Stockholm 70, Sweden, 1973

    Google Scholar 

  3. Glashoff, K. and S.-Å. Gustafson, Einführung in die Lineare Optimierung, Wissenschaftliche Buchgesellschaft, Darmstadt, 1978

    Google Scholar 

  4. Golub, G.H. and J.H. Welsch, Calculation of Gauss quadrature rules, Math. Comp. 23 (1969), 221–230

    Google Scholar 

  5. Gustafson, S.-Å., On the computational solution of a class of generalized moment problems, SIAM J Numer. Anal. 7 (1970), 343–357

    Google Scholar 

  6. Gustafson, S.-Å., Die Berechnung von verallgemeinerten Quadraturformeln vom Gausschen Typus, eine Optimierungsaufgabe, in L. Collatz, W. Wetterling (Eds): Numerische Methoden bei Optimierungsaufgaben, ISNM 17 (1973), 59–71, Birkhäuser, Basel

    Google Scholar 

  7. Gustafson, S.-Å., On computational applications of the theory of moment problems, Rocky Mountain J on Math 4 (1974), 227–240

    Google Scholar 

  8. Gustafson, S.-Å., Stability aspects on the numerical treatment of linear semi-infinite programs, TRITA-NA-7604, Dept of Numerical Analysis, Royal Institute of Technology, S-10044 Stockholm 70, Sweden, 1976

    Google Scholar 

  9. Gustafson, S.-Å., On semi-infinite programming in numerical analysis, this volume

    Google Scholar 

  10. Gustafson, S.-Å. and K.O. Kortanek, Numerical treatment of a class of semi-infinite programming problems, NRLQ 20 (1973), 477–504

    Google Scholar 

  11. Gustafson, S.-Å., G. Dahlquist and L. Reichel, Remarks on the convergence of Newton-Raphson's method in the presence of round-offs, TRITA-NA-7615, Dept of Numerical Analysis, Royal Institute of Technology, S-10044 Stockholm 70, Sweden

    Google Scholar 

  12. Hettich, R., Kriterien zweiter Ordnung für lokal beste Approximation, Numer. Math. 22 (1974), 409–417

    Google Scholar 

  13. Hettich, R., A Newton-method for nonlinear Chebyshev approximation in R. Schaback, K. Scherer (Eds): Approximation Theory, Lecture Notes in Math 556 (1976), 222–236, Springer, Berlin-Heidelberg, New York

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

R. Hettich

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag

About this paper

Cite this paper

Gustafson, SÅ. (1979). On numerical analysis in semi-infinite programming. In: Hettich, R. (eds) Semi-Infinite Programming. Lecture Notes in Control and Information Sciences, vol 15. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0003883

Download citation

  • DOI: https://doi.org/10.1007/BFb0003883

  • 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

Publish with us

Policies and ethics