A Polynomial Cutting Surfaces Algorithm for the Convex Feasibility Problem Defined by Self-Concordant Inequalities.
Zhi-Quan LuoJie SunPublished in: Comput. Optim. Appl. (2000)
Keyphrases
- detection algorithm
- computational cost
- cost function
- learning algorithm
- convex hull
- computational complexity
- dynamic programming
- globally optimal
- k means
- preprocessing
- search space
- probabilistic model
- linear programming
- optimization algorithm
- optimal solution
- matching algorithm
- objective function
- knapsack problem
- convex optimization
- genetic algorithm
- np hard
- worst case
- expectation maximization
- convergence rate