Skip to main content

Numerical Methods for Multiextremal Nonlinear Programming Problems with Nonconvex Constraints

  • Conference paper
Nondifferentiable Optimization: Motivations and Applications

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 255))

Abstract

Existing approaches to multiextremal optimization (see Evtushenko, 1971; Ivanov, 1972; Mockus, 1977; Strongin, 1978; Zilinskas, 1978) mostly focus on numerical methods for unconstrained problems. Constraints are usually handled by introducing penalty functions since other techniques (see, for example, Demyanov and Vasiliev, 1981) require the minimizing function and the constraints.to be convex, unimodal, or to have other properties. Below we pre sent a new algorithm for multiextremal problems with nonconvex constraints which does not make use of penalties.

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

Access this chapter

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

  • Evtushenko, Yu.G. (1971). Numerical method for seeking the global extremum of a function (nonuniform grid search). Journal of Computational Mathematics and Mathematical Physics, 11: 1390–1403 (in Russian).

    Google Scholar 

  • Ivanov, V.V. (1972). On optimal minimization algorithms for functions of some classes. Kibernetika, (4): 81–94 (in Russian).

    Google Scholar 

  • Mockus, J. (1977). On Bayesian methods of seeking the extremum and their applications. In Gilchrist (Ed.), Information Processing 77. North-Holland, Amsterdam, pp. 195–200.

    Google Scholar 

  • Demyanov, V.F. and Vasiliev, L.V. (1981). Nondifferentiable Optimization. Nauka, Moscow (in Russian).

    Google Scholar 

  • Strongin, R.G. (1978). Numerical Methods in Multiextremal Problems. Nauka, Moscow (in Russian).

    Google Scholar 

  • Zilinskas, A. (1978). On one-dimensional multimodal minimization. In Transactions of the Eighth Prague Conference on Information Theory, Stat. Dec. Functions, and Random Processes, pp. 393–402.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Strongin, R.G. (1985). Numerical Methods for Multiextremal Nonlinear Programming Problems with Nonconvex Constraints. In: Demyanov, V.F., Pallaschke, D. (eds) Nondifferentiable Optimization: Motivations and Applications. Lecture Notes in Economics and Mathematical Systems, vol 255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-12603-5_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-12603-5_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15979-7

  • Online ISBN: 978-3-662-12603-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics