A convex programming procedure

D. A. D'esopo

Naval Research Logistics Quarterly, 1959, vol. 6, issue 1, 33-42

Abstract: The procedure which involves successively minimizing a convex function with respect to each of its coordinates is shown to converge if constraints are rectangular and the function has continuous derivatives. It is also shown that certain more general procedures, which might be expected to converge more rapidly, are convergent. A criterion is exhibited which yields information concerning the rate of convergence of this method.

Date: 1959
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800060105

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:wly:navlog:v:6:y:1959:i:1:p:33-42

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().