Abstract
The efficiency of the network flow techniques can be exploited in the solution of nonlinearly constrained network flow problems (NCNFP) by means of approximate subgradient methods (ASM). We propose to solve the dual problem by an ASM that uses a variant of the well-known constant step rule of Shor. In this work the kind of convergence of this method is analyzed and its efficiency is compared with that of other approximate subgradient methods over NCNFP. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Mijangos, E. (2006). A variant of the constant step rule for approximate subgradient methods over nonlinear networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3982 LNCS, pp. 757–766). Springer Verlag. https://doi.org/10.1007/11751595_80
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
