A row-action method for convex programming
暂无分享,去创建一个
[1] Y. Censor. Row-Action Methods for Huge and Sparse Systems and Their Applications , 1981 .
[2] Yair Censor,et al. Cyclic subgradient projections , 1982, Math. Program..
[3] L. Bregman. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming , 1967 .
[4] A. Pierro,et al. A relaxed version of Bregman's method for convex programming , 1986 .
[5] Jan Mandel. Convergence of the cyclical relaxation method for linear inequalities , 1984, Math. Program..
[6] Alfredo N. Iusem. On Dual Convergence and the Rate of Primal Convergence of Bregman's Convex Programming Method , 1991, SIAM J. Optim..
[7] Alvaro R. De Pierro,et al. On the convergence of Han's method for convex programming with quadratic objective , 1991, Math. Program..
[8] A. Pierro,et al. A simultaneous iterative method for computing projections on polyhedra , 1987 .
[9] Alvaro R. De Pierro,et al. On the convergence properties of Hildreth's quadratic programming algorithm , 1990, Math. Program..
[10] Clifford Hildreth,et al. A quadratic programming procedure , 1957 .
[11] Shih-Ping Han. A parallel algorithm for a class of convex programs , 1988 .
[12] Shih-Ping Han,et al. A successive projection method , 1988, Math. Program..
[13] A. Pierro,et al. A finitely convergent “row-action” method for the convex feasibility problem , 1988 .
[14] Gabor T. Herman,et al. Image reconstruction from projections : the fundamentals of computerized tomography , 1980 .