A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems.
Masoud AhookhoshNicolas GillisPanagiotis PatrinosPublished in: CoRR (2020)
Keyphrases
- benchmark problems
- learning algorithm
- quadratic optimization problems
- computational complexity
- optimization problems
- simulated annealing
- objective function
- k means
- cost function
- dynamic programming
- detection algorithm
- globally convergent
- worst case
- search space
- theoretical guarantees
- evolutionary algorithm
- np hard
- np complete
- clustering algorithm
- semidefinite programming
- genetic algorithm