A Newton method for convex separable network flow problems (Q3668258)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Newton method for convex separable network flow problems |
scientific article; zbMATH DE number 3821407
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Newton method for convex separable network flow problems |
scientific article; zbMATH DE number 3821407 |
Statements
A Newton method for convex separable network flow problems (English)
0 references
1983
0 references
feasible direction algorithms
0 references
convex, separable network flow problems
0 references
approximate implementation
0 references
quadratically convergent Newton algorithm
0 references
conjugate direction method
0 references
second-order dual multiplier estimates
0 references
computational experience
0 references
0 references
0.9220123
0 references
0.91905904
0 references
0.90650636
0 references
0.89612097
0 references
0.89542234
0 references
0.8920584
0 references
0.89187247
0 references
0.8889558
0 references
