Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

A note on the convergence of an algorithm for nonconvex programming problems

  • Short Communication
  • Published:
Mathematical Programming Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

A strong convergence theorem is proven to hold for the general algorithm of the branch and bound type for solving nonconvex programming problems given in [1].

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Reference

  1. R. Horst, “An algorithm for nonconvex programming problems”,Mathematical Programming 10 (1976) 312–321.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Hochschule Darmstadt, Darmstadt, Fed. Rep. Germany

    Reiner Horst

Authors
  1. Reiner Horst
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Horst, R. A note on the convergence of an algorithm for nonconvex programming problems. Mathematical Programming 19, 237–238 (1980). https://doi.org/10.1007/BF01581645

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation