Distributed optimization in multi-agent systems: applications to distributed regression

Srinivasan, Sundhar Ram

Permalink

https://hdl.handle.net/2142/16105 Copy

Description

Title

Distributed optimization in multi-agent systems: applications to distributed regression

Author(s)

Srinivasan, Sundhar Ram

Issue Date

2010-05-19T18:36:22Z

Director of Research (if dissertation) or Advisor (if thesis)

Veeravalli, Venugopal V.

Doctoral Committee Chair(s)

Veeravalli, Venugopal V.

Committee Member(s)

• Nedich, Angelia
• Srikant, Rayadurgam
• Meyn, Sean P.
• Jones, Douglas L.

Department of Study

Electrical & Computer Eng

Discipline

Electrical & Computer Engr

Degree Granting Institution

University of Illinois at Urbana-Champaign

Degree Name

Ph.D.

Degree Level

Dissertation

Keyword(s)

• multi-agent systems
• stochastic optimization
• convex optimization
• distributed optimization
• regression
• distributed regression

Abstract

The context for this work is cooperative multi-agent systems (MAS). An agent is an intelligent entity that can measure some aspect of its environment, process information and possibly influence the environment through its action. A cooperative MAS can be defined as a loosely coupled network of agents that interact and cooperate to solve problems that are beyond the individual capabilities or knowledge of each agent. The focus of this thesis is distributed stochastic optimization in multi-agent systems. In distributed optimization, the complete optimization problem is not available at a single location but is distributed among different agents. The distributed optimization problem is additionally stochastic when the information available to each agent is with stochastic errors. Communication constraints, lack of global information about the network topology and the absence of coordinating agents make it infeasible to collect all the information at a single location and then treat it as a centralized optimization problem. Thus, the problem has to be solved using algorithms that are distributed, i.e., different parts of the algorithm are executed at different agents, and local, i.e., each agent uses only information locally available to it and other information it can obtain from its immediate neighbors. In this thesis, we will primarily focus on the specific problem of minimizing a sum of functions over a constraint set, when each component function is known partially (with stochastic errors) to a unique agent. The constraint set is known to all the agents. We propose three distributed and local algorithms, establish asymptotic convergence with diminishing stepsizes and obtain rate of convergence results. Stochastic errors, as we will see, arise naturally when the objective function known to an agent has a random variable with unknown statistics. Additionally, stochastic errors also model communication and quantization errors. The problem is motivated by distributed regression in sensor networks and power control in cellular systems. We also discuss an important extension to the above problem. In the extension, the network goal is to minimize a global function of a sum of component functions over a constraint set. Each component function is known to a unique network agent. The global function and the constraint set are known to all the agents. Unlike the previous problem, this problem is not stochastic. However, the objective function in this problem is more general. We propose an algorithm to solve this problem and establish its convergence.

Graduation Semester

2010-5

Permalink

http://hdl.handle.net/2142/16105

Copyright and License Information

Copyright 2010 Sundhar Ram Srinivasan

Owning Collections