Positive definite separable quadratic programs for non-convex problems

DOI10.1007/s00158-012-0810-8zbMath1274.90380MaRDI QIDQ381897

Albert A. Groenwold

Publication date: 15 November 2013

Published in: Structural and Multidisciplinary Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00158-012-0810-8

zbMATH Keywords

topology optimization; positive definite; local stress constraints; non-convex approximation; separable quadratic program (QP)

Mathematics Subject Classification ID

90C30: Nonlinear programming

74P15: Topological methods for optimization problems in solid mechanics

90C55: Methods of successive quadratic programming type

Related Items

Explicit model of dual programming and solving method for a class of separable convex programming problems, On sequential approximate simultaneous analysis and design in classical topology optimization, Topology optimization via sequential integer programming and canonical relaxation algorithm

Uses Software

• SCPIP

Cites Work

• Unnamed Item
• Unnamed Item
• Sequential approximate optimization using dual subproblems based on incomplete series expansions
• Approximated approximations for SAO
• First-order sequential convex programming using approximate diagonal QP subproblems
• On concave constraint functions and duality in predominantly black-and-white topology optimization
• Lagrange multipliers and nonlinear programming
• A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations
• A quadratic approximation for structural topology optimization
• Structural optimization: A new dual method using mixed variables
• The method of moving asymptotes—a new method for structural optimization
• Structural weight optimization by dual methods of convex programming
• Non‐convex dual forms based on exponential intervening variables, with application to weight minimization