Constrained nonlinear network flow problems through projected Lagrangian methods
Sun, 10/28/2007 - 17:28 — admin
| Publication Type | Conference Paper |
| Year of Publication | 2000 |
| Authors | Heredia, F. J. |
| Conference Name | 4th world conference on Circuits, Systems, Communications and Computers CSCC2000 |
| Conference Date | 9-16/07/2000 |
| Conference Location | Greece, Athens |
| Type of Work | Contributed oral presentation |
| Key Words | nonlinear network flows; nonlinear side constraints; research |
| Abstract | Recents numerical experiments show that the resolution of the Nonlinear network Flow problem with side constraints (NFC) can be significantly sped up, when the side constraints are linear, by specialised codes based on a conjunction of primal partitioning techniques and active set methods. A natural extension of these methods one is to be used into a Projected Lagrangian Algorithm (PLA). A specialised (PLA) will solve the general (NFC) problem through the optimization of a sequence of (NFC) with linear side constraints, taking benefit of the efficiency of the linear side constraints codes. The description of this methodology will be presented together with the preliminary numerical results. |
| Export | Tagged XML BibTex |
|
