Constrained nonlinear network flow problems through projected Lagrangian methods

Publication TypeConference Paper
Year of Publication2000
AuthorsHeredia, F. J.
Conference Name4th world conference on Circuits, Systems, Communications and Computers CSCC2000
Conference Date9-16/07/2000
Conference LocationGreece, Athens
Type of WorkContributed oral presentation
Key Wordsnonlinear network flows; nonlinear side constraints; research
AbstractRecents 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.
ExportTagged XML BibTex
Heredia_CSCC_00.pdf530.94 KB