A gradient-based approach for discrete optimum design
From MaRDI portal
Publication:381494
DOI10.1007/s00158-009-0456-3zbMath1274.90236OpenAlexW2042083285MaRDI QIDQ381494
Tao Tan, Xing-Si Li, Yan-Yan Li
Publication date: 15 November 2013
Published in: Structural and Multidisciplinary Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00158-009-0456-3
Numerical mathematical programming methods (65K05) Integer programming (90C10) Boolean programming (90C09) Compliance or weight optimization in solid mechanics (74P05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An augmented Lagrangian optimization method for contact analysis problems. II: Numerical evaluation
- A global continuation algorithm for solving binary quadratic programming problems
- An efficient approach to a class of non-smooth optimization problems
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Bregman proximal relaxation of large-scale 0-1 problems
- Penalty for zero–one integer equivalent problem
- An exact penalty approach for solving a class of minimization problems with boolean variables
- An Aggregate Constraint Method for Non-Linear Programming
- On Lagrange multipliers and constraints II. Augmented Lagrangian approach
- Numerical Optimization
- A special newton-type optimization method
- Continuous Characterizations of the Maximum Clique Problem
- Steady-state genetic algorithms for discrete optimization of trusses
- A superlinear convergent augmented Lagrangian procedure for contact problems
- Numerical analysis of Augmented Lagrangian algorithms in complementary elastoplasticity
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- An augmented Lagrangian element-free (ALEF) approach for crack discontinuities.
This page was built for publication: A gradient-based approach for discrete optimum design
