On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization *


Consider the problem of minimizing, over a polyhedral set, the composition of an affine mapping with a strictly convex essentially smooth function. A general result on the linear convergence of descent methods for solving this problem is presented. By applying this result, the linear convergence of both the gradient projection algorithm of Goldstein and… (More)



Citations per Year

139 Citations

Semantic Scholar estimates that this publication has 139 citations based on the available data.

See our FAQ for additional information.