On solving the Lagrangian dual of integer programs via an incremental approach
Year of publication: |
2009
|
---|---|
Authors: | Gaudioso, Manlio ; Giallombardo, Giovanni ; Miglionico, Giovanna |
Published in: |
Computational Optimization and Applications. - Springer. - Vol. 44.2009, 1, p. 117-138
|
Publisher: |
Springer |
Subject: | Incremental algorithms | Convex minimization | Finite min-max | Lagrangian relaxation | Nonsmooth optimization | Bundle methods |
-
Level bundle-like algorithms for convex optimization
Cruz, J. Bello, (2014)
-
Target radius methods for nonsmooth convex optimization
Oliveira, Welington de, (2017)
-
New diagonal bundle method for clustering problems in large data sets
Karmitsa, Napsu, (2017)
- More ...
-
An Incremental Method for Solving Convex Finite Min-Max Problems
Gaudioso, Manlio, (2006)
-
Minimizing piecewise-concave functions over polyhedra
Gaudioso, Manlio, (2018)
-
The descent-ascent algorithm for DC programming
D’Alessandro, Pietro, (2024)
- More ...