On the worst case performance of the steepest descent algorithm for quadratic functions.
Clóvis C. GonzagaPublished in: Math. Program. (2016)
Keyphrases
- worst case
- detection algorithm
- np hard
- learning algorithm
- dynamic programming
- lower bound
- preprocessing
- average case
- times faster
- optimization algorithm
- computationally efficient
- high accuracy
- computational cost
- significant improvement
- cost function
- k means
- space complexity
- improved algorithm
- error bounds
- experimental evaluation
- segmentation algorithm
- computational complexity
- linear programming
- objective function
- theoretical analysis
- expectation maximization
- data sets
- path planning
- convex hull
- bayesian networks
- image registration
- piecewise linear
- upper bound