作者: S. Zlobeo,
期刊: Mathematische Operationsforschung und Statistik. Series Optimization (Taylor Available online 1978) 卷期: Volume 9, issue 2
页码: 185-196
ISSN:0323-3898
年代: 1978
DOI:10.1080/02331937808842484
出版商: Akademic-Verlag
数据来源: Taylor
摘要:
Three popular feasible direction methods for solving convex programming problems are reformulated so that they now work in the absence of Slater’s condition or any other constraint qualification.
点击下载: PDF (481KB)
返 回
版权所有 © 2009 NSTL国家科技图书文献中心
咨询热线:800-990-8900 010-58882057 Email:service@nstl.gov.cn
地址:北京市复兴路15号 100038 京ICP备05017586号