Two "well-known" properties of subgradient optimization

Mathematical Programming

Volumn 120, Issue 1 SPEC. ISS., 2009, Pages 213-220

  Anstreicher, Kurt M ^a   Wolsey, Laurence A ^b  

^a UNIVERSITY OF IOWA   (United States)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Divergent series; Lagrangian relaxation; Primal recovery; Subgradient optimization

Indexed keywords

BASIC PROPERTIES; CONSTRUCTION SCHEMES; DIVERGENT SERIES; ITERATIVE PROCESS; LAGRANGIAN DUALS; LAGRANGIAN RELAXATION; LINEAR PROGRAMS; NON-DIFFERENTIABLE OPTIMIZATIONS; PRIMAL RECOVERY; SUBGRADIENT METHODS; SUBGRADIENT OPTIMIZATION;

LAGRANGE MULTIPLIERS;

OPTIMIZATION;

EID: 65249134854     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-007-0148-y     Document Type: Article

References (22)

1. Anstreicher, K.M., Wolsey, L.A.: On dual solutions in subgradient optimization. Center for Operations Research and Econometrics. Louvain-la-Neuve, Belgium (1992, working paper)
2. L. Bahiense N. Maculan C. Sagastizábal 2002 The volume algorithm revisited: relation with bundle methods Math. Program. 94 41 69
3. F. Barahona R. Anbil 2000 The volume algorithm: producing primal solutions with a subgradient method Math. Program. 87 385 399
4. F. Barahona R. Anbil 2002 On some difficult linear programs coming from set partitioning Discret. Appl. Math. 118 3 11
5. R. Correa C. Lemaréchal 1993 Convergence of some algorithms for convex minimization Math. Program. 62 261 275
6. L. Dubost R. Gonzalez C. Lemaréchal 2005 A primal-proximal heuristic applied to the French unit-commitment problem Math. Program. 104 129 151
7. Ermol'ev Yu. (1976). Methods of stochastic programming. Nauka, Moscow
8. J.L. Goffin 1977 On the convergence rates of subgradient optimization methods Math. Program. 13 329 347
9. M. Held P. Wolfe H. Crowder 1974 Validation of subgradient optimization Math. Program. 6 62 88
10. T. Larsson Z. Liu 1997 A Lagrangian relaxation scheme for structured linear programs with application to multicommodity network flow Optimization 40 247 284
11. T. Larsson M. Patriksson A.-B. Strömberg 1996 Conditional subgradient optimization-theory and applications Eur. J. Oper. Res. 88 382 403
12. T. Larsson M. Patriksson A.-B. Strömberg 1998 Ergodic convergence in subgradient optimization Optim. Methods Softw. 9 93 120
13. T. Larsson M. Patriksson A.-B. Strömberg 1999 Ergodic, primal convergence in dual subgradient schemes for convex programming Math. Program. 86 283 312
14. Lemaréchal C.: (2001). Lagrangian relaxation. In: Jünger, M., Nadef, D. (eds) Computational Combinatorial Optimization, pp 112-156. Springer, Heidelberg
15. Nemirovskii, A.: Private communication (1993)
16. B.T. Polyak 1967 A general method for solving extremum problems Soviet Math Doklady 8 593 597
17. Polyak B.T. (1977). Subgradient methods: a survey of Soviet research. In: Lemaréchal, C.L., Mifflin, R. (eds) Nonsmooth Optimization, Proceedings of a IIASA Workshop, March 28-April 8, 1977. Pergamon Press, New York
18. Polyak B.T. (1987). Introduction to Optimization. Optimization Software, Inc., New York
19. Rudin W. (1976). Principles of Mathematical Analysis, 3rd edn. McGraw-Hill, New York
20. M.A. Shepilov 1976 Method of the generalized gradient for finding the absolute minimum of a convex function Cybernetics 12 547 553
21. H.D. Sherali G. Choi 1996 Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs Oper. Res. Lett. 19 105 113
22. Shor N.Z. (1985). Minimization Methods for Non-Differentiable Functions. Springer, Berlin