Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs.
Satoshi KawamuraKai CaiMengbin YeZhiyun LinPublished in: Int. J. Control (2020)
Keyphrases
- worst case
- learning algorithm
- experimental evaluation
- upper bound
- optimal solution
- computational complexity
- matching algorithm
- detection algorithm
- times faster
- np hard
- dynamic programming
- k means
- expectation maximization
- probabilistic model
- optimization algorithm
- convergence rate
- neural network
- ant colony optimization
- error bounds
- high accuracy
- cost function
- search space
- lower bound
- theoretical analysis
- multi objective
- tree structure
- search algorithm
- objective function
- data sets
- parameter settings