Abstract:
Algorithms given as differential insertions are described which are intended for solution of convex programming problems with the use of penalty functions. Questions are investigated in infinite extendibility of solutions to sets of differential insertions and their asymptotic behaviour.