Login / Signup
Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms.
Yue Wei
Chengsi Shang
Hao Fang
Xianlin Zeng
Lihua Dou
Panos M. Pardalos
Published in:
Autom. (2022)
Keyphrases
</>
directed graph
convex optimization problems
resource allocation problems
combinatorial optimization
learning algorithm
optimization problems
distributed systems
video sequences
worst case
random walk
structured data
maximum flow