|
This article is cited in 5 scientific papers (total in 5 papers)
Gradient projection method for optimization problems with a constraint in the form of the intersection of a smooth surface and a convex closed set
Yu. A. Chernyaev Kazan National Research Technical University, Kazan, 420111 Tatarstan, Russia
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.
Received: 16.05.2017
Citation:
Yu. A. Chernyaev, “Gradient projection method for optimization problems with a constraint in the form of the intersection of a smooth surface and a convex closed set”, Zh. Vychisl. Mat. Mat. Fiz., 59:1 (2019), 37–49; Comput. Math. Math. Phys., 59:1 (2019), 34–45
Linking options:
https://www.mathnet.ru/eng/zvmmf10815 https://www.mathnet.ru/eng/zvmmf/v59/i1/p37
|
Statistics & downloads: |
Abstract page: | 209 | References: | 17 |
|