A Smoothing Newton-Type Algorithm of Stronger Convergence for the Quadratically Constrained Convex Quadratic Programming.
Zheng-Hai HuangDefeng SunGongyun ZhaoPublished in: Comput. Optim. Appl. (2006)
Keyphrases
- convex quadratic programming
- detection algorithm
- convergence rate
- worst case
- dynamic programming
- objective function
- np hard
- cost function
- computational complexity
- curve fitting
- smoothing algorithm
- learning algorithm
- simulated annealing
- segmentation algorithm
- faster convergence
- k means
- probabilistic model
- evolutionary algorithm
- sufficient conditions
- cooperative
- convergence speed
- gauss newton
- convergence property