scholarly journals On applicability of control parametrization technique to solving distributed optimization problems

Author(s):  
A.V. Chernov ◽  
◽  
2020 ◽  
Vol 13 (6) ◽  
pp. 1813-1823 ◽  
Author(s):  
Bin Li ◽  
◽  
Xiaolong Guo ◽  
Xiaodong Zeng ◽  
Songyi Dian ◽  
...  

Author(s):  
Tiep Le ◽  
Tran Cao Son ◽  
Enrico Pontelli

This paper proposes Multi-context System for Optimization Problems (MCS-OP) by introducing conditional costassignment bridge rules to Multi-context Systems (MCS). This novel feature facilitates the definition of a preorder among equilibria, based on the total incurred cost of applied bridge rules. As an application of MCS-OP, the paper describes how MCS-OP can be used in modeling Distributed Constraint Optimization Problems (DCOP), a prominent class of distributed optimization problems that is frequently employed in multi-agent system (MAS) research. The paper shows, by means of an example, that MCS-OP is more expressive than DCOP, and hence, could potentially be useful in modeling distributed optimization problems which cannot be easily dealt with using DCOPs. It also contains a complexity analysis of MCS-OP.


2015 ◽  
Vol 148 ◽  
pp. 278-287 ◽  
Author(s):  
Jianliang Zhang ◽  
Donglian Qi ◽  
Guangzhou Zhao

Author(s):  
CHA KUN LEE ◽  
PAUL I. BARTON

Dynamic optimization problems with linear hybrid (discrete/continuous) systems embedded whose transition times vary are inherently nonconvex. For a wide variety of applications, a certificate of global optimality is essential, but this cannot be obtained using conventional numerical methods. We present a deterministic framework for the solution of such problems in the continuous time domain. First, the control parametrization enhancing transform is used to transform the embedded dynamic system from a linear hybrid system with scaled discontinuities and varying transition times into a nonlinear hybrid system with stationary discontinuities and fixed transition times. Next, a recently developed convexity theory is applied to construct a convex relaxation of the original nonconvex problem. This allows the problem to be solved in a branch-and-bound framework that can guarantee the global solution within epsilon optimality in a finite number of iterations.


Sign in / Sign up

Export Citation Format

Share Document