Positive definite separable quadratic programs for non-convex problems
type: Item
instance of: scholarly article
title: Positive definite separable quadratic programs for non-convex problems
zbMATH Open document ID: 1274.90380
author: Albert A. Groenwold
published in: Structural and Multidisciplinary Optimization
publication date: 2013-11-15T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 74P15
Mathematics Subject Classification ID: 90C55
zbMATH DE Number: 6228162
zbMATH Keywords: separable quadratic program (QP)
zbMATH Keywords: non-convex approximation
zbMATH Keywords: positive definite
zbMATH Keywords: topology optimization
zbMATH Keywords: local stress constraints
describes a project that uses: SCPIP
MaRDI profile type: Publication
full work available at URL: s00158-012-0810-8
OpenAlex ID: W2106388155
cites work: Q4248801
cites work: First-order sequential convex programming using approximate diagonal QP subproblems
cites work: Lagrange multipliers and nonlinear programming
cites work: Structural weight optimization by dual methods of convex programming
cites work: Structural optimization: A new dual method using mixed variables
cites work: Sequential approximate optimization using dual subproblems based on incomplete series expansions
cites work: A quadratic approximation for structural topology optimization
cites work: Approximated approximations for SAO
cites work: Q5491447
cites work: The method of moving asymptotes—a new method for structural optimization
cites work: A class of globally convergent optimization methods based on conservative convex separable approximations
cites work: Non‐convex dual forms based on exponential intervening variables, with application to weight minimization
cites work: On concave constraint functions and duality in predominantly black-and-white topology optimization
DOI: 10.1007/S00158-012-0810-8
description: scientific article; zbMATH DE number 6228162