Analysis of the convergence rate for the cyclic projection algorithm applied to basic semialgebraic convex sets

SIAM Journal on Optimization

Volumn 24, Issue 1, 2014, Pages 498-527

  Borwein, Jonathan M ^a   Li, Guoyin ^b   Yao, Liangjin ^a  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Basic semialgebraic convex set; Convex polynomial; Cyclic projection algorithm; Distance function; Fej r monotone sequence; H lderian regularity; Projector operator; Von Neumann alternating projection method; ojasiewicz's inequality

Indexed keywords

ALGORITHMS;

ALTERNATING PROJECTION METHOD; CONVEX SET; DISTANCE FUNCTIONS; MONOTONE SEQUENCES; PROJECTION ALGORITHMS; PROJECTOR OPERATOR;

SET THEORY;

EID: 84897562389     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/130919052     Document Type: Article

References (42)

1. Y. Alber and S. Reich, An iterative method for solving a class of nonlinear operator equations in Banach spaces, Panamer. Math. J., 4 (1994), pp. 39-54.
2. H. Attouch, J. Bolte, P. Redont, and A. Soubeyran, Proximal alternating minimization and projection methods for nonconvex problems: An approach based on the Kurdyka-Lojasiewicz inequality, Math. Oper. Res., 35 (2010), pp. 438-457.
3. H. Attouch, J. Bolte, and B. Svaiter, Convergence of descent methods for semi-algebraic and tame problems: Proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods, Math. Program. Ser. A, 137 (2013), pp. 91-129.
4. A. Auslender and M. Teboulle, Asymptotic cones and functions in optimization and variational inequalities, Springer Monogr. Math., Springer-Verlag, New York, 2003.
5. A. Auslender, Existence of optimal solutions and duality results under weak conditions, Math. Program., 88 (2000), pp 45-59.
6. J.-B. Baillon, P. L. Combettes, and R. Cominetti, There is no variational characterization of the cycles in the method of periodic projections, J. Funct. Anal., 262 (2012), pp. 400-408.
7. H. H. Bauschke, Projection algorithms: Results and open problems, in Inherently Parallel Algorithms in Feasibility and Optimization and their Applications, 2001, pp. 11-22.
8. H. H. Bauschke and J. M. Borwein, On the convergence of von Neumann's alternating projection algorithm for two sets, Set-Valued Anal., 1 (1993), pp. 185-212.
9. H. H. Bauschke and J. M. Borwein, Dykstra's alternating projection algorithm for two sets, J. Approxim. Theory, 79 (1994), pp. 418-443.
10. H. H. Bauschke and J. M. Borwein, On projection algorithms for solving convex feasibility problems, SIAM Rev., 38 (1996), pp. 367-426. (Pubitemid 126599619)
11. H. H. Bauschke, J. M. Borwein, and A. S. Lewis, The method of cyclic projections for closed convex sets in Hilbert space, in Recent Developments in Optimization Theory and Nonlinear Analysis, Contemporary Mathematic 204, 1997, pp. 1-38.
12. H. H. Bauschke and P. L. Combettes, Convex Analysis and Monotone Operator Theory in Hilbert Spaces, Springer-Verlag, New York, 2011.
13. H. H. Bauschke, D. R. Luke, H. M. Phan, and X. Wang, Restricted normal cones and the method of alternating projections, in Set-Valued and Variational Analysis, in press, http://arxiv.org/abs/1205.0318v1.
14. E. G. Belousov, Introduction to Convex Analysis and Integer Programming, Izdat. Moskov. Univ., Moscow, 1977
15. E. G. Belousov, On types of H ausdorff discontinuity from above for convex closed mappings, Optimization, 49 (2001), pp. 303-325. (Pubitemid 33817578)
16. E. G. Belousov and D. Klatte, A Frank-Wolfe type theorem for convex polynomial programs, Comput. Optim. Appl., 22 (2002), pp. 37-48. (Pubitemid 34474874)
17. J. Bochnak, M. Coste and M. F. Roy, Real Algebraic Geometry, Springer-Verlag, New York, 1998.
18. J. M. Borwein and J. D. Vanderwerff, Convex Functions, Cambridge University Press, Cambridge, 2010.
19. L. M. Br̀egman, Finding the common point of convex sets by the method of successive projection, Dokl. Akad. Nauk SSSR, 162 (1965), pp. 487-490.
20. R. E Bruck and S. Reich, Nonexpansive projections and resolvents of accretive operators in Banach spaces, Houston J. Math., 3 (1977), pp. 459-470.
21. F. Deutsch, Best Approximation in Inner Product Spaces, CMS Books Math./Ouvrage Math. SMC 7, Springer-Verlag, New York, 2001.
22. J. Gwózdziewicz, The Lojasiewicz exponent of an analytic function at an isolated zero, Comment. Math. Helv., 74 (1999), pp. 364-375.
23. L. G. Gubin, B. T. Polyak, and E. V. Raik, The method of projections for finding the common point of convex sets, Comput. Math. Math. Phys., 7 (1967), pp. 1-24.
24. J. W. Helton and J. W. Nie, Semidefinite representation of convex sets, Math. Program. Ser. A, 122 (2110), pp. 21-64.
25. D. Klatte, Hoffman's error bound for systems of convex inequalities, in Mathematical Programming with Data Perturbations, Lect. Notes Pure Appl. Math., Dekker, New York, 1998, pp.185-199.
26. J. Kollár, An effective Lojasiewicz inequality for real polynomials, Period. Math. Hungar., 38 (1999), pp. 213-221.
27. E. Kopecká and S. Reich, A note on the von Neumann alternating projections algorithm, J. Nonlinear Convex Anal., 5 (2004), pp. 379-386.
28. A. S. Lewis and J. S. Pang, Error bounds for convex inequality systems, Generalized Convexity, Generalized Monotonicity, J. P. Crouzeix, J. E. Martinez-Legaz, and M. Volle. eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 1998, pp. 75-110.
29. G. Li, On the asymptotic well behaved functions and global error bound for convex polynomials, SIAM J. Optim., 20 (2010), pp. 1923-1943.
30. G. Li and K. F. Ng, Error bounds of generalized D-gap functions for nonsmooth and non-monotone variational inequality problems, SIAM J. Optim., 20 (2009), pp. 667-690.
31. G. Li and B. S. Mordukhovich, Holder metric subregularity with applications to proximal point method, SIAM J. Optim., 22 (2012), pp. 1655-1684.
32. W. Li, Error bounds for piecewise convex quadratic programs and applications, SIAM J. Control Optim., 33 (1995), pp. 1510-1529.
33. X. D. Luo and Z. Q. Luo, Extension of Hoffman's error bound to polynomial systems, SIAM J. Optim., 4 (1994), pp. 383-392.
34. Z. Q. Luo, J. S. Pang, and D. Ralph, Mathematical Programs with Equilibrium Constraints, Cambridge University Press, Cambridge, 1996.
35. W. T. Obuchowska, On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes, Comput. Optim. Appl., 33 (2006), pp. 349-364.
36. J. S. Pang, Error bounds in mathematical programming, Math. Program., 79 (1997), pp. 299-332.
37. R. R. Phelps, Convex Functions, Monotone Operators and Differentiability, 2nd ed., Springer-Verlag, New York, 1993.
38. S. M. Robinson, Regularity and Stability for Convex Multivalued Functions, Math. Oper. Res., 1 (1976), pp. 130-143.
39. R. T. Rockafellar and R. J.-B. Wets, Variational Analysis, Springer-Verlag, New York, 2009.
40. V. M Shironin, On Hausdorff continuity of convex and convex polynomial mappings, in Mathematical Optimization: Questions of Solvability and Stability, E.G. Belousov and B. Bank, eds., Moscow University, Moscow, 1986.
41. J. von Neumann, Functional Operators, Vol. II, Princeton University Press, Princeton, NJ, 1950.
42. C. Zǎlinescu, Convex Analysis in General Vector Spaces, World Scientific, River Edge, NJ, 2002.