SOLVING STRUCTURE FOR NETWORK-DECOMPOSED PROBLEMS OPTIMIZED WITH AUGMENTED LAGRANGIAN COORDINATION

被引:0
|
作者
Xu, Meng [1 ]
Fadel, Georges [1 ]
Wiecek, Margaret M. [2 ]
机构
[1] Clemson Univ, Dept Mech Engn, Clemson, SC USA
[2] Clemson Univ, Dept Math Sci, Clemson, SC USA
关键词
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The complexity of design and optimization tasks of modern products which cannot be carried out by a single expert or by a single design team motivated the development of the field of decomposition-based optimization. In general, the process of decomposition-based optimization consists of two procedures: (1) Partitioning the original problem into sub-problems according to the design disciplines, components or other aspects; and (2) Coordinating these sub-problems to guarantee that the aggregation of their optimal solutions results in a feasible and optimal solution for the original problem. Much current work focuses on alternative approaches for these two procedures. For a decomposed problem with a hierarchical structure, the above two procedures work very well and the Analytical Target Cascading method tailored for this type of problems can be used as the coordination method. However, for a more generally decomposed problem with a non-hierarchical structure, there are several factors that might affect the performance of the optimization by decomposition besides the traditional two procedures. In this paper, these factors are identified as: (1) the number of Lagrangian multipliers; (2) the number of decomposition levels (3) the existence and the selection of the master sub-problem. These factors further characterize the structure to solve the decomposed problem: the Solving Structure for decomposition-based optimization. Both mathematical and engineering test problems are used to explore the role of the solving structure. The results show that under the same partition and using the same coordination method, the Augmented Lagrangian Coordination, the performance of the decomposition-based optimization may be largely different in terms of efficiency, accuracy and resource cost. The results highlight the importance of choosing an optimal solving structure after deciding on the procedures of partitioning and coordination. Based on these test results, several suggestions for guidelines on the selection of an optimal solving structure selection are proposed.
引用
收藏
页数:8
相关论文
共 26 条
  • [1] Lagrangian Coordination and Analytical Target Cascading: Solving ATC-Decomposed Problems with Lagrangian Duality
    Julie B. Lassiter
    Margaret M. Wiecek
    Kara R. Andrighetti
    Optimization and Engineering, 2005, 6 : 361 - 381
  • [2] Lagrangian coordination and analytical target cascading: Solving ATC-decomposed problems with Lagrangian duality
    Lassiter, JB
    Wiecek, MM
    Andrighetti, KR
    OPTIMIZATION AND ENGINEERING, 2005, 6 (03) : 361 - 381
  • [3] Solving Problems With Inconsistent Constraints With a Modified Augmented Lagrangian Method
    Neuenhofen, Martin P.
    Kerrigan, Eric C.
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2023, 68 (04) : 2592 - 2598
  • [4] A HIGHLY EFFICIENT SEMISMOOTH NEWTON AUGMENTED LAGRANGIAN METHOD FOR SOLVING LASSO PROBLEMS
    Li, Xudong
    Sun, Defeng
    Toh, Kim-Chuan
    SIAM JOURNAL ON OPTIMIZATION, 2018, 28 (01) : 433 - 458
  • [5] Augmented Lagrangian Methods for Solving Optimization Problems with Stochastic-Order Constraints
    Dentcheva, Darinka
    Martinez, Gabriela
    Wolfhagen, Eli
    OPERATIONS RESEARCH, 2016, 64 (06) : 1451 - 1465
  • [6] An Augmented Lagrangian Coordination-Decomposition Algorithm for Solving Distributed Non-Convex Programs
    Hours, Jean-Hubert
    Jones, Colin N.
    2014 AMERICAN CONTROL CONFERENCE (ACC), 2014, : 4312 - 4317
  • [7] A partial parallel splitting augmented Lagrangian method for solving constrained matrix optimization problems
    Peng, Zheng
    Wu, Donghua
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2010, 60 (06) : 1515 - 1524
  • [8] A delayed Lagrangian network for solving quadratic programming problems with equality constraints
    Liu, Qingshan
    Wang, Jun
    Cao, Jinde
    ADVANCES IN NEURAL NETWORKS - ISNN 2006, PT 1, 2006, 3971 : 369 - 378
  • [9] Solving the Lagrangian dual problem for some traffic coordination problems through linear programming
    Daugherty, Greyson
    Reveliotis, Spyros
    Mohler, Greg
    2017 IEEE 56TH ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2017,
  • [10] Comparison of Lagrangian relaxation and truncated dynamic programming methods for solving hydrothermal coordination problems
    Salam, MS
    PROCEEDINGS OF INTERNATIONAL CONFERENCE ON INTELLIGENT SENSING AND INFORMATION PROCESSING, 2004, : 265 - 270