On the convergence of conditional ε-subgradient methods for convex programs and convex–concave saddle-point problems
- 16 December 2003
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 151 (3), 461-473
- https://doi.org/10.1016/s0377-2217(02)00629-x
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- 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
- 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
- Conditional subgradient optimization — Theory and applicationsEuropean Journal of Operational Research, 1996
- Lagrangian dual ascent by generalized linear programmingOperations Research Letters, 1989
- Minimization of unsmooth functionalsUSSR Computational Mathematics and Mathematical Physics, 1969
- Methods of solution of nonlinear extremal problemsCybernetics and Systems Analysis, 1968