On the convergence of conditional ε-subgradient methods for convex programs and convex-concave saddle-point problems

European Journal of Operational Research

Volumn 151, Issue 3, 2003, Pages 461-473

  Larsson, Torbjörn ^a   Patriksson, Michael ^b   Strömberg, Ann Brith ^c  

^a LINKÖPING UNIVERSITY   (Sweden)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^c FRAUNHOFER CHALMERS CENTRE   (Sweden)

Author keywords

Convex programming; Game theory; Large scale optimization; Non linear programming

Indexed keywords

ALGORITHMS; GAME THEORY; NONLINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; TOPOLOGY;

SADDLE POINT PROBLEMS;

OPERATIONS RESEARCH;

EID: 0042235583     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00629-X     Document Type: Article

References (36)

1. Alber Ya.I. Recurrence relations and variational inequalities. Soviet Mathematics Doklady. 27:1983;511-517.
2. Alber Ya.I., Iusem A.N., Solodov M.V. On the projected subgradient method for nonsmooth convex optimization in a Hilbert space. Mathematical Programming. 81:1998;23-35.
3. Barahona F., Anbil R. The volume algorithm: Producing primal solutions with a subgradient method. Mathematical Programming. 87:2000;385-399.
4. Bazaraa M.S., Sherali H.D., Shetty C.M. Nonlinear Programming: Theory and Algorithms. second ed. 1993;John Wiley & Sons, New York, NY.
5. Bertsekas D.P. Nonlinear Programming. second ed. 1999;Athena Scientific, Belmont, MA.
6. Correa R., Lemaréchal C. Convergence of some algorithms for convex minimization. Mathematical Programming. 62:1993;261-275.
7. Danskin J.M. The Theory of Max-Min. 1967;Springer-Verlag, Berlin.
8. Demyanov V.F., Malozemov V.N. Introduction to Minimax. 1974;John Wiley & Sons, New York, NY.
9. Dem'janov V.F., Šomesova V.K. Conditional subdifferentials of convex functions. Soviet Mathematics Doklady. 19:1980;1181-1185.
10. Ermol'ev Yu.M. Methods for solving nonlinear extremal problems. Cybernetics. 2:1966;1-17.
11. Hearn D.W., Lawphongpanich S. Operations Research Letters. 8:1989;189-196.
12. Hiriart-Urruty J.-B., Lemaréchal C. Convex Analysis and Minimization Algorithms, I: Fundamentals. 1993;Springer-Verlag, Berlin.
13. Kallio M., Rosa C.H. Large-scale convex optimization via saddle point computation. Operations Research. 47:1999;93-101.
14. M. Kallio, A. Ruszczyński, Perturbation methods for saddle point computation, Working paper WP-94-38, IIASA, Laxenburg, Austria.
15. Kiwiel K.C. Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities. Mathematical Programming. 69:1995;89-109.
16. Larsson T., Liu Z. A Lagrangian relaxation scheme for structured linear programs with application to multicommodity network flows. Optimization. 40:1997;247-284.
17. Larsson T., Liu Z., Patriksson M. A dual scheme for traffic assignment problems. Optimization. 42:1997;323-358.
18. T. Larsson, M. Patriksson, Global optimality conditions and Lagrangian heuristics for nonconvex optimization, report, Department of Mathematics, Chalmers University of Technology, Gothenburg, in preparation.
19. Larsson T., Patriksson M., Strömberg A.-B. Conditional subgradient optimization - theory and applications. European Journal of Operational Research. 88:1996;382-403.
20. Larsson T., Patriksson M., Strömberg A.-B. Ergodic convergence in subgradient optimization. Optimization Methods & Software. 9:1998;93-120.
21. Larsson T., Patriksson M., Strömberg A.-B. Ergodic, primal convergence in dual subgradient schemes for convex programming. Mathematical Programming. 86:1999;283-312.
22. Lasdon L.S. Optimization Theory for Large Systems. 1970;Macmillan, New York.
23. Ouorou A. A primal-dual algorithm for monotropic programming and its application to network optimization. Computational Optimization and Applications. 15:2000;125-143.
24. Petersson J., Patriksson M. Topology optimization of sheets in contact by a subgradient method. International Journal of Numerical Methods in Engineering. 40:1997;1295-1321.
25. Polyak B.T. A general method of solving extremum problems. Soviet Mathematics Doklady. 8:1967;593-597.
26. Polyak B.T. Minimization of unsmooth functionals. USSR Computational Mathematics and Mathematical Physics. 9:1969;14-29.
27. B.T. Polyak, Introduction to Optimization, Optimization Software New York, 1987.
28. Rockafellar R.T. Convex Analysis. 1970;Princeton University Press, Princeton, NJ.
29. Rockafellar R.T. The Theory of Subgradients and its Applications to Problems of Optimization: Convex and Nonconvex Functions. 1981;Heldermann Verlag, Berlin.
30. Sherali H.D., Choi G. Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs. Operations Research Letters. 19:1996;105-113.
31. Shor N.Z. Minimization Methods for Non-Differentiable Functions. 1985;Springer-Verlag, Berlin.
32. Solodov M.V., Zavriev S.K. Error stability properties of generalized gradient-type algorithms. Journal of Optimization Theory and Applications. 98:1998;663-680.
33. Wolsey L.A. Integer Programming. 1998;John Wiley & Sons, New York.
34. Zhao X., Luh P.B., Wang J. New bundle methods for solving Lagrangian relaxation dual problems. Journal of Optimization Theory and Applications. 113:2002;373-397.
35. Zhao X., Luh P.B., Wang J. Surrogate gradient algorithm for Lagrangian relaxation. Journal of Optimization Theory and Applications. 100:1999;699-712.
36. Zhu C., Rockafellar R.T. Primal-dual projected gradient algorithms for extended linear-quadratic programming. SIAM Journal on Optimization. 3:1993;751-783.