On quadratic convergence of the O(√nK)-iteration homogeneous and self‐duallinear programming algorithm.
Fang WuShiquan WuYinyu YePublished in: Ann. Oper. Res. (1999)
Keyphrases
- computational complexity
- objective function
- experimental evaluation
- iterative algorithms
- convergence rate
- cost function
- times faster
- linear programming
- detection algorithm
- optimal solution
- k means
- dynamic programming
- worst case
- matching algorithm
- tree structure
- expectation maximization
- input data
- learning algorithm
- search space
- probabilistic model
- np hard
- faster convergence
- convergence proof