Sequential approximate optimization using dual subproblems based on incomplete series expansions
From MaRDI portal
Recommendations
- Approximated approximations for SAO
- Non-convex dual forms based on exponential intervening variables, with application to weight minimization
- Incomplete series expansion for function approximation
- Efficient approximation concepts using second order information
- On the equivalence of optimality criterion and sequential approximate optimization methods in the classical topology layout problem
Cites work
- scientific article; zbMATH DE number 3564751 (Why is no real title available?)
- A Limited Memory Algorithm for Bound Constrained Optimization
- A class of globally convergent optimization methods based on conservative convex separable approximations
- A duality theorem for non-linear programming
- Algorithm 778: L-BFGS-B
- An efficient algorithm for the optimum design of trusses with discrete variables
- Discrete-continuous variable structural synthesis using dual methods
- Efficient safety index calculation for structural reliability analysis
- Improved two-point function approximations for design optimization
- Incomplete series expansion for function approximation
- Lagrange multipliers and nonlinear programming
- Nonlinear programming without a penalty function.
- On the Global Convergence of a Filter--SQP Algorithm
- 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
- Structural weight optimization by dual methods of convex programming
- The method of moving asymptotes—a new method for structural optimization
- Trust Region Methods
Cited in
(12)- Non-convex dual forms based on exponential intervening variables, with application to weight minimization
- Incomplete series expansion for function approximation
- An extended two-stage sequential optimization approach: properties and performance
- Numerical instabilities and convergence control for convex approximation methods
- A quadratic approximation for structural topology optimization
- Explicit model of dual programming and solving method for a class of separable convex programming problems
- Approximated approximations for SAO
- First-order sequential convex programming using approximate diagonal QP subproblems
- On convex transformability and the solution of nonconvex problems via the dual of Falk
- Positive definite separable quadratic programs for non-convex problems
- Efficient approximation concepts using second order information
- The Lagrange method and SAO with bounds on the dual variables
This page was built for publication: Sequential approximate optimization using dual subproblems based on incomplete series expansions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q373981)
