Primal convergence from dual subgradient methods for convex optimization
Open Access
- 16 April 2014
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 150 (2) , 365-390
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problemsMathematical Programming, 2009
- Two “well-known” properties of subgradient optimizationMathematical Programming, 2007
- On embedding the volume algorithm in a variable target value methodOperations Research Letters, 2004
- The volume algorithm: producing primal solutions with a subgradient methodMathematical Programming, 2000
- Ergodic, primal convergence in dual subgradient schemes for convex programmingMathematical Programming, 1999
- 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
- Methods of solution of nonlinear extremal problemsCybernetics and Systems Analysis, 1968
- A note on two problems in connexion with graphsNumerische Mathematik, 1959