Displaying similar documents to “Selection strategies in projection methods for convex minimization problems”

Numerical behavior of the method of projection onto an acute cone with level control in convex minimization

Robert Dylewski (2000)

Discussiones Mathematicae, Differential Inclusions, Control and Optimization

Similarity:

We present the numerical behavior of a projection method for convex minimization problems which was studied by Cegielski [1]. The method is a modification of the Polyak subgradient projection method [6] and of variable target value subgradient method of Kim, Ahn and Cho [2]. In each iteration of the method an obtuse cone is constructed. The obtuse cone is generated by a linearly independent system of subgradients. The next approximation of a solution is the projection onto a translated...