@misc{Mäkelä_Marko_Methodology_1989,
 author={Mäkelä, Marko},
 copyright={Creative Commons Attribution BY 4.0 license},
 journal={Książka = Book},
 address={Warszawa},
 howpublished={online},
 year={1989},
 publisher={Instytut Badań Systemowych. Polska Akademia Nauk},
 publisher={Systems Research Institute. Polish Academy of Sciences},
 language={eng},
 abstract={There exiat continuoualy growing interest in nonsmooth optimization methods in recent yeara. The aim of thia paper u to present the results of nunierical experiment.s with two main classes of nonsmooth programming methods. We have teeted Kiwiel's linearization methods and Lemarechal's bundle methods. As test problems we used well-known test problems from litterature: Crescent, Shor's problem, Equil and lli-contioned LP. In addition we tested two different kind of optimal control problems: Contad and Stefan, which have been studied in University of Jyviskyla. Some corollartee following from the presented results are included. In general we can state, that Kiwiel's methods seem to be more reliable and demand less computer resource than bundle methods.},
 type={Text},
 title={Methodology and applications of decision support systems : proceedings of the 3rd polish - finnish symposium, Gdańsk-Sobieszewo, september 26-29, 1988 * Numerical experiments with various nonsmooth optimization methods},
 URL={http://rcin.org.pl./Content/205725/PDF/KS-1989-01-P10.pdf},
}