@misc{Kiwiel_Krzysztof_An_2009,
 author={Kiwiel, Krzysztof},
 copyright={Creative Commons Attribution BY 4.0 license},
 address={Warszawa},
 journal={Raport Badawczy = Research Report},
 howpublished={online},
 year={2009},
 publisher={Instytut Badań Systemowych. Polska Akademia Nauk},
 publisher={Systems Research Institute. Polish Academy of Sciences},
 language={eng},
 abstract={The paper presents a bundle method for minimizing the sum of two convex functions, one of them being known only via an oracle of arbitrary accuracy. Each iteration involves solving two subproblems in which the functions are alternately represented by their linearizations. The proposed approach is motivated by applications to nonlinear multicom­modity flow problems. Encouraging numerical experience on large scale problems is reported.},
 title={An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow},
 type={Text},
 URL={http://rcin.org.pl/Content/144812/PDF/RB-2009-37.pdf},
 keywords={Optymalizacja, Nondifferentiable optimization, Convex programming, Programowanie wypukłe, Proximal bundle methods, Approximate subgradients, Network flow problem, Aproksymacja subgradientowa, Problem przepływu w sieciach},
}