Explicit model of dual programming and solving method for a class of separable convex programming problems

DOI10.1080/0305215X.2018.1531988OpenAlexW2898103563MaRDI QIDQ5059225

Yun-Kang Sui, Xirong Peng

Publication date: 23 December 2022

Published in: Engineering Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0305215x.2018.1531988

zbMATH Keywords

structural topology optimizationseparable convex programmingmethod of moving asymptotes (MMA)dual sequential quadratic programming (DSQP) methodexplicit dual objective function

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (4)

Stiffness and strength topology optimization for bi‐disc systems based on dual sequential quadratic programming ⋮ Topology optimization for disc structures with buckling and displacement constraints ⋮ An improved optimality criterion combined with density filtering method for structural topology optimization ⋮ An optimization method to solve a fully intuitionistic fuzzy non-linear separable programming problem

Uses Software

• CONLIN
• top.m
• top88.m

Cites Work

• Unnamed Item
• Incomplete series expansion for function approximation
• Sequential approximate optimization using dual subproblems based on incomplete series expansions
• Efficient topology optimization in MATLAB using 88 lines of code
• First-order sequential convex programming using approximate diagonal QP subproblems
• Positive definite separable quadratic programs for non-convex problems
• First and second order constraint approximations in structural optimization
• Generating optimal topologies in structural design using a homogenization method
• Structural optimization using sensitivity analysis and a level-set method.
• A level set method for structural topology optimization.
• Topology optimization with closed B-splines and Boolean operations
• A primal-dual interior point method for large-scale free material optimization
• A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations
• A quadratic approximation for structural topology optimization
• The method of moving asymptotes—a new method for structural optimization
• Structural weight optimization by dual methods of convex programming
• On the Topological Derivative in Shape Optimization
• Design-dependent loads in topology optimization
• Efficient approximation concepts using second order information

This page was built for publication: Explicit model of dual programming and solving method for a class of separable convex programming problems