Distributed mirror descent method for saddle point problems over directed graphs

Complexity 21 (S2):178-190 (2016)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,628

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Duplication of directed graphs and exponential blow up of proofs.A. Carbone - 1999 - Annals of Pure and Applied Logic 100 (1-3):1-67.
Some natural decision problems in automatic graphs.Dietrich Kuske & Markus Lohrey - 2010 - Journal of Symbolic Logic 75 (2):678-710.
The uncanny mirror: A re-framing of mirror self-experience.Philippe Rochat & Dan Zahavi - 2011 - Consciousness and Cognition 20 (2):204-213.
Coherentism via Graphs.Selim Berker - 2015 - Philosophical Issues 25 (1):322-352.

Analytics

Added to PP
2016-06-30

Downloads
45 (#351,500)

6 months
11 (#232,073)

Historical graph of downloads
How can I increase my downloads?

Author Profiles