The efficiency of subgradient projection methods for convex optimization, Part I: General level methods

SIAM Journal on Control and Optimization

Volumn 34, Issue 2, 1996, Pages 660-676

  Kiwiel, Krzysztof C ^a  

^a SYSTEMS RESEARCH INSTITUTE   (Poland)

Author keywords

Convex programming; Linear inequalities; Nondifferentiable (nonsmooth) optimization; Parallel computing; Relaxation methods; Subgradient optimization; Successive projections

Indexed keywords

PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

CONVEX PROGRAMMING; LINEAR INEQUALITIES; NONDIFFERENTIABLE OPTIMIZATION; RELAXATION METHODS; SUCCESSIVE PROJECTIONS;

MATHEMATICAL PROGRAMMING;

EID: 0030110299     PISSN: 03630129     EISSN: None     Source Type: Journal    
DOI: 10.1137/0334031     Document Type: Article

References (21)

1. S. AGMON, The relaxation method for linear inequalities, Canad. J. Math., 6 (1954), pp. 382-392.
2. M. S. BAZARAA AND H. D. SHERALI, On the choice of step size in subgradient optimization, European J. Oper. Res., 7 (1981), pp. 380-388.
3. Z. DREZNER, The nested ball principle for the relaxation method, Oper. Res., 31 (1983), pp. 587-590.
4. J.-L. GOFFIN, Convergence results in a class of variable metric subgradient methods, in Nonlinear Programming 4, O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, eds., Academic Press, New York, 1981, pp. 283-326.
5. L. G. GURIN, B. T. POLYAK, AND E. V. RAIK, The method of projections for finding a common point of convex sets, Zh. Vychisl. Mat. i Mat. Fiz., 7 (1967), pp. 1211-1228. (In Russian.) English transl. in U.S.S.R. Comput. Math. and Math. Phys. 7 (1967), pp. 1-24.
6. L. G. GURIN, B. T. POLYAK, AND E. V. RAIK, The method of projections for finding a common point of convex sets, Zh. Vychisl. Mat. i Mat. Fiz., 7 (1967), pp. 1211-1228. (In Russian.) English transl. in U.S.S.R. Comput. Math. and Math. Phys. 7 (1967), pp. 1-24.
7. J.-B. HIRIART-URRUTY AND C. LEMARÉCHAL, Convex Analysis and Minimization Algorithms, Springer-Verlag, Berlin, 1993.
8. S. KIM, H. AHN, AND S.-C. CHO, Variable target value subgradient method, Math. Programming, 49 (1991), pp. 359-369.
9. K. C. KIWIEL, Methods of Descent for Nondifferentiable Optimization, Lecture Notes in Mathematics 1133, Springer-Verlag, Berlin, 1985.
10. K. C. KIWIEL, Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities, Math. Programming 69 (1995), pp. 89-109.
11. The efficiency of subgradient projection methods for convex optimization, part II: Implementations and extensions, SIAM J. Control Optim., 34 (1996), pp. 677-697.
12. A. N. KULIKOV AND V. R. FAZILOV, Convex optimization with prescribed accuracy, Zh. Vychisl. Mat. i Mat. Fiz., 30 (1990), pp. 663-671. (In Russian.)
13. C. LEMARÉCHAL, Nondifferentiable optimization, in Optimization, Handbooks in Operations Research and Management Science, vol. 1, G. L. Nemhauser, A. H. G. Rinnooy-Kan, and M. J. Todd, eds., North-Holland, Amsterdam, 1989, pp. 529-572.
14. C. LEMARÉCHAL, A. S. NEMIROVSKII, AND YU. E. NESTEROV, New variants of bundle methods, Research report 1508, INRIA, Rocquencourt, 1991.
15. New variants of bundle methods, Math. Programming, 69 (1995), pp. 111-147.
16. T. MOTZKIN AND I. J. SCHOENBERG, The relaxation method for linear inequalities, Canad. J. Math., 6 (1954), pp. 393-404.
17. J. F. MAURRAS, K. TRUMPER, AND M. AKGÜL, Polynomial algorithms for a class of linear programs, Math. Programming, 21 (1981), pp. 121-136.
18. A. S. NEMIROVSKII AND D. B. YUDIN, Problem Complexity and Method Efficiency in Optimization, Nauka, Moscow, 1979. (In Russian.) English translation Wiley, New York, 1983.
19. B. T. POLYAK, Minimization of unsmooth functional, Zh. Vychisl. Mat. i Mat. Fiz., 9 (1969), pp. 509-521. (In Russian.) English transl. in U.S.S.R. Comput. Math. and Math. Phys. 9 (1969), pp. 14-29.
20. B. T. POLYAK, Minimization of unsmooth functional, Zh. Vychisl. Mat. i Mat. Fiz., 9 (1969), pp. 509-521. (In Russian.) English transl. in U.S.S.R. Comput. Math. and Math. Phys. 9 (1969), pp. 14-29.
21. J. TELGEN, On relaxation methods for systems of linear inequalities, European J. Oper. Res., 9 (1982), pp. 184-189.