A Newton method for convex separable network flow problems.
John G. KlincewiczPublished in: Networks (1983)
Keyphrases
- upper bound
- newton method
- strictly convex
- network flow problem
- lower bound
- convergence analysis
- variational inequalities
- minimum cost
- network flow
- minimal cost
- regularized least squares
- np hard
- network design problem
- mixed integer
- optimality conditions
- linear equations
- convex sets
- quadratic programming
- convex hull
- linear svm
- global convergence
- nonnegative matrix factorization
- optimal solution
- text categorization
- convex optimization
- nonlinear programming
- linear programming
- support vector