An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity.
Serge GrattonEhouarn SimonPhilippe L. TointPublished in: Math. Program. (2021)
Keyphrases
- worst case
- space complexity
- detection algorithm
- objective function
- average case
- np hard
- computational complexity
- dynamic programming
- computational cost
- lower bound
- running times
- convergence rate
- convex functions
- upper bound
- times faster
- learning algorithm
- theoretical analysis
- complexity bounds
- optimization algorithm
- simulated annealing
- cost function
- special case
- k means
- preprocessing
- segmentation algorithm
- optimization problems
- convex hull
- global optimization
- probabilistic model
- optimal solution