Sequential approximate optimization using dual subproblems based on incomplete series expansions
From MaRDI portal
Publication:373981
DOI10.1007/s00158-007-0197-0zbMath1273.74388MaRDI QIDQ373981
L. F. P. Etman, Albert A. Groenwold
Publication date: 25 October 2013
Published in: Structural and Multidisciplinary Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00158-007-0197-0
90C90: Applications of mathematical programming
90C30: Nonlinear programming
65K10: Numerical optimization and variational techniques
74P10: Optimization of other properties in solid mechanics
Related Items
Explicit model of dual programming and solving method for a class of separable convex programming problems, Non‐convex dual forms based on exponential intervening variables, with application to weight minimization, The Lagrange method and SAO with bounds on the dual variables, Approximated approximations for SAO, First-order sequential convex programming using approximate diagonal QP subproblems, Positive definite separable quadratic programs for non-convex problems, Numerical instabilities and convergence control for convex approximation methods, A quadratic approximation for structural topology optimization
Uses Software
Cites Work
- Unnamed Item
- Incomplete series expansion for function approximation
- Lagrange multipliers and nonlinear programming
- A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations
- Efficient safety index calculation for structural reliability analysis
- On the equivalence of optimality criterion and sequential approximate optimization methods in the classical topology layout problem
- Structural optimization: A new dual method using mixed variables
- An efficient algorithm for the optimum design of trusses with discrete variables
- The method of moving asymptotes—a new method for structural optimization
- A duality theorem for non-linear programming
- Structural weight optimization by dual methods of convex programming
- Discrete-continuous variable structural synthesis using dual methods
- Algorithm 778: L-BFGS-B
- Trust Region Methods
- On the Global Convergence of a Filter--SQP Algorithm
- A Limited Memory Algorithm for Bound Constrained Optimization
- Improved two-point function approximations for design optimization
- Nonlinear programming without a penalty function.