An efficient algorithm for solving rank one perturbed linear Diophantine systems using Rosser's approach.
Mostafa KhorramizadehNezam Mahdavi-AmiriPublished in: 4OR (2011)
Keyphrases
- learning algorithm
- matching algorithm
- improved algorithm
- dynamic programming
- experimental evaluation
- computational cost
- linear systems
- computational complexity
- linear programming
- worst case
- computationally efficient
- convex quadratic programming
- linear complexity
- quadratic programming
- optimization algorithm
- cost function
- preprocessing
- piecewise linear
- optimal solution
- objective function
- convex optimization
- convergence rate
- closed form
- detection algorithm
- segmentation algorithm
- theoretical analysis
- np hard
- expectation maximization
- particle swarm optimization
- neural network
- gradient projection
- image segmentation
- hardware implementation
- data structure
- recognition algorithm
- knapsack problem
- data sets