A gradient method for the modified Lagrange function

A gradient method with an adaptive procedure for choosing the step length is applied to search for the saddle point of the modified Lagrange function of a convex programming problem. It is shown that the process is convergent to a saddle point. when sufficient conditions for a strict regular maximum are satisfied, the rate of convergence is exponential.