作者: Yair Censor , Tommy Elfving , Gabor T. Herman
DOI: 10.1007/978-94-009-3961-5_14
关键词:
摘要: We present a family of algorithms the row-action type that are suitable for solving large and sparse entropy maximization problems with linear constraints. The designed to handle equality constraints, in-equality or interval constraints (that is, pairs inequalities). Six iterative discussed, but one them convergence process is not yet proven. No experimental results presented.