IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-0-387-36721-7_8.html
   My bibliography  Save this book chapter

Univariate Algorithms for Solving Global Optimization Problems with Multiextremal Non-differentiable Constraints

In: Models and Algorithms for Global Optimization

Author

Listed:
  • Yaroslav D. Sergeyev

    (University of Calabria
    N.I. Lobatchevsky State University)

  • Falah M. H. Khalaf

    (University of Calabria)

  • Dmitri E. Kvasov

    (N.I. Lobatchevsky State University
    University of Rome “La Sapienza”)

Abstract

Summary In this chapter, Lipschitz univariate constrained global optimization problems where both the objective function and constraints can be multiextremal and non-differentiable are considered. The constrained problem is reduced to a discontinuous unconstrained problem by the index scheme without introducing additional parameters or variables. It is shown that the index approach proposed by R.G. Strongin for solving these problems in the framework of stochastic information algorithms can be successfully extended to geometric algorithms constructing non-differentiable discontinuous minorants for the reduced problem. A new geometric method using adaptive estimates of Lipschitz constants is described and its convergence conditions are established. Numerical experiments including comparison of the new algorithm with methods using penalty approach are presented.

Suggested Citation

  • Yaroslav D. Sergeyev & Falah M. H. Khalaf & Dmitri E. Kvasov, 2007. "Univariate Algorithms for Solving Global Optimization Problems with Multiextremal Non-differentiable Constraints," Springer Optimization and Its Applications, in: Aimo Törn & Julius Žilinskas (ed.), Models and Algorithms for Global Optimization, pages 123-140, Springer.
    • Handle: RePEc:spr:spochp:978-0-387-36721-7_8
    DOI: 10.1007/978-0-387-36721-7_8
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spochp:978-0-387-36721-7_8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.