Positive definite separable quadratic programs for non-convex problems

DOI10.1007/S00158-012-0810-8MaRDI QIDQ381897zbMATH OpenOpenAlexFDO

Authors 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 optimizationpositive definitelocal stress constraintsnon-convex approximationseparable quadratic program (QP)

Mathematics Subject Classification ID

Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30) Topological methods for optimization problems in solid mechanics (74P15)

Recommendations

• First-order sequential convex programming using approximate diagonal QP subproblems
• Optimal objective function approximation for separable convex quadratic programming
• Solving nearly-separable quadratic optimization problems as nonsmooth equations
• An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
• A sequential parametric convex approximation method with applications to nonconvex truss topology design problems

Cites work

• scientific article; zbMATH DE number 1300255 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• A class of globally convergent optimization methods based on conservative convex separable approximations
• A quadratic approximation for structural topology optimization
• Approximated approximations for SAO
• First-order sequential convex programming using approximate diagonal QP subproblems
• Lagrange multipliers and nonlinear programming
• Non-convex dual forms based on exponential intervening variables, with application to weight minimization
• On concave constraint functions and duality in predominantly black-and-white topology optimization
• Sequential approximate optimization using dual subproblems based on incomplete series expansions
• Structural optimization: A new dual method using mixed variables
• Structural weight optimization by dual methods of convex programming
• The method of moving asymptotes—a new method for structural optimization

Cited in

(3)

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

Describes a project that uses

Uses Software

• SCPIP

This page was built for publication: Positive definite separable quadratic programs for non-convex problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q381897)