Block-separable linking constraints in augmented Lagrangian coordination

被引:0
|
作者
S. Tosserams
L. F. P. Etman
J. E. Rooda
机构
[1] Eindhoven University of Technology,Department of Mechanical Engineering
关键词
Multidisciplinary design optimization; Decomposition; Distributed optimization; Linking constraints; Augmented lagrangian;
D O I
暂无
中图分类号
学科分类号
摘要
Augmented Lagrangian coordination (ALC) is a provably convergent coordination method for multidisciplinary design optimization (MDO) that is able to treat both linking variables and linking functions (i.e. system-wide objectives and constraints). Contrary to quasi-separable problems with only linking variables, the presence of linking functions may hinder the parallel solution of subproblems and the use of the efficient alternating directions method of multipliers. We show that this unfortunate situation is not the case for MDO problems with block-separable linking constraints. We derive a centralized formulation of ALC for block-separable constraints, which does allow parallel solution of subproblems. Similarly, we derive a distributed coordination variant for which subproblems cannot be solved in parallel, but that still enables the use of the alternating direction method of multipliers. The approach can also be used for other existing MDO coordination strategies such that they can include block-separable linking constraints.
引用
收藏
页码:521 / 527
页数:6
相关论文
共 50 条
  • [21] Consistency Constraint Allocation in Augmented Lagrangian Coordination
    Allison, James T.
    Papalambros, Panos Y.
    JOURNAL OF MECHANICAL DESIGN, 2010, 132 (07) : 0710071 - 0710078
  • [22] Modified hybrid decomposition of the augmented Lagrangian method with larger step size for three-block separable convex programming
    Sun, Min
    Wang, Yiju
    JOURNAL OF INEQUALITIES AND APPLICATIONS, 2018,
  • [23] Modified hybrid decomposition of the augmented Lagrangian method with larger step size for three-block separable convex programming
    Min Sun
    Yiju Wang
    Journal of Inequalities and Applications, 2018
  • [24] A new decomposition method in nonconvex programming via a separable augmented Lagrangian
    Hamdi, A
    Mahey, P
    Dusssault, JP
    RECENT ADVANCES IN OPTIMIZATION, 1997, 452 : 90 - 104
  • [25] EXTRAPOLATION METHODS OF COMPUTING THE SADDLE-POINT OF A LAGRANGE FUNCTION AND APPLICATION TO PROBLEMS WITH BLOCK-SEPARABLE STRUCTURE
    ANTIPIN, AS
    USSR COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1986, 26 (01): : 96 - 96
  • [26] An augmented Lagrangian decomposition method for quasi-separable problems in MDO
    S. Tosserams
    L. F. P. Etman
    J. E. Rooda
    Structural and Multidisciplinary Optimization, 2007, 34 : 211 - 227
  • [27] An augmented Lagrangian decomposition method for quasi-separable problems in MDO
    Tosserams, S.
    Etman, L. F. P.
    Rooda, J. E.
    STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2007, 34 (03) : 211 - 227
  • [28] Adaptive scaling and convergence rates of a separable augmented Lagrangian algorithm.
    Mahey, P
    Dussault, JP
    Benchakroun, A
    Hamdi, A
    OPTIMIZATION, 2000, 48 : 278 - 287
  • [29] ON FULL JACOBIAN DECOMPOSITION OF THE AUGMENTED LAGRANGIAN METHOD FOR SEPARABLE CONVEX PROGRAMMING
    He, Bingsheng
    Hou, Liusheng
    Yuan, Xiaoming
    SIAM JOURNAL ON OPTIMIZATION, 2015, 25 (04) : 2274 - 2312
  • [30] Augmented Lagrangian coordination for distributed optimal design in MDO
    Tosserams, S.
    Etman, L. F. P.
    Rooda, J. E.
    INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2008, 73 (13) : 1885 - 1910