A merit function approach to the subgradient method with averaging

Optimization Methods and Software

Volumn 23, Issue 1, 2008, Pages 161-172

  Ruszczynski, Andrzej ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Convex optimization; Dual methods; Nonsmooth optimization; Subgradient method

Indexed keywords

FUNCTION EVALUATION; OPTIMIZATION; PROBLEM SOLVING;

CONVEX OPTIMIZATION; DUAL METHODS; NONSMOOTH OPTIMIZATION; SUBGRADIENT METHOD;

GRADIENT METHODS;

EID: 37549002539     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780701318796     Document Type: Article

References (25)

1. F. Barahona and R. Anbil, The volume algorithm: producing primal solutions with a subgradient method, Math. Prog. 87 (2000) pp. 385-399.
2. D.P. Bertsekas, Nonlinear Programming, Athena Scientific, Belmont (MA), 1999.
3. D. Butnariu, and E. Resmerita, Averaged subgradient methods for constrained convex optimization and Nash equilibria computation, Optimization, 51 (2002) pp. 863-888.
4. P. Camerini, L. Fratta, and F. Maffioli, On improving relaxation methods by modifying gradient techniques, Math. Prog. Study, 3 (1975), pp. 26-34.
5. Yu.M.Ermoliev, Methods for solving nonlinear extremal problems, Kibernetika (Kiev), 1 (1966), pp. 1-17 (Russian).
6. M. Fukushima, Merit functions for variational inequality and complementarity problems, in G. di Pillo and F. Gianessi, eds., Nonlinear Optimization and Applications, Plenum Press, NewYork, 1996, pp. 155-170.
7. A.M. Gupal and L.T. Bazhenov, A stochastic analog of the method of conjugate gradients, Kibernetika (Kiev), 1 (1972), pp. 125-126 (Russian).
8. K.C. Kiwiel, Convergence of approximate and incremental subgradient methods for convex optimization, SIAM J. Optim. 14 (2003), pp. 807-840.
9. T. Larsson, T. Liu, and M. Patriksson, A dual scheme for traffic assignment problems, Optimization, 42 (1997), pp. 323-358.
10. T. Larsson, M. Patriksson, and A.-B. Strömberg, Ergodic convergence in subgradient optimization, Optim. Methods Software, 9 (1998), pp. 93-120.
11. T. Larsson, M. Patriksson, and A.-B. Strömberg, Ergodic primal convergence in dual subgradient schemes for convex programming, Math. Prog. 86 (1999), pp. 283-312.
12. T. Larsson, M. Patriksson, and A.-B. Strömberg, On the convergence of conditional epsilon-subgradient methods for convex programs and convex-concave saddle-point problems, Eur. J. Operations Res. 151 (2003), pp. 461-473.
13. VS. Mikhalevich, A.M. Gupal, and V.I. Norkin, Nonconvex Optimization Methods, Nauka, Moscow, 1987 (Russian).
14. A. Nedi'c, and D.P. Bertsekas, Incremental subgiadient methods for nondifferentiable optimization, SIAM J. Optim. 12 (2001), pp. 109-138.
15. E.A. Nurminski, Numerical Methods for Solving Deterministic and Stochastic Minimax Problems, Nauková Dumka, Kiev, 1979 (Russian).
16. J. Petersson and M. Patriksson, Topology optimization of sheets in contact by a subgradient method, Int. J. Numer. Methods Eng. 40 (1997), pp. 295-1321.
17. B.T. Polyak, A general method for solving extremal problems, Doklady Akad. Nauk SSSR, 174 (1967), pp. 33-36 (Russian).
18. A. Ruszczy'nski, A linearization method for nonsmooth stochastic optimization problems, Math. Operations Res. 12 (1987), pp. 32-49.
19. A. Ruszczy'nski, Nonlinear Optimization, Princeton University Press, Princeton, 2006.
20. A. Ruszczy'nski and W. Syski, Stochastic approximation algorithm with gradient averaging for unconstrained problems, IEEE Trans. Automatic Cont. AC-28 (1983), pp. 1097-1105.
21. H.D. Sherali and G. Choi, Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs, Operations Res. Lett. 19 (1996), pp. 105-113.
22. N.Z. Shor, Application of the method of gradient descent to the solution of the network transportation problem, in Materials of the Scientific Seminar on Theoretical and Applied Questions of Cybernetics and Operations Research, Ukrainian Academy of Sciences, Kiev, 1962, pp. 9-17 (Russian).
23. N.Z. Shor, Minimization Methods for Non-Differentiable Functions, Nauková Dumka, Kiev (Russian; Eng. transl.), 1979, Springer-Verlag, Berlin, 1985.
24. M.V. Solodov and S.K. Zavriev, Error stability properties of generalized gradient-type algorithms, J. Optim. Theor. Appl. 98 (1998), pp. 663-680.
25. P. Tseng, An incremental gradient(-projection) method with momentum term and adaptive stepsize rule, SIAM J. Optim. 8 (1998), pp. 506-531.