Generalized Bregman projections in convex feasibility problems

Journal of Optimization Theory and Applications

Volumn 96, Issue 1, 1998, Pages 139-157

  Kiwiel, K C ^a  

^a SYSTEMS RESEARCH INSTITUTE   (Poland)

Author keywords

B functions; Bregman functions; Convex feasibility problems; nondifferentiable optimization; subgradient algorithms; successive projections

Indexed keywords

SET THEORY;

BREGMAN; BREGMAN FUNCTION; BREGMAN PROJECTION; CLOSED CONVEX SETSS; CONVEX FEASIBILITY PROBLEM; NON-DIFFERENTIABLE OPTIMIZATION; SUB-GRADIENT ALGORITHM; SUCCESSIVE PROJECTION;

ORTHOGONAL FUNCTIONS;

EID: 0032332405     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022619318462     Document Type: Article

References (24)

1. BREGMAN, L. M., Finding a Common Point of Convex Sets by the Method of Successive Projections, Doklady Akademii Nauk SSSR, Vol. 162, pp. 487-490, 1965 (Russian); English Translation in Soviet Mathematics Doklady, Vol. 6, pp. 688-692, 1965.
2. BREGMAN, L. M., Finding a Common Point of Convex Sets by the Method of Successive Projections, Doklady Akademii Nauk SSSR, Vol. 162, pp. 487-490, 1965 (Russian); English Translation in Soviet Mathematics Doklady, Vol. 6, pp. 688-692, 1965.
3. CENSOR, Y., and LENT, A., An Iterative Row-Action Method for Interval Convex Programming, Journal of Optimization Theory and Applications, Vol. 34, pp. 321-353, 1981.
4. CENSOR, Y., and REICH, S., Iterations of Paracontractions and Firmly Non-expansive Operators with Applications to Feasibility and Optimization, Optimization, Vol. 37, pp. 323-339, 1996.
5. BAUSCHKE, H. H., and BORWEIN, J. M., Legendre Functions and the Method of Random Bregman Projections, Journal of Convex Analysis, Vol. 4, pp. 27-67, 1997.
6. CORVELLEC, J. N., and FLÅM, S. D., Nonconvex Feasibility Problems and Proximal Point Methods, Working Paper, Department of Economics, University of Bergen, Bergen, Norway, 1996.
7. KIWIEL, K. C., Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints, Mathematics of Operations Research, Vol. 22, pp. 326-349, 1997.
8. CENSOR, Y., IUSEM, A. N., and ZENIOS, S. A., An Interior-Point Method with Bregman Functions for the Variational Inequality Problem with Paramonotone Operators, Technical Report, Department of Mathematics and Computer Science, University of Haifa, Haifa, Israel, 1994.
9. CHEN, G., and TEBOULLE, M., Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions, SIAM Journal on Optimization, Vol. 3, pp. 538-543, 1993.
10. ECKSTEIN, J., Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming, Mathematics of Operations Research, Vol. 18, pp. 202-226, 1993.
11. KIWIEL, K. C., Proximal Minimization Methods with Generalized Bregman Functions, SIAM Journal on Control and Optimization, Vol. 35, pp. 1142-1168, 1997.
12. ALBER, YA., I., and BUTNARIU, D., Convergence of Bregman-Projection Methods for Solving Consistent Convex Feasibility Problems in Reflexive Banach Spaces, Technical Report, Department of Mathematics, University of Haifa, Haifa, Israel, 1994.
13. BAUSCHKE, H. H., and BORWEIN, J. M., On Projection Algorithms for Solving Convex Feasibility Problems, SIAM Review, Vol. 38, pp. 367-426, 1996.
14. CENSOR, Y., and ELFVING, T., A Multiprojection Algorithm Using Bregman Projections in a Product Space, Numerical Algorithms, Vol. 8, pp. 221-239, 1994.
15. KIWIEL, K. C., Block-Iterative Surrogate Projection Methods for Convex Feasibility Problems, Linear Algebra and Its Applications, Vol. 215, pp. 225-260, 1995.
16. KIWIEL, K. C., A Subgradient Method with Bregman Projections for Convex Constrained Nondifferentiable Minimization, Technical Report, Systems Research Institute, Warsaw, Poland, 1996.
17. ROCKAFELLAR, R. T., Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.
18. ELSNER, L., KOLTRACHT, I., and NEUMANN, M., Convergence of Sequential and Asynchronous Nonlinear Paracontractions, Numerische Mathematik, Vol. 62, pp. 305-319, 1992.
19. FLÅM, S. D., and ZOWE, J., Relaxed Outer Projections, Weighted Averages, and Convex Feasibility, BIT, Vol. 30, pp. 289-300, 1990.
20. TSENG, P., On the Convergence of the Products of Firmly Nonexpansive Maps, SIAM Journal on Optimization, Vol. 2, pp. 425-434, 1992.
21. POLYAK, B. T., Introduction to Optimization, Nauka, Moscow, USSR, 1983; English Translation by Optimization Software, New York, New York, 1987.
22. POLYAK, B. T., Introduction to Optimization, Nauka, Moscow, USSR, 1983; English Translation by Optimization Software, New York, New York, 1987.
23. ECKSTEIN, J., Approximate Iterations in Bregman-Function-Based Proximal Algorithms, Research Report RRR 12-96, RUTCOR, Rutgers University, New Brunswick, New Jersey, 1996.
24. KIWIEL, K. C., and LOPUCH, B., Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings, SIAM Journal on Optimization (to appear).