Skip to main content
SpringerLink
Log in

On Global Search for Non-Convex Optimal Control Problems

  • Chapter
Book cover Developments in Global Optimization

Part of the book series: Nonconvex Optimization and Its Applications ((NOIA,volume 18))

Abstract

In this paper we consider non-convex optimal control problems having the same goal: to maximize a convex function of the terminal state. A global search algorithm is given. The first numerical tests have been performed.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Pontryagin, L.S, Boltyanski, R.G., Gamkrelidze, R.V., and Mischenko, E.F. (1962), Mathematical Theory of Optimal Processes. Interscience Publ. Inc., New York.

    MATH  Google Scholar 

  2. Vasiliev, F.P. (1988), Numerical Methods of Extremum Problems Solving, Moscow, Nauka (in Russian).

    Google Scholar 

  3. Bellman R.E., Dreyfus S.E. (1962), Applied Dynamic Programming, Prinston University Press.

    MATH  Google Scholar 

  4. Krotov, V.F. and Gurman V.I. (1973), Methods and problems of Optimal Control, Moscow, Nauka (in Russian).

    Google Scholar 

  5. Srochko, V.A. (1989), Variational Maximum Principle and Linearization Methods in Optimal Control Problems, Irkutsk State University (in Russian).

    Google Scholar 

  6. Strekalovsky, A.S. (1995), On Global Maximum of a Convex Terminal Function in Optimal Control Problems. Journal of Global Optimization, vol. 7, pp. 75–91.

    Article  MathSciNet  MATH  Google Scholar 

  7. Strekalovsky, A.S. (1993), On Global Maximum Search of a Convex Function over a Feasible Set. Journal of Computational Mathematics and Mathematical Physics, vol. 33, N 3, pp. 315–328, Pergamon Press Ltd.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Department, Irkutsk State University, Gagarin Avenue, 20, Irkutsk-3, 664003, Russia

    Alexander Strekalovsky & Igor Vasiliev

Authors
  1. Alexander Strekalovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Igor Vasiliev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Vienna, Vienna, Austria

    Immanuel M. Bomze

  2. József Attila University, Szeged, Hungary

    Tibor Csendes

  3. University of Trier, Trier, Germany

    Reiner Horst

  4. University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Strekalovsky, A., Vasiliev, I. (1997). On Global Search for Non-Convex Optimal Control Problems. In: Bomze, I.M., Csendes, T., Horst, R., Pardalos, P.M. (eds) Developments in Global Optimization. Nonconvex Optimization and Its Applications, vol 18. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2600-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-2600-8_8

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-4768-0

  • Online ISBN: 978-1-4757-2600-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation