Numerical algorithm for solving mathematical programming problems with a smooth surface as a constraint

Аннотация

A numerical algorithm for minimizing a convex function on a smooth surface is proposed. The algorithm is based on reducing the original problem to a sequence of convex programming problems. Necessary extremum conditions are examined, and the convergence of the algorithm is analyzed.