Sequential approximate optimization using dual subproblems based on incomplete series expansions
type: Item
instance of: scholarly article
title: Sequential approximate optimization using dual subproblems based on incomplete series expansions
zbMATH Open document ID: 1273.74388
author: Albert A. Groenwold
author: L. F. P. Etman
published in: Structural and Multidisciplinary Optimization
publication date: 2013-10-25T00:00:00Z
Mathematics Subject Classification ID: 74P10
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 65K10
zbMATH DE Number: 6220159
describes a project that uses: LBFGS-B
MaRDI profile type: Publication
full work available at URL: s00158-007-0197-0
OpenAlex ID: W1972608194
cites work: A Limited Memory Algorithm for Bound Constrained Optimization
cites work: Trust Region Methods
cites work: Lagrange multipliers and nonlinear programming
cites work: Nonlinear programming without a penalty function.
cites work: On the Global Convergence of a Filter--SQP Algorithm
cites work: Structural weight optimization by dual methods of convex programming
cites work: Structural optimization: A new dual method using mixed variables
cites work: Q4136993
cites work: On the equivalence of optimality criterion and sequential approximate optimization methods in the classical topology layout problem
cites work: Incomplete series expansion for function approximation
cites work: Discrete-continuous variable structural synthesis using dual methods
cites work: An efficient algorithm for the optimum design of trusses with discrete variables
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: Efficient safety index calculation for structural reliability analysis
cites work: Improved two-point function approximations for design optimization
cites work: A duality theorem for non-linear programming
cites work: Algorithm 778: L-BFGS-B
DOI: 10.1007/S00158-007-0197-0
description: scientific article; zbMATH DE number 6220159