Proves global linear convergence of a gradient projection method on manifolds via the Lezanski-Polyak-Lojasiewicz condition and identifies conditions for linear-rate global convergence of the full-step conditional gradient algorithm.
Vial, Strong and weak convexity of sets and functions, Mathematics of Operations Research, 8:2 (1983), 231–259
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Gradient projection and conditional gradient methods for constrained nonconvex minimization
Proves global linear convergence of a gradient projection method on manifolds via the Lezanski-Polyak-Lojasiewicz condition and identifies conditions for linear-rate global convergence of the full-step conditional gradient algorithm.