Abstract
The aim of the paper is to show that, in uniformly convex Banach spaces, the powers of the norm with exponent r > 1 share a property called total convexity. Using this fact we establish a formula for determining Bregman projections on closed hyperplanes and half spaces. This leads to a method for solving linear operator equations (e.g., first order Fredholm and Volterra equations) in spaces which are uniformly convex and smooth.
References
- Y. Alber, D. Butnariu: Convergence of Bregman projection methods for solving convex feasibility problems in reflexive Banach spaces, Journal of Optimization Theory and Applications 92 (1997) 33–61.https://doi.org/10.1023/A:1022631928592Google Scholar
- L. M. Bregman: The relaxation method for finding common points of convex sets and its application to the solution of convex programming, USSR Computational Mathematics and Mathematical Physics 7 (1967) 200–217.https://doi.org/10.1016/0041-5553(67)90040-7Google Scholar
- E. F. Browder: Nonlinear operators and nonlinear equations of evolution in Banach spaces, Proceeding of Symposia in Pure Mathematics, American Mathematical Society 18(2) (1976).https://doi.org/10.1090/pspum/018.2Google Scholar
- R. S. Burachik, A. N. Iusem: A generalized proximal point algorithm for the variational inequality problem in a Hilbert space, SIAM Journal on Optimization 8 (1998) 197–216.https://doi.org/10.1137/S1052623495286302Google Scholar
- D. Butnariu, A. N. Iusem: Local moduli of convexity and their application to finding almost common fixed points of measurable families of operators, in: Y. Censor and S. Reich (eds.) “Recent Developments in Optimization Theory and Nonlinear Analysis”, Contemporary Mathematics 204 (1997) 61–92.https://doi.org/10.1090/conm/204/02623Google Scholar
- D. Butnariu, A. N. Iusem: On a proximal point method for convex optimization in Banach spaces, Numerical Functional Analysis and Optimization 18 (1997) 723–744.https://doi.org/10.1080/01630569708816788Google Scholar
- D. Butnariu, A. N. Iusem, R. Burachik: Iterative methods of solving stochastic convex feasibility problems and applications, J. of Computational Optimization and Applications 15(3) (2000) 269–307.https://doi.org/10.1023/A:1008795702124Google Scholar
- Y. Censor, S. A. Zenios: The proximal minimization algorithm with D-functions, Journal of Optimization Theory and Applications 73 (1992) 451–464.https://doi.org/10.1007/BF00940051Google Scholar
- Y. Censor, A. Lent: An iterative row action method for interval convex programming, Journal of Optimization Theory and Applications 34 (1981) 321–353.https://doi.org/10.1007/BF00934676Google Scholar
- G. Chen, M. Teboulle: Convergence analysis of a proximal-like optimization algorithm using Bregman functions, SIAM Journal on Optimization 3 (1993) 538–543.https://doi.org/10.1137/0803026Google Scholar
- G. Cimmino: Calcolo approsimato per le soluzione di sistemi di equazioni lineari, La Ricerca Scientifica, Roma, XVI, Anno IX 2 (1938) 326–333.Google Scholar
- I. Ciorãnescu: Geometry of Banach Spaces, Duality Mappings and Nonlinear Problems, Kluwer Academic Publishers, 1990.https://doi.org/10.1007/978-94-009-2121-4Google Scholar
- F. H. Clarke: Optimization and Nonsmooth Analysis, John Willey and Sons, New York, 1983.Google Scholar
- J. Diestel: Geometry of Banach Spaces – Selected Topics, Springer Verlag, Berlin, 1975.https://doi.org/10.1007/BFb0082079Google Scholar
- J. Eckstein: Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming, Mathematics of Operations Research 18 (1993) 202–226.https://doi.org/10.1287/moor.18.1.202Google Scholar
- D. Guo, V. Lakshmikantham, X. Liu: Nonlinear Integral Equations in Abstract Spaces, Kluwer Academic Publishers, 1996.https://doi.org/10.1007/978-1-4613-1281-9Google Scholar
- A. N. Iusem: On some properties of generalized proximal point methods for quadratic and linear programming, Journal of Optimization Theory and Applications 85 (1995) 593–612.https://doi.org/10.1007/BF02193058Google Scholar
- A. N. Iusem, C. A. Isnard: A mixed Hölder-Minkowsky inequality and total convexity in Banach spaces, Mathematical Inequalities and Applications, in publication.Google Scholar
- A. N. Iusem, C. A. Isnard, D. Butnariu: A mixed Hölder-Minkowsky inequality, Proceedings of the American Mathematical Society 127(3) (1999) 2405–2415.https://doi.org/10.1090/S0002-9939-99-04800-5Google Scholar
- K. Kiwiel: Proximal minimization methods with generalized Bregman functions, SIAM J. on Control and Optimization 35 (1997) 1142–1168.https://doi.org/10.1137/S0363012995281742Google Scholar
- J. von Neumann: Functional Operators - Vol. II, The Geometry of Orthogonal Spaces, in: “Annals of Mathematics Studies” 22, Princeton University Press, 1950.https://doi.org/10.1515/9781400882250Google Scholar
- R. R. Phelps: Convex Functions, Monotone Operators and Differentiability, Springer-Verlag, Berlin, 1993.Google Scholar
- A. C. Pipkin: A Course on Integral Equations, Springer-Verlag, 1991.https://doi.org/10.1007/978-1-4612-4446-2Google Scholar
- R. T. Rockafellar: Monotone operators and the proximal point algorithm, SIAM Journal on Control and Optimization 14 (1976) 877–898.https://doi.org/10.1137/0314056Google Scholar
- Z.-B. Xu, G. F. Roach: Characteristic inequalities of uniformly convex and uniformly smooth Banach spaces, Journal of Mathematical Analysis and Applications 157 (1991) 189–210.https://doi.org/10.1016/0022-247X(91)90144-OGoogle Scholar
Suggested citation
Published by Heldermann Verlag, 2000. Rights now held by Banach Press.
