Performance of Some Approximate Subgradient Methods over Nonlinearly Constrained Networks

Eugenio Mijangos ()
Additional contact information
Eugenio Mijangos: University of the Basque Country

A chapter in Operations Research Proceedings 2007, 2008, pp 103-108 from Springer

Abstract: Abstract Nonlinearly constrained network flow problems can be solved by using approximate subgradient methods. This work studies the influence of some parameters over the performance of some approximate subgradient methods and compares their efficiency with that of other well-known codes. Numerical results appear promising.

Keywords: Nonlinear Programming; Subgradient Methods; Networks (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-540-77903-2_16

Ordering information: This item can be ordered from
http://www.springer.com/9783540779032

DOI: 10.1007/978-3-540-77903-2_16

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().