Conditions for linear convergence of the gradient method for non-convex optimization.
Hadi AbbaszadehpeivastiEtienne de KlerkMoslem ZamaniPublished in: Optim. Lett. (2023)
Keyphrases
- convex optimization
- gradient method
- convex formulation
- operator splitting
- convergence rate
- interior point methods
- convex relaxation
- step size
- convergence speed
- primal dual
- total variation
- optimization methods
- negative matrix factorization
- convex optimization problems
- genetic algorithm
- semidefinite
- optimization problems
- support vector machine
- image processing