Książka = Book ; KS/1/1989/P10
Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
[2], 148-165 pages ; 21 cm ; Bibliography p. 165
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.
Creative Commons Attribution BY 4.0 license
Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -
Systems Research Institute of the Polish Academy of Sciences
Library of Systems Research Institute PAS
Oct 15, 2021
Aug 18, 2021
40
https://rcin.org.pl/publication/242376