A Newton method for convex separable network flow problems (Q3668258): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230130310 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2093187490 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A scaled reduced gradient algorithm for network flow problems with convex separable costs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3881429 / rank | |||
Normal rank | |||
Latest revision as of 09:06, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Newton method for convex separable network flow problems |
scientific article |
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
