Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems.
Arkadii NemirovskiiKatya ScheinbergPublished in: Math. Program. (1996)
Keyphrases
- computational complexity
- globally optimal
- learning algorithm
- objective function
- np hard
- dynamic programming
- convex hull
- knapsack problem
- worst case
- combinatorial optimization
- quadratically constrained quadratic
- machine learning
- semi definite programming
- convex relaxation
- quadratic programming
- linear systems
- convex optimization
- distance metric
- optimization problems
- dimensionality reduction
- optimal solution