Anstreicher-Terlaky type monotonic simplex algorithms for linear feasibility problems.
Filiz BilenZsolt CsizmadiaTibor IllésPublished in: Optim. Methods Softw. (2007)
Keyphrases
- optimization problems
- learning algorithm
- benchmark problems
- difficult problems
- practical problems
- computationally efficient
- times faster
- computationally hard
- simplex algorithm
- specific problems
- data mining algorithms
- machine learning algorithms
- theoretical analysis
- significant improvement
- np hard problems
- data structure
- approximate solutions
- computational complexity
- related problems
- data sets
- worst case
- benchmark datasets
- np complete
- np hard
- linear models
- search methods
- linear systems
- linear program
- partial solutions
- convex functions
- problems in computer vision
- greedy algorithms
- bayesian networks
- decision trees