Averaged subgradient methods for constrained convex optimization and nash equilibria computation

Optimization

Volumn 51, Issue 6, 2002, Pages 863-888

  Butnariu, Dan ^a   Resmerita, Elena ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

Constrained optimization problem; Nash equilibrium; Noncooperative n person game; Subgradient

Indexed keywords

EID: 0036903309     PISSN: 02331934     EISSN: None     Source Type: Journal    
DOI: 10.1080/0233193021000066455     Document Type: Article

References (35)

1. N. Andrei (1999). Advanced Mathematical Programming: Theory, Computational Methods, Applications (Romanian). Editura Tehnica, Bucuresti.
2. A.S. Antipin (2000). From optima to equilibria. In Yu. S. Popkov (Ed.), Dynamics of Non-homogeneous Systems, Vol. 3, pp. 35-64. Russian Academy of Sciences, Editorial URSS, Moscow.
3. M.S. Bazaraa, H.D. Sherali and C.M. Shetty (1993). Nonlinear Programming: Theory and Algorithms, 2nd Edn. John Wiley and Sons, New York.
4. A.D. Belegundu and T.R. Chandrupatla (1999). Optimization: Concepts and Applications in Engineering. Prentice Hall, New Jersey.
5. D.P. Bertsekas (1999). Nonlinear Programming, 2nd Edn. Athena Scientific, Belmont, Mass.
6. E. Blum and W. Oettli (1994). From optimization and variational inequalities to equilibrium problems. The Mathematics Student, 63, 123-145.
7. P. Brousse (1988). Optimization in Mechanics: Problems and Methods. North Holland, Amsterdam.
8. D. Butnariu (1995). The expected-projection methods: its behavior and applications to linear operator equations and convex optimization. Journal of Applied Analysis, 1, 95-108.
9. D. Butnariu and A.N. Iusem (2000). Totally Convex Functions for Fixed Points Computation and Infinite Dimensional Optimization. Kluwer Academic Publishers, Dordrecht.
10. D. Butnariu and E. Resmerita (2001). The outer Bregman projection method for stochastic feasibility problems in Banach spaces. In: D. Butnaiu, Y. Censor and S. Reich, (Eds.), Inherently Parallel Algorithms for Feasibility and Optimization and their Applications, pp. 69-86. Elsevier, Amsterdam.
11. P.J. Davis and P. Rabinowitz (1984). Methods of Numerical Integration, 2nd Edn. Academic Press, Orlando.
12. M. Evans and T.B. Swartz (2000). Approximating Integrals via Monte Carlo and Deterministic Methods. Clarendon Press, Oxford.
13. S.D. Flåm (2001). Approaching equilibria in parallel. In: D. Butnariu, Y. Censor and S. Reich (Eds.), Inherently Parallel Algorithms for Feasibility and Optimization and their Applications, pp. 267-278. Elsevier, Amsterdam.
14. S.D. Flåm and J. Zowe (1990). Relaxed outer projections, weighted averages and convex feasibility. BIT, 30, 289-300.
15. A.A. Goldstein (1964). Convex programming in Hilbert space. Bulletin of the American Mathematical Society, 70(5), 709-710.
16. W. Hock and K. Schittkowski (1981). Test examples for nonlinear programming codes. Lecture Notes in Economics and Mathematical Systems, Vol. 187. Springer Verlag, New York.
17. K.C. Kiwiel (1985). Methods of Descent for Nondifferentiable Optimization. Springer, Berlin.
18. K.C. Kiwiel and P.O. Lindberg (2001). Parallel subgradient methods for convex optimization. In: D. Butnariu, Y. Censor and S. Reich (Eds.), Inherently Parallel Algorithms for Feasibility and Optimization and their Applications, pp. 335-344. Elsevier, Amsterdam.
19. A.R. Krommer and C.W. Ueberhuber (1988). Computational Integration. SIAM, Philadelphia.
20. E.S. Levitin and B.T. Polyak (1966). Constrained minimization methods. USSR Computational Mathematics and Mathematical Physics, 6(5), 1-50.
21. E.S. Levitin and B.T. Polyak (1966). Convergence of minimizing sequences in conditional extremum problems. Soviet Math. Doklady, 7, 764-767.
22. Yu.I. Lyubich and G.D. Maistrovskii (1970). General theory of relaxation processes for convex functions. Uspehi Mat. Nauk, 1, 57-112.
23. M.E. Munroe (1970). Measure and Integration. Addison-Wesley Publishing Company, Reading, Mass.
24. J. Nash (1950). Equilibrium points in bimatrix games. Proceedings of the National Academy of Sciences USA, 36, 48-49.
25. A. Nedić, D.P. Bertsekas and V.S. Borkar (2001). Distributed asynchronous incremental subgradient methods. In: D. Butnariu, Y. Censor and S. Reich (Eds.), Inherently Parallel Algorithms for Feasibility and Optimization and their Applications, pp. 381-407. Elsevier, Amsterdam.
26. H. Nikaido and K. Isoda (1955). Note on noncooperative convex games. Pacific Journal of Mathematics, 5, 807-815.
27. K.R. Parthasarathy (1967). Probability Measures on Metric Spaces. Academic Press, New York.
28. T. Parthasarathy and T.E.S. Raghavan (1971). Some Topics in Two Person Games. American Elsevier Publishing Co., New York.
29. B.T. Polyak (1963). Gradient methods for minimizing functionals (Russian). Zh. Vychisl. Mat. i Mat. Fiz., 3, 643-653.
30. B.T. Polyak (1987). Introduction to Optimization. Optimization Software, New York.
31. B.T. Polyak (1967). A general method of solving extremum problems. Soviet Math. Doklady, 8(3), 593-597.
32. J.B. Rosen (1960). The gradient projection method for nonlinear programming I. SIAM Journal of Applied Mathematics, 8(2), 181-217.
33. A. Stefanescu (2000). Competitive Models in Game Theory and Economic Analysis. Editura Universitatii din Bucuresti, Bucuresti.
34. M. Todd (1976). The Computation of Fixed Points and Applications. Springer-Verlag, Berlin.
35. E.H. Zarantonello (1971). Projections on convex sets in Hilbert space and spectral theory. In: E.H. Zarantonello (Ed.), Contribution to Nonlinear Functional Analysis, pp. 239-343. Academic Press, New York.