Some Strongly Polynomially Solvable Convex Quadratic Programs with Bounded Variables.
Jong-Shi PangShaoning HanPublished in: SIAM J. Optim. (2023)
Keyphrases
- quadratic program
- polynomially solvable
- np hard
- approximation algorithms
- linear program
- convex optimization
- np complete
- linear programming
- feasible solution
- special case
- linear constraints
- convex constraints
- mixed integer
- processing times
- equality constraints
- quadratic programming
- minimum cost
- semi definite programming
- maximum margin
- objective function
- optimal solution
- random variables
- continuous variables
- variable selection
- flowshop
- parameter selection
- conditional probabilities
- decomposition algorithm
- least squares
- upper bound
- scheduling problem
- neural network