Ergodic convergence in subgradient optimization

Optimization Methods and Software

Volumn 9, Issue 1-3, 1998, Pages 93-120

  Larsson, T ^a   Patriksson, M ^b   Stromberg A B ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Bounding procedure; Conditional subgradient optimization; ergodic convergence; Finite identification results; Lagrange multipliers; Nonsmooth minimization

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; LAGRANGE MULTIPLIERS; PROBLEM SOLVING; SENSITIVITY ANALYSIS;

CONDITIONAL SUBGRADIENT OPTIMIZATION; ERGODIC CONVERGENCE;

OPTIMIZATION;

EID: 0031651233     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556789808805688     Document Type: Article

References (31)

1. Baillon, J.-B. (1975). Un théorème de type ergodique pour les contractions non linéaires dans un espace de Hilbert, Comptes Rendus Hebdomadaires des Séances de l'Académie des Sciences (Paris), Série A, 280, pp. 1511-1514.
2. Bertsekas, D. P. (1976). On the Goldstein-Levitin-Polyak gradient projection method, IEEE Transactions on Automatic Control, AC-21, pp. 174-184.
3. Burke, J. V. and Ferris, M. C. (1991). Characterization of solution sets of convex programs, Operations Research Letters, 10, pp. 57-60.
4. Burke, J. V. and More, J. J. (1988). On the identification of active constraints, SIAM Journal on Numerical Analysis, 25, pp. 1197-1211.
5. Burke, J. V. and Moré, J. J. (1994). Exposing constraints, SIAM Journal on Optimization, 3, pp. 573-595.
6. Calamai, P. H. and Moré, J. J. (1987). Projected gradient methods for linearly constrained problems, Mathematical Programming, 39, pp. 93-116.
7. Dem'janov, V. F. and Šomesova, V. K. (1978). Conditional subdifferentials of convex functions, Soviet Mathematics Doklady, 19, pp. 1181-1185.
8. Dem'yanov, V. F. and Vasil'ev, L. V. (1985). Nondifferentiable Optimization, Optimization Software, New York, NY.
9. Dunn, J. C. (1981). Global and asymptotic convergence rate estimates for a class of projected gradient processes, SIAM Journal on Control and Optimization, 19, pp. 368-400.
10. Dunn, J. C. (1987). On the convergence of projected gradient processes to singular critical points, Journal of Optimization Theory and Applications, 55, pp. 203-216.
11. Fisher, M. L. (1985). An applications oriented guide to Lagrangian relaxation, Interfaces, 15, pp. 10-21.
12. Guignard, M. (1969). Generalized Kuhn-Tucker conditions for mathematical programming problems in a Banach space, SIAM Journal on Control, 1, pp. 232-241.
13. Higle, J. L. and Sen, S. (1991). Stochastic decomposition: An algorithm for two-stage linear programs with recourse, Mathematics of Operations Research, 16, pp. 650-669.
14. Hiriart-Urruty, J.-B. and Lemaréchal, C. (1993). Convex Analysis and Minimization Algorithms I & II, Springer-Verlag, Berlin.
15. Kim, S. and Ahn, H. (1991). Convergence of a generalized subgradient method for nondifferentiable convex optimization. Mathematical Programming, 50, pp. 75-80.
16. Larsson, T. and Liu, Z. (1997). A Lagrangean relaxation scheme for structured linear programs with application to multicommodity network flows, Optimization, 40, pp. 247-284.
17. Larsson, T., Patriksson, M. and Strömberg, A.-B. (1996a). Conditional subgradient optimization: Theory and applications, European Journal of Operational Research, 88, pp. 382-403.
18. Larsson, T., Patriksson, M. and Strömberg, A.-B. (1996b). Ergodic results in subgradient optimization, in: Nonlinear Optimization and Applications, G. Di Pillo, F. Giannessi, eds., Proceedings of the International School of Mathematics "G. Stampacchia" 21st Workshop on Nonlinear Optimization and Applications, Erice, Italy, June, 1995, Plenum Press, New York, pp. 229-248.
19. Larsson, T., Patriksson, M. and Strömberg, A.-B. (1996c). Ergodic results and bounds on the optimal value in subgradient optimization, in: Operations Research Proceedings 1995, P. Kleinschmidt, A. Bachem, U. Derigs, D. Fischer, U. Leopold-Wildburger, R. Möhring, eds., Selected papers of the Symposium on Operations Research, Passau, Germany, September, 1995, Springer-verlag, Berlin, pp. 30-35.
20. Larsson, T., Patriksson, M. and Strömberg, A.-B. (1996d). Ergodic, primal convergence in dual subgradient schemes for convex programming, Report LiTH-MAT-R-96-26, Department of mathematics, Linköping Institute of Technology, Linköping, Sweden. (To appear in Mathematical Programming.)
21. Luenberger, D. G. (1984). Linear and Nonlinear Programming, second ed., Addison-Wesley, Reading, MA.
22. Petersson, J. and Patriksson, M. (1997). Topology optimization of sheets in contact by a subgradient method, International Journal of Numerical Methods in Engineering, 40, pp. 1295-1321.
23. Polyak, B. T. (1987). Introduction to Optimization, Optimization Software, New York, NY.
24. Robinson, S. M. (1984). Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy, Mathematical Programming Study, 22, pp. 217-230.
25. Rockafellar, R. T. (1970). Convex Analysis, Princeton University Press, Princeton, NJ.
26. Ruszczyński, A. and Syski, W. (1983). Stochastic approximation method with gradient averaging for unconstrained problems, IEEE Transactions on Automatic Control, AC-28, pp. 1097-1105.
27. Sherali, H. D. and Choi, G. (1996). Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs, Operations Research Letters, 19, pp. 105-113.
28. Shor, N. Z. (1985). Minimization Methods for Non-Differentiable Functions, Springer-Verlag, Berlin.
29. Shor, N. Z. (1991). The development of numerical methods for nonsmooth optimization in the USSR, in: History of Mathematical Programming: A Collection of Personal Reminiscences, J. K. Lenstra, A. H. G. Rinnooy Kan, A. Schrijver, eds., North-Holland, Amsterdam, pp. 135-139.
30. Strömberg, A.-B. (1997). Conditional Subgradient Methods and Ergodic Convergence in Nonsmooth Optimization, PhD Thesis, Linköping Studies in Science and Technology, Dissertations, No. 467, Department of Mathematics, Linköping Institute of Technology, Linköping, Sweden.
31. Zarantonello, E. H. (1971). Projections on convex sets in Hilbert space and spectral theory, in: Contributions to Nonlinear Functional Analysis, E. H. Zarantonello. ed., Proceedings of a Symposium Conducted by the Mathematics Research Center, University of Wisconsin, Madison, April 1971, Academic Press, New York, NY, pp. 237-424.