Reflection-projection method for convex feasibility problems with an obtuse cone

Journal of Optimization Theory and Applications

Volumn 120, Issue 3, 2004, Pages 503-531

  Bauschke, H H ^a   Kruk, S G ^b  

^a UNIVERSITY OF GUELPH   (Canada)

^b OAKLAND UNIVERSITY   (United States)

Author keywords

Convex feasibility problems; Obtuse cones; Projection methods; Self dual cones

Indexed keywords

CONES; MATRIX ALGEBRA; SET THEORY;

CLOSED CONVEX SETSS; CONVEX FEASIBILITY PROBLEM; DUAL CONES; FEASIBILITY PROBLEM; NUMERICAL EXPERIMENTS; OBTUSE CONES; POSITIVE SEMIDEFINITE; PROJECTION METHOD; SELF-DUAL; SELF-DUAL CONE;

NUMERICAL METHODS;

EID: 3843099227     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:JOTA.0000025708.31430.22     Document Type: Article

References (44)

1. BAUSCHKE, H. H., Projection Algorithms and Monotone Operators, PhD Thesis, Simon Fraser University, 1996. Available at www.cecm.sfu.ca/preprints/ 1996pp.html as 96:080.
2. BAUSCHKE, H. H., and BORWEIN, J. M., On Projection Algorithms for Solving Convex Feasibility Problems, SIAM Review, Vol. 38, pp. 367-426, 1996.
3. CENSOR, Y., and ZENIOS, S. A., Parallel Optimization, Oxford University Press, Oxford, UK, 1997.
4. COMBETTES, P. L., Hilbertian Convex Feasibility Problem: Convergence of Projection Methods, Applied Mathematics and Optimization, Vol. 35, pp. 311-330, 1997.
5. CROMBEZ, G., Parallel Algorithms for Finding Common Fixed Points of Para-contractions, Numerical Functional Analysis and Optimization, Vol. 23, pp. 47-59, 2002.
6. KIWIEL, K. C., and ŁOPUCH, B., Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings, SIAM Journal of Optimization, Vol. 7, pp. 1084-1102, 1997.
7. MOTZKIN, T. S., and SCHOENBERG, I. J., The Relaxation Method for Linear Inequalities, Canadian Journal of Mathematics, Vol. 6, pp. 393-404, 1954.
8. CIMMINO, G., Calcolo Approssimato per le Soluzioni dei Sistemi di Equazioni Lineari, La Ricerca Scientifica ed il Progresso Tecnico nella Economia Nazionale (Roma), Vol. 1, pp. 326-333, 1938.
9. GOEBEL, K., and KIRK, W. A., Topics in Metric Fixed-Point Theory, Cambridge University Press, Cambridge, UK, 1990.
10. ZARANTONELLO, E. H., Projections on Convex Sets in Hilbert Space and Spectral Theory, Contributions to Nonlinear Functional Analysis, Edited by E. H. Zarantonello, Academic Press, New York, NY, pp. 237-424, 1971.
11. MOREAU, J. J., Décomposition Orthogonale d'un Espace Hilbertien selon Deux Cônes Mutuellement Polaires, Comptes Rendus des Séances de l'Académie des Sciences, Paris, Séries A B, Vol. 255, pp. 238-240, 1962.
12. ROCKAFELLAR, R. T., Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.
13. GOFFIN, J. L., The Relaxation Method for Solving Systems of Linear Inequalities, Mathematics of Operations Research, Vol. 5, pp. 388-414, 1980.
14. TODD, M. J., Some Remarks on the Relaxation Method for Linear Inequalities, Technical Report 419, School of Operations Research and Industrial Engineering, Cornell University, 1979.
15. CEGIELSKI, A., Projection onto an Acute Cone and Convex Feasibility Problem, System Modelling and Optimization (Compiègne, 1993); Lecture Notes in Control and Information Sciences, Edited by J. Henry and J. P. Yvon, Springer Verlag, London, UK, Vol. 197, pp. 187-194, 1994.
16. CEGIELSKI, A., A Method of Projection onto an Acute Cone with Level Control in Convex Minimization, Mathematical Programming, Vol. 85, pp. 469-490, 1999.
17. CEGIELSKI, A., Obtuse Cones and Gram Matrices with Nonnegative Inverse, Linear Algebra and Its Applications, Vol. 335, pp. 167-181, 2001.
18. CEGIELSKI, A., and DYLEWSKI, R., Residual Selection in a Projection Method for Convex Minimization Problems, Optimization, Vol. 52, pp. 211-220, 2003.
19. KIWIEL, K. C., The Efficiency of Subgradient Projection Methods for Convex Optimization, Part 2: Implementations and Extensions, SIAM Journal on Control and Optimization, Vol. 34, pp. 677-697, 1996.
20. KIWIEL, K. C., Monotone Gram Matrices and Deepest Surrogate Inequalities in Accelerated Relaxation Methods for Convex Feasibility Problems, Linear Algebra and Its Applications, Vol. 252, pp. 27-33, 1997.
21. GÜLER, O., Barrier Functions in Interior-Point Methods, Mathematics of Operations Research, Vol. 21, pp. 860-885, 1996.
22. NESTEROV, Y. E., and TODD, M. J., Self-Scaled Barriers and Interior-Point Methods for Convex Programming, Mathematics of Operations Research, Vol. 22, pp. 1-42, 1997.
23. LOBO, M. S., VANDENBERGHE, L., BOYD, S., and LEBRET, H., Applications of Second-Order Cone Programming, Linear Algebra and Its Applications, Vol. 284, pp. 193-228, 1998.
24. BRUCK, R. E., and REICH, S. Nonexpansive Projections and Resolvents of Accretive Operators in Banach Spaces, Houston Journal of Mathematics, Vol. 3, pp. 459-470, 1977.
25. DE PIERRO, A. R., and IUSEM, A. N., On the Asymptotic Behavior of Some Alternate Smoothing Series Expansion Iterative Methods, Linear Algebra and Its Applications, Vol. 130, pp. 3-24, 1990.
26. BAUSCHKE, H. H., Projection Algorithms: Results and Open Problems, Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications (Haifa, 2000); Edited by D. Butnariu, Y. Censor, and S. Reich, Elsevier, Amsterdam, Holland, pp. 11-22, 2001.
27. COMBETTES, P. L., Quasi-Fejérian Analysis of Some Optimization Algorithms, Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications (Haifa, 2000); Edited by D. Butnariu, Y. Censor, and S. Reich, Elsevier, Amsterdam, Holland, pp. 115-152, 2001.
28. GROETSCH, C. W., Generalized Inverses of Linear Operators: Representation and Approximation, Dekker, New York, NY, 1977.
29. DEUTSCH, F., Best Approximation in Inner Product Spaces, Springer, New York, NY, 2001.
30. GOLUB, G. H., and VAN LOAN, C. F., Matrix Computations, Johns Hopkins University Press, Baltimore, Maryland, 1996.
31. KRUK, S., Implementation of the Algorithms Discussed in This Manuscript, www.oakland.edu/~kruk=research/ProjRefl.
32. HORN, R. A., and JOHNSON, C. R., Matrix Analysis, Cambridge University Press, Cambridge, UK, 1985.
33. BORWEIN, J. M., and LEWIS, A. S., Convex Analysis and Nonlinear Optimization, Springer, New York, NY, 2000.
34. WOLKOWICZ, H., SAIGAL, R., and VANDENBERGHE, L., Editors, Handbook of Semidefinite Programming: Theory, Algorithms, and Applications, International Series in Operations Research and Management Science, Kluwer, Norwell, Massachusetts, Vol. 27, 2000.
35. VANDENBERGHE, L., and BOYD, S., Semidefinite Programming, SIAM Review, Vol. 38, pp. 49-95, 1996.
36. PARLETT, B. N., The Symmetric Eigenvalue Problem, Society for Industrial and Applied Mathematics, Philadelphia, Pennsylvania, 1998 (Corrected Reprint of the 1980 Original).
37. STEWART, G. W., Matrix Algorithms, Vol. 2: Eigensystems, Society for Industrial and Applied Mathematics, Philadelphia, Pennsylvania, 2001.
38. BAUSCHKE, H. H., BORWEIN, J. M., and LEWIS, A. S., The Method of Cyclic Projections for Closed Convex Sets in Hilbert Space, Recent Developments in Optimization Theory and Nonlinear Analysis (Jerusalem, 1995); Contemporary Mathematics, American Mathematical Society, Providence, Rhode Island, Vol. 204, pp. 1-38, 1997.
39. CHENEY, W., and GOLDSTEIN, A. A., Proximity Maps for Convex Sets, Proceedings of the American Mathematical Society, Vol. 10, pp. 448-450, 1959.
40. BAUSCHKE, H. H., and BORWEIN, J. M., Dykstra's Alternating Projection Algorithm for Two Sets, Journal of Approximation Theory, Vol. 79, pp. 418-443, 1994.
41. DE KLERK, E., ROOS, C., and TERLAKY, T., Infeasible-Start Semidefinite Programming Algorithms via Self-Dual Embeddings, Topics in Semidefinite and Interior-Point Methods (Toronto, 1996); Edited by P. M. Pardalos and H. Wolkowicz, American Mathematical Society, Providence, Rhode Island, pp. 215-236, 1998.
42. LUO, Z. Q., STURM, J. F., and ZHANG, S., Conic Convex Programming and Self-Dual Embedding, Optimization Methods and Software, Vol. 14, pp. 169-218, 2000.
43. STRANG, G., Linear Algebra and Its Applications, Academic Press, New York, NY, 1976.
44. KRUK, S., High-Accuracy Algorithms for the Solutions of Linear Programs, University of Waterloo, PhD Thesis, 2001.