A polynomial algorithm for convex quadratic optimization subject to linear inequalities.
Sergei ChubanovPublished in: Discret. Appl. Math. (2020)
Keyphrases
- learning algorithm
- cost function
- np hard
- dynamic programming
- worst case
- optimal solution
- linear inequalities
- convex hull
- optimization algorithm
- computational complexity
- linear programming
- particle swarm optimization
- rough sets
- evolutionary algorithm
- approximation algorithms
- constrained optimization
- decomposition algorithm