Skip to main content
SpringerLink
Log in

On global search based on global optimality conditions

  • Contributed Papers
  • Conference paper
  • First Online:
System Modelling and Optimization

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

  • 1310 Accesses

Abstract

We consider two kinds of nonconvex problems: convex maximization and reverseconvex optimization. Using the new information about the problems in the form of Global Optimality Search Algorithms [1–5], we construct Global Search Algorithms and study their global convergence. Numerical experiments also presented here are rather promising especially for large dimension problems.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Strekalovsky A. On the problem of global extremum // Soviet Math. Doklady of Science Academy, 35(1987), pp. 194–198.

    Google Scholar 

  2. Strekalovsky A. On the problem of global extremum in nonconvex extremal problems // Isvestia VUZ, seria mathematika, 1990, No 8, p. 74–80.

    Google Scholar 

  3. Strekalovsky A. On the problem of global extremum condition in Nonconvex Optimization Problems // Voprosy kibernetiki, Analysis of big systems, Russian Academy of Science, Scientific Soviet on Complex Cybernetics Problem, Moscow, 1992, p. 178–197.

    Google Scholar 

  4. Strekalovsky A. On optimization problems over supplements of convex sets // Cybernetics and system analysis, 1993, No 1, p. 113–126.

    Google Scholar 

  5. Strekalovsky A. On global maximum search of convex function over a feasible set // Journal of numerical math. and math. phizik, 1993, No 3 (to appear)

    Google Scholar 

  6. R. T. Rockafellar. Convex Analysis, Princton University Press (1970).

    Google Scholar 

  7. Hiriart-Urruty J.B. Necessary and sufficient conditions for global optimality // From convex optimization to nonconvex optimization. “Nonsmooth optimization and related topics” (E.Clarke, V.Demyanov, F.Gianessi editors) Plenum, N.Y., 1989, p. 219–239.

    Google Scholar 

  8. Horst R., Tuy H., Global Optimization. Deterministic Approach, Springer-Verlag, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Alexander Strekalovsky

Authors
  1. Alexander Strekalovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jacques Henry Jean-Pierre Yvon

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag

About this paper

Cite this paper

Strekalovsky, A. (1994). On global search based on global optimality conditions. In: Henry, J., Yvon, JP. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035474

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19893-2

  • Online ISBN: 978-3-540-39337-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation