Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems.
Heejune SheenMakoto YamashitaPublished in: Optim. Methods Softw. (2022)
Keyphrases
- quadratic programming problems
- semidefinite
- systems of linear equations
- pairwise
- equality constraints
- np hard
- objective function
- lower bound
- high dimensional
- support vector machine
- computational complexity
- linear programming
- sparse representation
- evolutionary algorithm
- data sets
- feature extraction
- learning algorithm
- machine learning