论文信息 - Projection onto an acute cone and convex feasibility problem - 字舞流文

Projection onto an acute cone and convex feasibility problem

Andrzej Cegielski | A. Cegielski

[1] 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 .

[2] J. Zowe,et al. Relaxed outer projections, weighted averages and convex feasibility , 1990 .

[3] Guy Pierra,et al. Decomposition through formalization in a product space , 1984, Math. Program..

[4] Yair Censor,et al. On the behavior of a block-iterative projection method for solving convex feasibility problems , 1990, Int. J. Comput. Math..

[5] S. Agmon. The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.

[6] Y. Censor,et al. Block-iterative projection methods for parallel computation of solutions to convex feasibility problems , 1989 .

[7] Boris Polyak,et al. The method of projections for finding the common point of convex sets , 1967 .

[8] D. Schoot. A general iterative scheme with applications to convex optimization and related fields , 1991 .

[9] Jean-Louis Goffin,et al. The Relaxation Method for Solving Systems of Linear Inequalities , 1980, Math. Oper. Res..

[10] Boris Polyak. Minimization of unsmooth functionals , 1969 .

[11] Alfredo N. Iusem,et al. Convergence results for an accelerated nonlinear cimmino algorithm , 1986 .