๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Newton method for convex separable network flow problems

โœ Scribed by John G. Klincewicz

Publisher
John Wiley and Sons
Year
1983
Tongue
English
Weight
782 KB
Volume
13
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A computationally efficient method for n
A computationally efficient method for nonlinear multicommodity network flow problems
โœ Lin, Shin-Yeu; Lin, Ch'i-Hsin ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 301 KB ๐Ÿ‘ 2 views

In this paper, we present a new method for solving nonlinear multicommodity network flow problems with convex objective functions. This method combines a well-known projected Jacobi method and a new dual projected pseudo-quasi-Newton (DPPQN) method which solves multicommodity flow quadratic subprobl

Newton's Method for a Generalized Invers
Newton's Method for a Generalized Inverse Eigenvalue Problem
โœ Hua Dai; Peter Lancaster ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 151 KB ๐Ÿ‘ 2 views

A kind of generalized inverse eigenvalue problem is proposed which includes the additive, multiplicative and classical inverse eigenvalue problems as special cases. Newton's method is applied, and a local convergence analysis is given for both the distinct and the multiple eigenvalue cases. When the