Positive definite separable quadratic programs for non-convex problems
From MaRDI portal
Publication:381897
DOI10.1007/s00158-012-0810-8zbMath1274.90380OpenAlexW2106388155MaRDI QIDQ381897
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
topology optimizationpositive definitelocal stress constraintsnon-convex approximationseparable quadratic program (QP)
Nonlinear programming (90C30) Topological methods for optimization problems in solid mechanics (74P15) Methods of successive quadratic programming type (90C55)
Related Items (3)
Explicit model of dual programming and solving method for a class of separable convex programming problems ⋮ Topology optimization via sequential integer programming and canonical relaxation algorithm ⋮ On sequential approximate simultaneous analysis and design in classical topology optimization
Uses Software
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
This page was built for publication: Positive definite separable quadratic programs for non-convex problems
