Sparsity-preserving sor algorithms for separable quadratic and linear programming.

Olvi L. Mangasarian

Published in: Comput. Oper. Res. (1984)

Keyphrases

linear programming
computational complexity
interior point
learning algorithm
theoretical analysis
computational cost
social networks
objective function
data structure
computationally efficient
penalty functions
benchmark datasets
dynamic programming
np hard
special case
significant improvement
pairwise