The bounce algorithm for mathematical programming

H. A. Eiselt and C.-L. Sandblom

Mathematical Methods of Operations Research, 2000, vol. 52, issue 2, 173-183

Abstract: This paper describes a constrained optimization method that was inspired by the physical equivalent of a small ball that, propelled only by gravity, is dropped from an initial point inside a full-dimensional body, represented by the set of feasible solutions. The ball will eventually hit one of the boundaries of the given set, at which point it will bounce off and continue until it comes to rest at some point. We prove that this point is a local minimum. Copyright Springer-Verlag Berlin Heidelberg 2000

Keywords: Key words: Convex nonlinear programming; descent method; interior points; gravitational method. (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860000072 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:52:y:2000:i:2:p:173-183

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860000072

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().