对角线的
算法
趋同(经济学)
计算机科学
对偶(语法数字)
数学优化
凸优化
简单(哲学)
正多边形
线性规划
数学
经济增长
认识论
文学类
哲学
艺术
经济
几何学
作者
Thomas Pock,Antonin Chambolle
出处
期刊:
[Institute of Electrical and Electronics Engineers]
日期:2011-11-01
卷期号:: 1762-1769
被引量:420
标识
DOI:10.1109/iccv.2011.6126441
摘要
In this paper we study preconditioning techniques for the first-order primal-dual algorithm proposed in [5]. In particular, we propose simple and easy to compute diagonal preconditioners for which convergence of the algorithm is guaranteed without the need to compute any step size parameters. As a by-product, we show that for a certain instance of the preconditioning, the proposed algorithm is equivalent to the old and widely unknown alternating step method for monotropic programming [7]. We show numerical results on general linear programming problems and a few standard computer vision problems. In all examples, the preconditioned algorithm significantly outperforms the algorithm of [5].
科研通智能强力驱动
Strongly Powered by AbleSci AI