On finitely convergent iterative methods for the convex feasibility problem. (English) Zbl 0742.65045
Summary: Iterative algorithms for the convex feasibility problem can be modified so that at iteration \(k\) the original convex sets are perturbed with a parameter \(\varepsilon_ k\) which tends to zero as \(k\) increases. We establish conditions on such algorithms which guarantee existence of a sequence of perturbation parameters which make them finitely convergent when applied to a convex feasibility problem whose feasible set has non empty interior.
References:
| [1] | Censor, Y.,Row action methods for huge and sparse systems and their applications. SIAM Rev. 23: 444–464 (1981). · Zbl 0469.65037 · doi:10.1137/1023097 |
| [2] | Censor, Y., Lent, A.,Ciclic subgradient projections, Math. Prog. 24: 233–235 (1982). · Zbl 0491.90077 · doi:10.1007/BF01585107 |
| [3] | De Pierro, A., Iusem, A.,A Finitely Convergent Cyclic Subgradient Profections Method (to be published in Applied Math. and Optimization). |
| [4] | De Pierro, A., Iusem, A.,A parallel profection method of finding a common point of a family of convex sets, Pesquisa Operacional 5: 1–20 (1985). |
| [5] | Eremin, I.,The relaxation method for solving systems of inequalities with convex functions on the left hand side. Soviet Math. Doklady 6: 219–222 (1965). · Zbl 0144.30601 |
| [6] | Gubin, L.G., Polyak, B.T., Raik, E.V.,The method of projections for finding the common point of convex sets. USSR Comp. Math. Math. Phys. 7: 1–24 (1967). · Zbl 0199.51002 · doi:10.1016/0041-5553(67)90113-9 |
| [7] | Herman, G.T., Lent, A.,A family of iterative quadratic optimization algorithms for pairs of inequalities, with application in diagnostic radiology. Math. Prog. Studies 9: 15–29 (1978). · Zbl 0389.90078 · doi:10.1007/BFb0120823 |
| [8] | Iusem, A., Moledo, L.,A Finitely Convergent Method of Simultaneous Subgradient Projections for the Convex Feasibility Problem. Matemática Aplicada e Computacional 5, 2: 169–184 (1986). · Zbl 0625.90079 |
| [9] | Lamond, B., Stewart, N.F.,Bregman’s balancing method. Transp. Res. 15B: 239–248 (1981). · doi:10.1016/0191-2615(81)90010-2 |
| [10] | Motzkin, S., Schoenberg, I.J.,The relaxation method for linear inequalities. Canadian J. Math. 6: 393–404 (1954). · Zbl 0055.35002 · doi:10.4153/CJM-1954-038-x |
| [11] | Rockafellar, R.T.,Convex Analysis. Princeton University Press (1970). · Zbl 0193.18401 |
| [12] | Shor, N.Z.,Cut-off Method with Space Extension in Convex Programming Problems. Kibernetika 13, 1: 94, 95 (1977). |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
