|
Mathematics
Gradient Projection Algorithm for Strongly Convex Set
M. O. Golubev Moscow Institute of Physics and Technology (State University)
Abstract:
In our work we will discuss standard gradient projection algorithm, where a set is strongly convex of radius $R$ and a function is convex, differentiable and its gradient satisfies Lipschitz condition. We proved that under some natural additional conditions algorithm converges with the rate of a geometric progression.
Key words:
Hilbert space, gradient projection algorithm, metric projection, strongly convex set of radius $R$.
Citation:
M. O. Golubev, “Gradient Projection Algorithm for Strongly Convex Set”, Izv. Saratov Univ. Math. Mech. Inform., 13:1(2) (2013), 33–38
Linking options:
https://www.mathnet.ru/eng/isu368 https://www.mathnet.ru/eng/isu/v13/i2/p33
|
|