A proximal trust-region algorithm for column generation stabilization
This paper proposes a generalization of the proximal point algorithm using both penalty and trust-region concepts. Finite convergence is established while assuming the trust regions are of full dimension and never shrink to a single point. The approach is specialized to the cutting plane/column gene...
Gespeichert in:
Veröffentlicht in: | Computers & operations research 2006-04, Vol.33 (4), p.910-927 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | This paper proposes a generalization of the proximal point algorithm using both penalty and trust-region concepts. Finite convergence is established while assuming the trust regions are of full dimension and never shrink to a single point. The approach is specialized to the cutting plane/column generation context. The resulting algorithm ensures convergence to a pair of primal and dual optimal solutions. Computational experiments carried over multi-depot vehicle scheduling instances show a great stabilizing and accelerating effect on the column generation method. |
---|---|
ISSN: | 0305-0548 1873-765X 0305-0548 |
DOI: | 10.1016/j.cor.2004.08.003 |