Abstract:
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.
Key words:smooth surface, convex programming problem, projection onto a nonconvex set, necessary conditions for a local minimum, convergence of an algorithm.