A note on the convergence of an algorithm for nonconvex programming problems.
Reiner HorstPublished in: Math. Program. (1980)
Keyphrases
- iterative algorithms
- quadratic optimization problems
- benchmark problems
- learning algorithm
- objective function
- detection algorithm
- cost function
- optimization problems
- computational cost
- simulated annealing
- particle swarm optimization
- convergence rate
- segmentation algorithm
- neural network
- np hard
- search space
- genetic algorithm
- convergence property
- significant improvement
- faster convergence
- k means
- matching algorithm
- similarity measure
- global optimization
- lagrange multipliers
- semidefinite programming
- test problems
- recognition algorithm
- optimal solution
- worst case
- combinatorial optimization
- optimization algorithm
- expectation maximization
- multi objective
- probabilistic model