On the Convergence of a Smooth Penalty Algorithm without Computing Global Solutions.
Bingzhuang LiuChangyu WangWenling ZhaoPublished in: J. Appl. Math. (2012)
Keyphrases
- dynamic programming
- iterative algorithms
- computational complexity
- convergence property
- objective function
- optimal solution
- benchmark problems
- computational cost
- convergence rate
- simulated annealing
- np hard
- cost function
- probabilistic model
- solution quality
- significant improvement
- theoretical analysis
- times faster
- expectation maximization
- recognition algorithm
- faster convergence
- penalty term
- matching algorithm
- detection algorithm
- optimization algorithm
- linear programming
- computationally efficient
- solution space
- neural network
- high accuracy
- improved algorithm
- worst case
- multi objective
- global solution
- reinforcement learning
- similarity measure