Solving nonsmooth inclusions in the convex case
- 23 Downloads
We give a method for solving the inclusion 0εF(x), whereF is a set-valued map from a Hilbert space into a Banach space, whose graph is a closed convex set. The given algorithms are convergent if the problem is consistent and terminate after a finite number of iterations if otherwise. A convergence rate of geometrical progression is also obtained if a regularity condition of the Robinson's type is assumed.
Key wordsConvex set-valued map support function inclusion convex inequality subgradient method
Unable to display preview. Download preview PDF.
- Dien PH, Phung HT (1989) An Algorithm for Finding a Solution to the Inclusion 0εF(x). J Optim Theor Appl (to appear)Google Scholar
- Robinson SM (1975) A Subgradient Algorithm for SolvingK-convex Inequalities. Optimization and Operation Research, Lecture Notes in Economics and Mathematical Systems 117. Springer, Berlin, pp 237–245Google Scholar
- Eremin II (1965) The Relaxation Method of Solving Systems of Inequalities with Convex Functions on the Left Side. Soviet Math Doklady 6:219–222Google Scholar
- Dien PH (1983) Locally Lipschitzian set-valued maps and generalized extremal problems. Acta Math Viet 8:109–122Google Scholar
- Lemarechal C (1986) Construction Bundle Methods for Convex Optimization. Hiriarty-Urruty JB (ed) Fermat Days 85. North-Holland, AmsterdamGoogle Scholar
- Poljak BT (1969) Minimization of Unsmooth Functional. USSR Comp Math and Math Phys, 9(3): 14–29Google Scholar
- Shor NZ (1968) The Rate of Convergence of the Generalized Gradient Descent Method. Cybernetics 4(3):79–80Google Scholar
- Aubin IP, Ekeland IV (1984) Applied Nonlinear Analysis. Wiley, New YorkGoogle Scholar
- Bazaraa MS, Shetty CM (1979) Nonlinear Programming Theory and Algorithms. Wiley, New YorkGoogle Scholar