A convex programming algorithm using a modified Lagrangian function

The paper is concerned with a continuous and a discrete convex programming algorithm which makes use of a modified Lagrangian function. In proving the convergence of the discrete algorithm the asymptotic stability of the continuous algorithm is used. The sequence of points generated by the discrete method is regarded as the path of a differential inclusion whose solutions are akin to those of the equation which defines the continuous algorithm.