A convex programming procedure
作者:
D. A. D'esopo,
期刊:
Naval Research Logistics Quarterly
(WILEY Available online 1959)
卷期:
Volume 6,
issue 1
页码: 33-42
ISSN:0028-1441
年代: 1959
DOI:10.1002/nav.3800060105
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractThe 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.
点击下载:
PDF
(469KB)
返 回