Lagrangian Relaxation via Ballstep Subgradient Methods
- 1 August 2007
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 32 (3), 669-686
- https://doi.org/10.1287/moor.1070.0261
Abstract
We exhibit useful properties of ballstep subgradient methods for convex optimization using level controls for estimating the optimal value. Augmented with simple averaging schemes, they asymptotically find objective and constraint subgradients involved in optimality conditions. When applied to Lagrangian relaxation of convex programs, they find both primal and dual solutions, and have practicable stopping criteria. Up until now, similar results have only been known for proximal bundle methods, and for subgradient methods with divergent series stepsizes, whose convergence can be slow. Encouraging numerical results are presented for large-scale nonlinear multicommodity network flow problems.Keywords
This publication has 34 references indexed in Scilit:
- The volume algorithm revisited: relation with bundle methodsMathematical Programming, 2002
- The volume algorithm: producing primal solutions with a subgradient methodMathematical Programming, 2000
- Ergodic, primal convergence in dual subgradient schemes for convex programmingMathematical Programming, 1999
- Ergodic convergence in subgradient optimizationOptimization Methods and Software, 1998
- Using an interior point method for the master problem in a decomposition approachEuropean Journal of Operational Research, 1997
- A dual scheme for traffic assignment problemsOptimization, 1997
- A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network FlowsOptimization, 1997
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programsOperations Research Letters, 1996
- Characterization of solution sets of convex programsOperations Research Letters, 1991
- On the dual approach to the traffic assignment problemTransportation Research Part B: Methodological, 1984