Advanced search
Advanced search
Advanced search
Advanced search
Advanced search
Raport Badawczy = Research Report ; RB/36/2009
Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
28 stron ; 21 cm ; Bibliografia s. 25-28
Recently the proximal bundle method for minimizing a convex function has been extended to an inexact oracle that delivers function and subgradient values of unknown accuracy. This method has been adapted to a partially inexact oracle that becomes exact only when an objective target level for a descent step is met. In Lagrangian relaxation, such oracles may save work by evaluating the dual function approximately on most iterations, without compromising the strong convergence properties of exact bundle methods. It was also shown that the recent method of Gaudioso et al. for finite min-max problems fits the partially inexact framework. In the work, its convergence results have been improved and useful modifications have been made. Numerical illustrations on standard instances of the generalized assignment problem (GAP) are included.
Raport Badawczy = Research Report
Licencja Creative Commons Uznanie autorstwa 4.0
Zasób chroniony prawem autorskim. [CC BY 4.0 Międzynarodowe] Korzystanie dozwolone zgodnie z licencją Creative Commons Uznanie autorstwa 4.0, której pełne postanowienia dostępne są pod adresem: ; -
Instytut Badań Systemowych Polskiej Akademii Nauk
Biblioteka Instytutu Badań Systemowych PAN
Oct 19, 2021
Oct 28, 2020
70
https://rcin.org.pl./publication/180389
Edition name | Date |
---|---|
RB-2009-36 : Kiwiel Krzysztof Czesław : Bundle methods for convex minimization with partially inexact oracles | Oct 19, 2021 |
Kiwiel, Krzysztof
Kiwiel, Krzysztof
Kiwiel, Krzysztof
Kiwiel, Krzysztof Lemarechal, Claude
Kiwiel, Krzysztof
Kiwiel, Krzysztof