Convex programming algorithm with a modified Lagrange function (Q759654)

We consider a continuous and a discrete algorithm for solving a convex programming problem, which uses a modified Lagrange function. The convergence of the discrete algorithm is proved using the asymptotic stability of the continuous algorithm. A sequence of points generated by the discrete method is treated as a path of some differential inclusion, whose solutions are close to the solutions of the continuous algorithm equation.