A superlinearly convergent algorithm for minimization without evaluating derivatives.
Robert MifflinPublished in: Math. Program. (1975)
Keyphrases
- dynamic programming
- objective function
- clustering method
- experimental evaluation
- computational cost
- learning algorithm
- optimal solution
- worst case
- improved algorithm
- recognition algorithm
- times faster
- detection algorithm
- optimization algorithm
- expectation maximization
- particle swarm optimization
- k means
- linear programming
- convergence rate
- np hard
- significant improvement
- high accuracy
- computational complexity
- tree structure
- lower bound
- data sets
- similarity measure
- convex hull
- path planning
- energy function
- computationally efficient
- probabilistic model
- input data
- simulated annealing