Distributed discrete-time convex optimization with closed convex set constraints: linearly convergent algorithm design

HIGHLIGHTS

• What: In this paper a new kind of fast distributed discrete-time algorithms is developed for solving convex optimization problems with closed convex set constraints over directed interaction networks. For the unbalanced case, the simulation results of algorithm in this paper and Algorithm 1 are respectively presented in Figs 4 and 6.
• Who: LICENSE and collaborators from the (UNIVERSITY) have published the research work: Distributed discrete-time convex optimization with closed convex set constraints: Linearly convergent algorithm design, in the Journal: (JOURNAL)
• How: In the EXTRA algorithm with a fixed step-size and . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.