We propose new projection method for nonsmooth convex minimization problems. We present some method of subgradient selection, which is based on the so called residual selection model and is a generalization of the so called obtuse cone model. We also present numerical results for some test problems and compare these results with some other convex nonsmooth minimization methods. The numerical results show that the presented selection strategies ensure long steps and lead to an essential acceleration of the convergence of projection methods.
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmdico_1034,
author = {Andrzej Cegielski and Robert Dylewski},
title = {Selection strategies in projection methods for convex minimization problems},
journal = {Discussiones Mathematicae, Differential Inclusions, Control and Optimization},
volume = {22},
year = {2002},
pages = {97-123},
zbl = {1175.90310},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmdico_1034}
}
Andrzej Cegielski; Robert Dylewski. Selection strategies in projection methods for convex minimization problems. Discussiones Mathematicae, Differential Inclusions, Control and Optimization, Tome 22 (2002) pp. 97-123. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmdico_1034/
[000] [1] A. Cegielski, Projection onto an acute cone and convex feasibility problems, J. Henry and J.-P. Yvon (eds.), Lecture Notes in Control and Information Science 197, Springer- Verlag, London (1994), 187-194. | Zbl 0816.90108
[001] [2] A. Cegielski, A method of projection onto an acute cone with level control in convex minimization, Mathematical Programming 85 (1999), 469-490. | Zbl 0973.90057
[002] [3] A. Cegielski, Obtuse cones and Gram matrices with non-negative inverse, Linear Algebra and its Applications 335 (2001), 167-181. | Zbl 0982.15028
[003] [4] A. Cegielski and R. Dylewski, Residual selection in a projection method for convex minimization problems, (submitted). | Zbl 1057.49021
[004] [5] J. Charalambous and A.R. Conn, An efficient method to solve the minimax problem directly, SIAM J. Num. Anal. 15 (1978), 162-187. | Zbl 0384.65032
[005] [6] R. Dylewski, Numerical behavior of the method of projection onto an acute cone with level control in convex minimization, Discuss. Math. Differential Inclusions, Control and Optimization 20 (2000), 147-158. | Zbl 1014.65048
[006] [7] S. Kim, H. Ahn and S.-C. Cho, Variable target value subgradient method, Mathematical Programming 49 (1991), 359-369. | Zbl 0825.90754
[007] [8] K.C. Kiwiel, The efficiency of subgradient projection methods for convex optimization, part I: General level methods, SIAM J. Control and Optimization 34 (1996), 660-676. | Zbl 0846.90084
[008] [9] K.C. Kiwiel, The efficiency of subgradient projection methods for convex optimization, part II: Implementations and extensions, SIAM J. Control and Optimization 34 (1996), 677-697. | Zbl 0846.90085
[009] [10] K.C. Kiwiel, Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems, Linear Algebra and Applications 252 (1997), 27-33. | Zbl 0870.65046
[010] [11] C. Lemaréchal and R. Mifflin, A set of nonsmooth optimization test problems, Nonsmooth Optimization, C. Lemarechal, R. Mifflin, (eds.), Pergamon Press, Oxford 1978, 151-165.
[011] [12] C. Lemaréchal, A.S. Nemirovskii and Yu.E. Nesterov, New variants of bundle methods, Math. Progr. 69 (1995), 111-147. | Zbl 0857.90102
[012] [13] N.Z. Shor, Minimization Methods for Non-differentiable Functions, Springer-Verlag, Berlin 1985. | Zbl 0561.90058
[013] [14] H. Schramm and J. Zowe, A version of the bundle idea for minimizing of a nonsmooth function: conceptual idea, convergence analysis, numerical results, SIAM J. Control and Optimization 2 (1992), 121-152. | Zbl 0761.90090
[014] [15] M.J. Todd, Some remarks on the relaxation method for linear inequalities,. Technical Report 419 (1979), Cornell University.