Technical Note—Theorems of Convergence for Improved Nonlinear Programming Algorithms

Jacques Dubois
Additional contact information
Jacques Dubois: University of California, Berkeley, California

Operations Research, 1973, vol. 21, issue 1, 328-332

Abstract: This note presents proofs of convergence of nonlinear programming algorithms under a weaker requirement than Zangwill's convergence theorems A and C. The objective is the removal of the closedness and the weakening of the adaption properties of the map-algorithm. In this approach two map-algorithms are used: one that provides the solution points, and one that provides convergence for the former.

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.1.328 (application/pdf)

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:inm:oropre:v:21:y:1973:i:1:p:328-332

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().