Skip to main content
SpringerLink
Log in

A finitely convergent “row-action” method for the convex feasibility problem

  • Published:
Applied Mathematics and Optimization Aims and scope Submit manuscript

Abstract

We present a modification of the Cyclic Subgradient Projection (CSP) method by Censor and Lent, which solves the convex feasibility problem in a finite number of steps when a Slater type condition holds, while preserving its “row-action” properties. A linear rate of convergence for the CSP method is established assuming the same hypothesis.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Censor Y (1981) Row-action methods for huge and sparse systems and their applications. SIAM Rev 23:444–464

    Google Scholar 

  2. Censor Y (1984) Iterative methods for the convex feasibility problem. Ann Discrete Math 20:83–91

    Google Scholar 

  3. Censor Y, Lent A (1981) Cyclic subgradient projections. Mathematics Publication Series, Report No 35. Department of Mathematics, University of Haifa

  4. Censor Y, Lent A (1982) Cyclic subgradient projections. Math Programming 24:233–235

    Google Scholar 

  5. Eremin, II (1965) The relaxation method for solving systems of inequalities with convex functions on the left-hand side. Soviet Math Dokl 6:219–222

    Google Scholar 

  6. Gubin LG, Polyak BT, Raik EV (1967) The method of projections for finding the common point of convex sets. USSR Comput Math and Math Phys 7:1–24

    Google Scholar 

  7. Lent A (1976) A convergent algorithm for maximum entropy image restoration with a medical X-ray application. In: Shaw R (ed) Image Analysis and Evaluation. SPSE, Washington, DC, pp 249–257

    Google Scholar 

  8. Motzkin T, Schoenberg IJ (1954) The relaxation method for linear inequalities. Canad J Math 6:393–404

    Google Scholar 

  9. Oettli W (1975) Symmetric duality and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and the constraints. J Approx Theory 14:43–50

    Google Scholar 

  10. Rockafeller RT (1970) Convex Analysis. Princeton University Press, Princeton, NJ

    Google Scholar 

  11. Shor NZ (1977) Cut-off methods with space extension in convex programming. Kibernetika 13:99–95

    Google Scholar 

  12. Spingarn JE (1985) A primal-dual projection method for solving systems of linear inequalities. Linear Algebra Appl 65:45–62

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instituto de Matemática, Universidade Federal do Rio de Janeiro, C.P. 68530, CEP 21910, Rio de Janeiro, Brasil

    Alvaro R. De Pierro

  2. Instituto de Matemática Pura e Aplicada, Estrada Dona Castorina 110, CEP 22460, Rio de Janeiro, Brasil

    Alfredo N. Iusem

Authors
  1. Alvaro R. De Pierro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alfredo N. Iusem
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research partially supported by CNPq, under Grant No. 301699/81.

Rights and permissions

Reprints and permissions

About this article

Cite this article

De Pierro, A.R., Iusem, A.N. A finitely convergent “row-action” method for the convex feasibility problem. Appl Math Optim 17, 225–235 (1988). https://doi.org/10.1007/BF01448368

Download citation

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01448368

Keywords

Search

Navigation