An exact penalty function optimization method and its application in stress constrained topology optimization and scenario based reliability design problems

被引:7
|
作者
Liao, Haitao [1 ]
Yuan, Xujing [1 ]
Gao, Ruxin [1 ]
机构
[1] Beijing Inst Technol, Inst Adv Struct Technol, Beijing 100081, Peoples R China
基金
美国国家科学基金会;
关键词
Active function; Loss function; Exact penalty function; Optimal conditions; Lagrange multiplier; Topology optimization; SEQUENTIAL QUADRATIC OPTIMIZATION; NONLINEAR OPTIMIZATION; LINE SEARCH; ALGORITHM; APPROXIMATION; REGRESSION;
D O I
10.1016/j.apm.2023.10.014
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
A smooth penalty function method which does not involve dual and slack implicit variables to formulate constrained optimization conditions is proposed. New active and loss functions are devised to independently and adaptively handle the violation of each constraint function. A single unconstrained minimization of the proposed penalty function produces a solution to the original optimization problem. The constrained optimization conditions depending only on the primal variable are derived and reduce to the canonical Karush-Kuhn-Tucker(KKT) conditions in a much more general framework. The derivative of the proposed loss functions with respect to constraint function can be interpreted as the Lagrange multiplier of the traditional Lagrangian function. The appearance of the first-order Hessian information is unveiled. This is in contrast to the existing works where the classical Lagrange Hessian contains only second order derivatives. Finally, some numerical examples including medium-scale stress constrained topology optimization and scenario based reliability design problems are presented to demonstrate the effectiveness of the proposed methodology.
引用
收藏
页码:260 / 292
页数:33
相关论文
共 50 条
  • [31] ON A REFINEMENT OF THE CONVERGENCE ANALYSIS FOR THE NEW EXACT PENALTY FUNCTION METHOD FOR CONTINUOUS INEQUALITY CONSTRAINED OPTIMIZATION PROBLEM
    Yu, Changjun
    Teo, Kok Lay
    Zhang, Liansheng
    Bai, Yanqin
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2012, 8 (02) : 485 - 491
  • [32] Smoothing of the lower-order exact penalty function for inequality constrained optimization
    Shujun Lian
    Yaqiong Duan
    Journal of Inequalities and Applications, 2016
  • [33] TOPOLOGY OPTIMIZATION USING NEURAL NETWORK FOR STRESS CONSTRAINED PROBLEMS
    Shishir, Imrul Reza
    Tabarraei, Alireza
    PROCEEDINGS OF ASME 2023 INTERNATIONAL MECHANICAL ENGINEERING CONGRESS AND EXPOSITION, IMECE2023, VOL 11, 2023,
  • [34] The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems
    Jiang, Min
    Meng, Zhiqing
    Shen, Rui
    Dang, Chuangyin
    OPTIMIZATION, 2022, 71 (04) : 973 - 998
  • [35] An Exact Method for (Constrained) Assortment Optimization Problems with Product Costs
    Leitner, Markus
    Lodi, Andrea
    Roberti, Roberto
    Sole, Claudio
    INFORMS JOURNAL ON COMPUTING, 2024, 36 (02) : 479 - 494
  • [36] An efficient penalty function method for scenario-based uncertainty quantification problems
    Liao, Haitao
    Yuan, Wenhao
    Gao, Ruxin
    Yuan, Xujin
    JOURNAL OF VIBRATION AND CONTROL, 2025, 31 (3-4) : 499 - 515
  • [37] Stress-constrained topology optimization for compliant mechanism design
    Daniel M. De Leon
    Joe Alexandersen
    Jun S. O. Fonseca
    Ole Sigmund
    Structural and Multidisciplinary Optimization, 2015, 52 : 929 - 943
  • [38] Stress-constrained topology optimization for compliant mechanism design
    De Leon, Daniel M.
    Alexandersen, Joe
    Fonseca, Jun S. O.
    Sigmund, Ole
    STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2015, 52 (05) : 929 - 943
  • [39] An Exact Penalty Method for Binary Optimization Based on MPEC Formulation
    Yuan, Ganzhao
    Ghanem, Bernard
    THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 2867 - 2875
  • [40] A novel class of exact penalty function approach for optimization problems with inequality constraints
    Yilmaz, Nurullah
    Zeytinoglu, Asuman
    JOURNAL OF MATHEMATICAL MODELING, 2025, 13 (01): : 153 - 167