Analysis of a new algorithm for one-dimensional minimization.
Petter BjørstadJorge NocedalPublished in: Computing (1979)
Keyphrases
- detection algorithm
- objective function
- learning algorithm
- improved algorithm
- computationally efficient
- computational cost
- k means
- dynamic programming
- optimal solution
- high accuracy
- times faster
- memory requirements
- cost function
- experimental evaluation
- search space
- preprocessing
- tree structure
- worst case
- image processing
- simulated annealing
- optimization algorithm
- recognition algorithm
- selection algorithm
- segmentation algorithm
- data mining
- expectation maximization
- linear programming
- multi dimensional
- least squares
- probabilistic model
- np hard
- significant improvement
- data analysis
- computational complexity