Strong convergence of block-iterative outer approximation methods for convex optimization

SIAM Journal on Control and Optimization

Volumn 38, Issue 2, 2000, Pages 538-565

  Combettes, Patrick L ^a,b  

^a SORBONNE UNIVERSITÉ   (France)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; OPTIMIZATION;

BLOCK ITERATIVE OUTER APPROXIMATION; REFLEXIVE BANACH SPACE;

SET THEORY;

EID: 0033889575     PISSN: 03630129     EISSN: None     Source Type: Journal    
DOI: 10.1137/S036301299732626X     Document Type: Article

References (55)

1. V. BARBU AND TH. PRECUPANU, Convexity and Optimization in Banach Spaces, 2nd ed., D. Reidel, Boston, MA, 1986.
2. H. H. BAUSCHKE, The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space, J. Math. Anal. Appl., 202 (1996), pp. 150-159.
3. H. H. BAUSCHKE AND J. M. BORWEIN, Dykstra's alternating projection algorithm for two sets, J. Approx. Theory, 79 (1994), pp. 418-443.
4. H. H. BAUSCHKE AND J. M. BORWEIN, On projection algorithms for solving convex feasibility problems, SIAM Rev., 38 (1996), pp. 367-426.
5. J. W. BLANKENSHIP AND J. E. FALK, Infinitely constrained optimization problems, J. Optim. Theory Appl., 19 (1976), pp. 261-281.
6. J. P. BOYLE AND R. L. DYKSTRA, A method for finding projections onto the intersection of convex sets in Hilbert spaces, in Advances in Order Restricted Statistical Inference, Lecture Notes in Statist. 37, Springer-Verlag, New York, 1986, pp. 28-47.
7. H. BRÉZIS, Analyse Fonctionnelle, 2nd ed., Masson, Paris, 1993.
8. E. W. CHENEY AND A. A. GOLDSTEIN, Newton's method for convex programming and Tchebycheff approximation, Numer. Math., 1 (1959), pp. 253-268.
9. P. L. COMBETTES, Inconsistent signal feasibility problems: Least-squares solutions in a product space, IEEE Trans. Signal Process., 42 (1994), pp. 2955-2966.
10. P. L. COMBETTES, Construction d'un point fixe commun àune. famille de contractions fermes, C. R. Acad. Sci. Paris Sér. I Math., 320 (1995), pp. 1385-1390.
11. P. L. COMBETTES, The convex feasibility problem in image recovery, in Advances in Imaging and Electron Physics, P. Hawkes, ed., vol. 95, Academic Press, New York, 1996, pp. 155-270.
12. P. L. COMBETTES, Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections, IEEE Trans. Image Process., 6 (1997), pp. 493-506.
13. P. L. COMBETTES, Hilbertian convex feasibility problem: Convergence of projection methods, Appl. Math. Optim., 35 (1997), pp. 311-330.
14. G. CROMBEZ, Finding projections onto the intersection of convex sets in Hilbert spaces, Numer. Funct. Anal. Optim., 16 (1995), pp. 637-652.
15. R. DAUTRAY AND J.-L. LIONS, Analyse Mathématique et Calcul Numérique pour les Sciences et les Techniques, Masson, Paris, 1984. English translation: Springer-Verlag, New York, 1988.
16. M. A. H. DEMPSTER AND R. R. MERKOVSKY, A practical geometrically convergent cutting plane algorithm, SIAM J. Numer. Anal., 32 (1995), pp. 631-644.
17. A. R. DE PIERRO AND A. N. IUSEM, A parallel projection method for finding a common point of a family of convex sets, Pesqui. Oper., 5 (1985), pp. 1-20.
18. F. DEUTSCH, The method of alternating orthogonal projections, in Approximation Theory, Spline Functions and Applications, S. P. Singh, ed., Kluwer, The Netherlands, 1992, pp. 105-121.
19. B. C. EAVES AND W. I. ZANGWILL, Generalized cutting plane algorithms, SIAM J. Control, 9 (1971), pp. 529-542.
20. R. E. EDWARDS, Functional Analysis - Theory and Applications, 2nd ed., Dover, New York, 1995.
21. N. GAFFKE AND R. MATHAR, A cyclic projection algorithm via duality, Metrika, 36 (1989), pp. 29-54.
22. U. GARCÍA-PALOMARES, Parallel projected aggregation methods for solving the convex feasibility problem, SIAM J. Optim., 3 (1993), pp. 882-900.
23. F. GLOVER, A multiphase-dual algorithm for the zero-one integer programming problem, Oper. Res., 13 (1965), pp. 879-919.
24. K. GOEBEL AND W. A. KIRK, Topics in Metric Fixed Point Theory, Cambridge University Press, Cambridge, UK, 1990.
25. I. HALPERIN, The product of projection operators, Acta Sci, Math. (Szeged), 23 (1962), pp. 96-99.
26. Y. HAUGAZEAU, Sur la minimisation de formes quadratiques avec contraintes, C. R. Acad. Sci. Paris Sér. A Math., 264 (1967), pp. 322-324.
27. Y. HAUGAZEAU, Sur les Inéquations Variationnelles et la Minimisation de Fonctionnelles Convexes, Thèse, Université de Paris, Paris, France, 1968.
28. H. HUNDAL AND F. DEUTSCH, Two generalizations of Dykstra's cyclic projections algorithm, Math. Programming, 77 (1997), pp. 335-355.
29. A. N. IUSEM AND B. F. SVAITER, A row-action method for convex programming, Math. Programming, 64 (1994), pp. 149-171.
30. A. A. KAPLAN, Determination of the extremum of a linear function on a convex set, Soviet Math. Dokl., 9 (1968), pp. 269-271.
31. J. E. KELLEY, The cutting-plane method for solving convex programs, J. SIAM, 8 (1960), pp. 703 712.
32. K. C. KIWIEL, Block-iterative surrogate projection methods for convex feasibility problems, Linear Algebra Appl., 215 (1995), pp. 225-259.
33. K. C. KIWIEL, Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems, Linear Algebra Appl., 252 (1997), pp. 27-33.
34. K. C. KIWIEL AND B. LOPUCH, Surrogate projection methods for finding fixed points of firmly nonexpansive mappings, SIAM J. Optim., 7 (1997), pp. 1084-1102.
35. P. J. LAURENT AND B. MARTINET, Méthodes duales pour le calcul du minimum d'une fonction convexe sur une intersection de convexes, in Symposium on Optimization, Lecture Notes in Math. 132, Springer-Verlag, New York, 1970, pp. 159-180.
36. E. S. LEVITIN, Perturbation Theory in Mathematical Programming and Its Applications, Wiley, New York. 1994.
37. E. S. LEVITIN AND B. T. POLYAK, Constrained minimization methods, USSR Comput. Math. Math. Phys., 6 (1966), pp. 1-50.
38. P.-L. LIONS, Approximation de points fixes de contractions, C. R. Acad. Sci. Paris Sér. A Math., 284 (1977), pp. 1357-1359.
39. A. I. LOBYREV, The minimization of a strictly convex function on an intersection of convex sets, Optimizacija, 5 (1972), pp. 128-132.
40. Y. I. MERZLYAKOV, On a relaxation method of solving systems of linear inequalities, USSR Comput. Math. Math. Phys., 2 (1963), pp. 504-510.
41. W. OETTLI, Solving optimization problems with many constraints by a sequence of subproblems containing only two constraints, Math. Nachr., 71 (1976), pp. 143-145.
42. N. OTTAVY, Strong convergence of projection-like methods in Hilbert spaces, J. Optim. Theory Appl., 56 (1988). pp. 433-461.
43. N. S. PAPAGEORGIOU, Convex integral functional, Trans. Amer. Math. Soc., 349 (1997), pp. 1421-1436.
44. G. PIERRA, Eclatement de contraintes en parallèle pour la minimisation d'une forme quadratique, in Lecture Notes in Comput. Sci. 41, Springer-Verlag, New York, 1976, pp. 200-218.
45. G. PIERRA, Decomposition through formalization in a product space, Math. Programming, 28 (1984), pp. 96-115.
46. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
47. R. T. ROCKAFELLAR, Conjugate Duality and Optimization, SIAM, Philadelphia, PA, 1974.
48. I. SINGER, Best Approximation in Normed Linear Spaces by Elements of Linear Subspaces, Springer-Verlag, New York, 1970.
49. D. M. TOPKIS, Cutting-plane methods without nested constraint sets, Oper. Res., 18 (1970), pp. 404-413.
50. D. M. TOPKIS, A cutting-plane algorithm with linear and geometric rates of convergence, J. Optim. Theory Appl., 36 (1982), pp. 1-22.
51. V. V. VASIN, Iterative methods for solving ill-posed problems with a priori information in Hilbert spaces, USSR Comput. Math. Math. Phys., 28 (1988), pp. 6-13.
52. A. F. VEINOTT, The supporting hyperplane method for unimodal programming, Oper. Res., 15 (1967), pp. 147-152.
53. A. A. VLADIMIROV, YU. E. NESTEROV, AND YU. N. C̃EKANOV, Uniformly convex functionals, Vestnik Moskov. Univ. Ser. XV Vychisl. Mat. Kibernet., 3 (1978), pp. 12-23.
54. C. ZǍLINESCU, On uniformly convex functions, J. Math. Anal. Appl., 95 (1983), pp. 344-374.
55. W. I. ZANGWILL, Nonlinear Programming - A Unified Approach, Prentice-Hall, Englewood Cliffs, NJ, 1969.