Polyaks subgradient method with simplified projection for nondifferentiable optimization with linear constraints

Abstract

The projection operation required in the Polyaks subgradient method for nondifferentiable optimization problems with linear constraints is simplified. The modified method finds a new search direction in the cone of feasible directions at the current point. This greatly reduces the dimension of the projection operation. A computational test shows significant improvement in the computational efficiency.