Based on the Moreau-Yosida regularization and a modified line search technique, a new implementable memoryless gradient method is proposed for solving non-smooth convex optimization problems. Under some reasonable conditions, the proposed algorithm has global convergence. Preliminary numerical results show that the algorithm is effective. |