Finite Elements in Analysis and Design
Shape and topology optimization of compliant mechanisms using a parameterization level set method
Journal of Computational Physics
Advances in Engineering Software
Optimum material design of minimum structural compliance under seepage constraint
Structural and Multidisciplinary Optimization
Isogeometric design of elastic arches for maximum fundamental frequency
Structural and Multidisciplinary Optimization
Activation dynamics in the optimization of targeted movements
Computers and Structures
Material interpolation schemes for unified topology and multi-material optimization
Structural and Multidisciplinary Optimization
Generalized Benders' Decomposition for topology optimization problems
Journal of Global Optimization
First-order sequential convex programming using approximate diagonal QP subproblems
Structural and Multidisciplinary Optimization
Solving stress constrained problems in topology and material optimization
Structural and Multidisciplinary Optimization
Enhanced analysis of design sensitivities in topology optimization
Structural and Multidisciplinary Optimization
Slope constrained material design
Structural and Multidisciplinary Optimization
Positive definite separable quadratic programs for non-convex problems
Structural and Multidisciplinary Optimization
Parallel framework for topology optimization using the method of moving asymptotes
Structural and Multidisciplinary Optimization
Structural and Multidisciplinary Optimization
On robust design optimization of truss structures with bounded uncertainties
Structural and Multidisciplinary Optimization
Stress constrained topology optimization
Structural and Multidisciplinary Optimization
Two-point gradient-based MMA (TGMMA) algorithm for topology optimization
Computers and Structures
Numerical instabilities in level set topology optimization with the extended finite element method
Structural and Multidisciplinary Optimization
A survey of structural and multidisciplinary continuum topology optimization: post 2000
Structural and Multidisciplinary Optimization
Hi-index | 0.00 |
This paper deals with a certain class of optimization methods, based on conservative convex separable approximations (CCSA), for solving inequality-constrained nonlinear programming problems. Each generated iteration point is a feasible solution with lower objective value than the previous one, and it is proved that the sequence of iteration points converges toward the set of Karush--Kuhn--Tucker points. A major advantage of CCSA methods is that they can be applied to problems with a very large number of variables (say 104--105) even if the Hessian matrices of the objective and constraint functions are dense.