Abstract
We prove the convergence of a class of iterative algorithms for solving locally Lipschitz feasibility problems, that is, finite systems of inequalities f i (x)≤0, (i ∈ I), where each f i is a locally Lipschitz functional on ℝn. We also obtain a new convergence criterion for the so-called block-iterative projection methods of finding common points of finite families of convex closed subsets of ℝn as defined by Aharoni and Censor ([3]).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Agmon, “The relaxation method for linear inequalities,” Can. J. of Math., vol. 6, pp. 382–392, 1954.
R. Aharoni, A. Berman, and Y. Censor, “An interior point algorithm for the convex feasibility problem,” Advances in Appl. Math., vol. 4, pp. 479–489, 1983.
R. Aharoni and Y. Censor, “Block-iterative projection methods for parallel computation of solution to convex feasibility problems,” Linear Algebra And Its Applications, vol. 120 pp. 165–175, 1988.
J.-P. Aubin and A. Cellina, Differential Inclusions, Springer Verlag: Berlin, Heidelberg, New York, Tokyo, 1984.
A. Auslender, Optimization — Méthods Numèriques, Masson: Paris, New York, Barcelona, Milan, 1976.
M. Avriel, “Methods for solving signomial and reverse convex programming problems,” in: Optimization and Design, M. Avriel, M.J. Rijkaert and D.J. Wilde, Eds., pp. 307–320, Prentice Hall: Englewood Cliffs, 1973.
L.M. Bregman, “The relaxation method of finding the common point of convex sets and its applications to the solution of problems in convex programming,” USSR Comput. Math. and Math. Physics, vol. 7, pp. 200–217, 1967.
D. Butnariu and Y. Censor, “On the behavior of a block-iterative projection method for solving convex feasibility problems”, Int. J. Comput. Math, vol. 34, pp. 79–94, 1990.
D. Butnariu and Y. Censor, “On a class of bargaining schemes for points in the core of a n-person cooperative game,” Tech. Report No. 280, Dept. of Math., Univ. of Texas at Arlington, 1990.
A. Cauchy, “Méthode générale pour la résolution des systémes d'équations simultanées,” Comptes Rendues Hebdomadaires de l'Academie des Sciences, Paris, vol. XXV: 16, pp. 536–538, 1847.
Y. Censor, “Row-action methods for huge and sparse systems and their applications,” SIAM Review, vol. 23, pp. 444–466, 1981.
Y. Censor and A. Lent, “Cyclic subgradient projections,” Math. Programming, vol. 24, pp. 233–235, 1982.
Y. Censor, D.E. Gustafson and A. Lent, “A new approach of the emission computerized tomography problem: Simultaneous calculation of attenuation and activity coefficients,” IEEE Trans. on Nuclear Sci., vol. NS-26, pp. 2775–2779, 1979.
Y. Censor, “Parallel applications of block iterative methods in medical imaging and radiation therapy,” Math. Programming, vol. 42, pp. 307–325, 1988.
G. Cimmino, “Calcolo approsimato per le soluzioni di sistemi di equazioni lineari,” La Riserca Scientifica, Roma, vol. XVI, IX: 2, pp. 326–333, 1938.
F.H. Clarke, Optimization and Nonsmooth Analysis, John Wiley and Sons, New York, Chichester, Brisbane, Toronto, Singapore, 1983.
A.R.De Pierro and A.N. Iusem, “A simultaneous projection method for linear inequalities,” Linear Algebra And Its Applications, vol. 64, pp. 243–253, 1985.
A.R.De Pierro and A.N. Iusem, “A parallel projection method of finding common points of a family of convex sets,” Pesquisa Operacional, vol. 5, pp. 1–20, 1985.
F. Deutch, “Applications of von Neumann's alternating projection algorithm,” in: Methods of Operation Research, P. Kendrov, ed., Sofia, pp. 44–51, 1983.
F. Deutch, “Rate of convergence of the method of alternating projections,” in: Parametric Optimization And Approximations, P. Brosowski and F. Deutch, eds., Birkhauser, Bassel, pp. 96–107, 1985.
I.I. Eremin, “On systems of inequalities with convex functions in the left side,” Am. Math. Soc. Translations, vol. 2: 88, pp. 67–83, 1970.
S.D. Flåm, “Solving non-cooperative games by continuous subgradient projection methods,” Working Paper No. 1489, Dept. of Economics, Univ. of Bergen, Norway, 1989.
S.D. Flåm, “Approaching core solutions by mean of continuous bargaining,” Working Paper No. 0690, Dept. of Economics, Univ. of Bergen, Norway, 1990.
S.D. Flåm and J. Zowe, “Relaxed outer projections, weighted averages and convex feasibility,” BIT, vol. 30, pp. 289–300, 1990.
J. J.-B. Fourier, “Solution d'une question particuliére du calcul des inégalitées,” Histoire de l'Academie des Sciences, Paris, pp. 48–49, 1824.
J.L. Goffin, “On convergence rates of subgradient optimization methods,” Math. Programming, vol. 13, pp. 329–347, 1977.
J.L. Goffin, “On the non-polynomiality of the relaxation method of systems of linear inequalities,” Math. Programming, vol. 22, pp. 93–103, 1982.
A.A. Goldstein, “Optimization of Lipschitz continuous functions,” Math. Programming, vol. 13, pp. 14–22, 1977.
C.G. Gubin, B.T. Polyak, and E. V. Raik, “The method of projection for finding the common point of convex sets,” USSR Comput. Math. and Math. Physics, vol. 7, pp. 1–24, 1964.
I. Halperin, “The product of projection operators,” Acta Sci. Math., vol. 23, pp. 94–99, 1962.
P. Hansen, D. Peters, D. Richards, and J.-F. Thissa, “The minisum and the minimax location problems revisited,” Oper. Res., vol. 33, pp. 1251–1265, 1985.
R.J. Hillestad, “Optimization problems subject to a budget constraint with economics of scale,” Oper. Res., vol. 23, pp. 1091–1098, 1975.
A.N. Iusem and A.R.De Pierro, “Convergence results for an accelerated Cimmino algorithm,” Numerische Mathematik, vol. 49, pp. 347–368, 1986.
S. Kaczmarz, “Angenaherte auflösung von systemen linearer gleichungen,” Bull. Acad. Polon. Sci. Lett., vol. A35, pp. 355–357, 1937.
S. Kayalar and H. Wienert, “Error bounds for the method of alternating projections,” Math. of Control, Signals and Systems, vol. 1, pp. 43–59, 1988.
L.S. Lasdon and J. Plummer, “Optimal design of efficient acoustic antenna arrays,” Math. Programming, vol. 39, pp. 131–155, 1987.
T.S. Motzkin and I.J. Scheönberg, “The relaxation method for linear inequalities,” Can. J. of Math., vol. 6, pp. 393–404, 1954.
H. Nakano, “Spectral Theory in Hilbert Space,” Japanese Society For Promotion of Sci., Tokyo, Japan, 1953.
J.von Neumann, “On rings of operators. Reduction theory,” Ann. of Math., vol. 50, pp. 401–485, 1949.
B.T. Polyak, “Minimization of nonsmooth functionals,” USSR Comput. Math. and Math. Physics, vol. 9, pp. 509–521, 1969.
B.T. Polyak, “A general method for solving extremum problems,” Doklady Akademia Nauk SSSR, vol. 174, pp. 33–36, 1967.
A.W. Roberts and D.E. Varberg, “Another proof that convex functions are locally Lipschitz,” Am. Math. Monthly, vol. 81, pp. 1014–1016, 1974.
R.T. Rockafellar, Convex Analysis, Princeton Univ Press, Princeton, NJ, 1970.
N.Z. Shor, “An application of the method of gradient descent to the solution of the network transportation problem” in: Materialy Naucnovo Seminara po Theoret i Priklad. Voprosam Kibernet. i Issted. Operacii, Nucnui po Kibernet. Acad. Nauk Ukrain. SSSR, vyp. 1, Kiev, pp. 9–17, 1962.
N.Z. Shor, Minimization Methods for Nondifferentiable Functions, Springer Verlag, Berlin, Heidelberg, New York, Tokyo, 1985.
S. Wright, “An inexact algorithm for composite nondiffrentiable optimization,” Math. Programming, vol. 44, pp. 221–234, 1989.
D. Youla, “Generalized image restoration by the method of alternating orthogonal projections,” IEEE Trans. on Circuits and Systems, vol. CAS-25: 9, pp. 694–702, 1978.
Author information
Authors and Affiliations
Additional information
The work of Dan Butnariu was done while visiting the Department of Mathematics of the University of Texas at Arlington.
Rights and permissions
About this article
Cite this article
Butnariu, D., Mehrez, A. Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems. Comput Optim Applic 1, 307–326 (1992). https://doi.org/10.1007/BF00249640
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00249640