A polynomial-time algorithm, based on Newton's method, for linear programming.
James RenegarPublished in: Math. Program. (1988)
Keyphrases
- dynamic programming
- linear programming
- computational complexity
- preprocessing
- objective function
- high accuracy
- improved algorithm
- detection method
- experimental evaluation
- synthetic and real images
- theoretical analysis
- computational cost
- detection algorithm
- computationally efficient
- high efficiency
- significant improvement
- k means
- clustering method
- optimization method
- similarity measure
- segmentation algorithm
- energy function
- tree structure
- classification algorithm
- input data
- recognition algorithm
- selection algorithm
- cost function
- estimation algorithm
- classification method
- support vector machine svm
- optimization algorithm
- strongly polynomial
- segmentation method
- expectation maximization
- optimal solution
- np hard
- learning algorithm
- decomposition method
- quadratic programming
- convergence rate
- probabilistic model
- reconstruction method
- worst case
- matching algorithm
- least squares
- special case
- decision trees
- semidefinite programming
- em algorithm