Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 51, 2002 - Issue 6
208
Views
9
CrossRef citations to date
0
Altmetric
Original Articles

Averaged Subgradient Methods for Constrained Convex Optimization and Nash Equilibria Computation

&
Pages 863-888 | Published online: 27 Oct 2010

References

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

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.