A parametric method of linearization in mathematical programming problems

The mathematical programming problem with constraints in the form of convex inequalities, and a method of linearization for solving the problem, are studied. It is shown that the method has all the properties of the classical gradient descent method, widely used in unconstrained optimization problems. The method does not employ evaluations of the second derivatives or their approximation, and converges with an arbitrarily chosen initial approximation.