Abstract:
The gradient projection method is generalized to the case of nonconvex sets of constraints representing the set-theoretic intersection of a smooth surface with a convex closed set. Necessary optimality conditions are studied, and the convergence of the method is analyzed.
Key words:smooth surface, convex closed set, gradient projection method, necessary conditions for a local minimum, convergence of an algorithm.
References