Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 13 of 13 for “"Consensus Optimization"”.

  1. Distributed Consensus, Optimization and Computation in Networked Systems

    … part of this thesis, we propose a distributed consensus algorithm under multi-layer multi-group structure with communication time delays. It is proven that the consensus will be achieved in both time-varying and fixed communication delays. In the second part, we study the distributed …

    unt Repository record for Distributed Consensus, Optimization and Computation in Networked Systems (opens in a new tab)

  2. Multi-Agent Consensus Optimization in Large-Scale Supply Networks

    … Consequently, \begin{itemize} \item We adapt consensus-based auction bidding methods to optimize the assignment of demands to the suppliers with known communication pathways and resource constraints. \item Results on moderately large networks are presented, which show promising performance in …

    washington Repository record for Multi-Agent Consensus Optimization in Large-Scale Supply Networks (opens in a new tab)

  3. Decentralized Coordination Control for Dynamic Multiagent Systems

    … either static or dynamic agents. We propose that Consensus Optimization (CO) methods constitute a viable foundation for the synthesis of coordination control strategies that address large classes of DCCPs. In order to understand both the potential and the limitations of such strategies, we develop …

    toronto-retro Repository record for Decentralized Coordination Control for Dynamic Multiagent Systems (opens in a new tab)

  4. Learning to rank in supervised and unsupervised settings using convexity and monotonicity

    … may be viewed as an instance of an unsupervised consensus optimization problem. The dissertation then solves a more general problem of unsupervised consensus over noisy, directed recommendation graphs that have uncertainty over the set of "out" edges that emanate from a vertex. The proposed …

    texas Repository record for Learning to rank in supervised and unsupervised settings using convexity and monotonicity (opens in a new tab)

  5. Nash Equilibrium Seeking Over Networks

    … techniques used in the context of distributed consensus optimization problems. A penalty term is considered for the projected gradient algorithm to annihilate the error term. Finally, we focus on games with coupled constraints in which, playersâ actions belong to a set which is dependent on the …

    toronto-retro Repository record for Nash Equilibrium Seeking Over Networks (opens in a new tab)

  6. First-Order Algorithms for Convex Smooth Optimization Problems With Homogeneous Linear Constraints

    … solution. Such problems arise commonly in consensus optimization, in which the total number of matrix-vector multiplications is the same as the total number of communications needed to reach a consensus. We show that an accelerated gradient descent algorithm can compute an …

    clemson Repository record for First-Order Algorithms for Convex Smooth Optimization Problems With Homogeneous Linear Constraints (opens in a new tab)

  7. Efficient Algorithms for Bilevel Optimization Problems with Application in Machine Learning

    Bilevel optimization is an important class of optimization problems where one optimization problem is nested within another. It has become a powerful framework in a variety of machine learning applications, including signal processing, meta-learning, hyperparameter optimization, reinforcement …

    arizona-thes Repository record for Efficient Algorithms for Bilevel Optimization Problems with Application in Machine Learning (opens in a new tab)

  8. Accuracy, Efficiency, and Parallelism in Network Target Coordination Optimization

    … specialized backgrounds. Decomposition based optimization is a multidisciplinary design optimization (MDO) technique that models and improves this process by partitioning the whole design optimization task into many manageable sub-problems. These sub-problems can be treated separately and a …

    clemson Repository record for Accuracy, Efficiency, and Parallelism in Network Target Coordination Optimization (opens in a new tab)

  9. Decentralized optimization approach for power distribution network and microgrid controls

    … frequency control design for isolated MGs as a consensus optimization problem. We solve it distributively by adopting the partial primal-dual (PPD) algorithm. Interestingly, parts of our specially designed control algorithm turn out to mimic the dynamics of network power flow and virtual …

    uiuc Repository record for Decentralized optimization approach for power distribution network and microgrid controls (opens in a new tab)

  10. Network Target Coordination for Design Optimization of Decomposed Systems

    … decomposed systems. In addition, a biobjective optimization method is also used to capture optimality and feasibility. The numerical performance of the biobjective algorithm is verified by solving an analytical mass allocation problem. For coordinating nonhierarchically decomposed complex …

    clemson Repository record for Network Target Coordination for Design Optimization of Decomposed Systems (opens in a new tab)

  11. Defending distributed systems against adversarial attacks: consensus, consensus-based learning, and statistical learning

    … propose and explore the problems of performing consensus, consensus-based learning, and statistical learning in the presence of malicious components. (1) Consensus: In this dissertation, we explore the influence of communication range on the computability of reaching iterative approximate …

    uiuc Repository record for Defending distributed systems against adversarial attacks: consensus, consensus-based learning, and statistical learning (opens in a new tab)

  12. Dynamics and optimal control of information transmission in complex systems

    … transmission. In Part I, spreading and consensus dynamics on time-varying networks are studied to explore how system parameters and network structures affect the process of information transmission. To understand how a given network feature affects the dynamics of processes occurring on …

    uiuc Repository record for Dynamics and optimal control of information transmission in complex systems (opens in a new tab)

  13. Task allocation in the Internet of Things

    The last few years have been involved by the technological revolution represented by the Internet of Things (IoT). The IoT vision aims to interconnect devices with different capabilities such as sensors, actuators, Radio Frequency Identification (RFID) tags, smart objects (e.g. smartphones), and …

    cagliari Repository record for Task allocation in the Internet of Things (opens in a new tab)