- Full text PDF available (4)
- This year (0)
- Last 5 years (1)
- Last 10 years (5)
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… (More)
We present the numerical behavior of a projection method for convex minimization problems which was studied by Cegielski . The method is a modification of the Polyak subgradient projection method  and of variable target value subgradient method of Kim, Ahn and Cho . In each iteration of the method an obtuse cone is constructed. The obtuse cone is… (More)
We study a projection method with level control for nonsmoooth convex minimization problems. We introduce a changeable level parameter to level control. The level estimates the minimal value of the objective function and is updated in each iteration. We analyse the convergence and estimate the efficiency of this method.
We propose a new projection method for linear feasibility problems. The method is based on the so called residual selection model. We present numerical results for some test problems.