Skip to main content
SpringerLink
Log in

Computational complexity of some semiinfinite programming methods

  • Conference paper
  • First Online:
System Modelling and Optimization

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ašić, M.D.; Kovačavić-Vujčić, V. V., An application of semiinfinite programming to approximation theory, Proc. Symp. SYM-OP-IS'84, Herceg Novi, 1984.

    Google Scholar 

  2. Ašić, M.D.; Kovačević-Vujčić, V.V., An interior semiinfinite programming method, submitted for publication.

    Google Scholar 

  3. Watson, G.A., Globally convergent methods for semiinfinite programming, BIT 21, 1981.

    Google Scholar 

  4. Watson, G.A., Numerical experiments with globally convergent methods for semiinfinite programming problems, Semi-Infinite Programming and Applications, Edited by A.V. Fiacco and K.O. Kortanek, Springer-Verlag, 1983.

    Google Scholar 

  5. Coope, I.D.; Watson, G.A., A projected Lagrangian algorithm for semiinfinite programming, Mathematical Programming 32, 1985.

    Google Scholar 

  6. Polak, E.; Tits, A.L., A recursive quadratic programming algorithm for semi-infinite optimization problems, Applied Mathematics and Optimization 8, 1982.

    Google Scholar 

  7. Gustafson, S.A., A three-phase algorithm for semi-infinite programs, Semi-Infinite Programming and Applications, Edited by A.V. Fiacco and K.O. Kortanek, Springer-Verlag, 1983.

    Google Scholar 

  8. Hettich, R.; Zencke, P., Numerische Methoden der Approximation und semi-infiniten Optimierung, B.G. Teubner, Stuttgart, 1982.

    Google Scholar 

  9. Hettich, R., A review of numerical methods for semi-infinite optimization, Semi-Infinite Programming and Applications, Edited by A.V. Fiacco and K.O. Kortanek, Springer-Verlag, 1983.

    Google Scholar 

  10. Glashoff, K.; Gustafson, S.A., Linear optimization and approximation, Applied Mathematical Sciences 45, Springer-Verlag, 1983.

    Google Scholar 

  11. Andreassen, D. D.; Watson, G.A., Linear Chebyshev Approximation without Chebyshev sets, BIT 16, 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics, Belgrade University, Studentski Trg 16, Belgrade, Yugoslavia

    M. D. Ašić

  2. Faculty of Organizational Sciences, Belgrade University, Jove Ilića 154, Belgrade, Yugoslavia

    V. V. Kovačević-Vujčić

Authors
  1. M. D. Ašić
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. V. Kovačević-Vujčić
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

A. Prékopa J. Szelezsáan B. Strazicky

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag

About this paper

Cite this paper

Ašić, M.D., Kovačević-Vujčić, V.V. (1986). Computational complexity of some semiinfinite programming methods. In: Prékopa, A., Szelezsáan, J., Strazicky, B. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 84. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0043822

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16854-6

  • Online ISBN: 978-3-540-47138-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation