Metadata language
An inexact bundle variant suited to column generation
Subtitle:Raport Badawczy = Research Report ; RB/72/2007
Creator: Publisher:Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
Place of publishing: Date issued/created: Description:[30] pages ; 21 cm ; Bibliography p. [29-30]
Subject and Keywords:Nondifferentiable optimization ; Optymalizacja niezróżnicowana ; Convex programming ; Programowanie wypukłe ; Proximal bundle methods ; Approximate subgradients ; Column generation ; Aproksymacja subgradientowa ; Generowanie kolumn ; Cutting-stock problem
Abstract:The paper gives a bundle method for constrained convex optimization. Instead of using penalty functions, it shifts iterates towards feasibility, by way of a Slater point, assumed to be known. Besides, the method accepts an oracle delivering function and subgradient values with unknown accuracy. The proposed approach is motivated by a number of applications in column generation, in which constarints are positively homogeneous - so that zero is a natural Slater point - and an exact oracle may be time consuming. Finally, this convergence analysis employs arguments which have been little used so far in the bundle community. The method is illustrated on a number of cutting-stock problems.
Relation:Raport Badawczy = Research Report
Resource type: Detailed Resource Type: Source: Language: Language of abstract: Rights:Creative Commons Attribution BY 4.0 license
Terms of use: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: ; -
Digitizing institution:Systems Research Institute of the Polish Academy of Sciences
Original in:Library of Systems Research Institute PAS
Projects co-financed by: Access: