A worst-case complexity analysis for riemannian non-monotone line-search methods

INIS

• convergence 100%
• space 100%
• norm 100%
• cost 100%
• optimization 100%
• nonlinear problems 100%
• smooth manifolds 100%

Keyphrases

• Nonmonotone Line Search Method 100%
• Worst-case Complexity 100%
• Cost Function 33%
• Smooth Manifold 33%
• Number of Iterations 33%
• Line Search 33%
• Global Convergence 33%
• Stationary Point 33%
• Lipschitz Condition 33%
• Pullback 33%
• Riemannian Gradient 33%
• Nonmonotone Strategy 33%
• Tangent Space 33%
• Gradient Norm 33%
• Constrained Nonlinear Optimization 33%

Mathematics

• Worst Case 100%
• Manifold 100%
• Wide Variety 50%
• Cost Function 50%
• Objective Function 50%
• Stationary Point 50%
• Pullback 50%
• Lipschitz-Type Condition 50%
• Tangent Space 50%