Distributed mirror descent method for saddle point problems over directed graphs

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

Authors
Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
DOI 10.1002/cplx.21794
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 40,131
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

View all 9 references / Add more references

Citations of this work BETA

View all 8 citations / Add more citations

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 index
2016-06-30

Total views
15 ( #517,075 of 2,237,103 )

Recent downloads (6 months)
4 ( #472,111 of 2,237,103 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature