论文信息 - A simultaneous iterative method for computing projections on polyhedra

A simultaneous iterative method for computing projections on polyhedra

A simultaneous version of Hildreth’s iterative algorithm for norm minimization over linear inequalities is presented. Proofs are given showing that the algorithm converges from any starting point to its projection on the linear constraints set in the feasible case and to the nearest least squares solution in the general case.

A. Pierro | A. Iusem

[1] Clifford Hildreth,et al. A quadratic programming procedure , 1957 .

[2] G. Herman,et al. Three-dimensional reconstruction from projections: a review of algorithms. , 1974, International review of cytology.

[3] A. Lent,et al. Iterative reconstruction algorithms. , 1976, Computers in biology and medicine.

[4] O. Mangasarian. Solution of symmetric linear complementarity problems by iterative methods , 1977 .

[5] Gabor T. Herman,et al. A family of iterative quadratic optimization algorithms for pairs of inequalities, with application in diagnostic radiology , 1978 .

[6] A. Pierro,et al. A simultaneous projections method for linear inequalities , 1985 .