A gradient-based approach for discrete optimum design
From MaRDI portal
Recommendations
Cites work
- A global continuation algorithm for solving binary quadratic programming problems
- A special newton-type optimization method
- A superlinear convergent augmented Lagrangian procedure for contact problems
- An Aggregate Constraint Method for Non-Linear Programming
- An augmented Lagrangian element-free (ALEF) approach for crack discontinuities.
- An augmented Lagrangian optimization method for contact analysis problems. II: Numerical evaluation
- An efficient approach to a class of non-smooth optimization problems
- An exact penalty approach for solving a class of minimization problems with boolean variables
- Bregman proximal relaxation of large-scale 0-1 problems
- Continuous approaches for solving discrete optimization problems
- Continuous Characterizations of the Maximum Clique Problem
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3534294 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 2005717 (Why is no real title available?)
- Numerical analysis of Augmented Lagrangian algorithms in complementary elastoplasticity
- Numerical Optimization
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- On Lagrange multipliers and constraints II. Augmented Lagrangian approach
- Penalty for zero–one integer equivalent problem
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Steady-state genetic algorithms for discrete optimization of trusses
Cited in
(6)- Optimum design of structures with discrete variables using higher-order approximation
- A discrete optimization method based on a parameterization of a Grassmannian in multidimensional dichotomous data structuring
- Zero duality gap in surrogate constraint optimization: a concise review of models
- scientific article; zbMATH DE number 1192991 (Why is no real title available?)
- Network iterative optimization of virtual n-dimensional discrete variables
- A gradually descent method for discrete global optimization
This page was built for publication: A gradient-based approach for discrete optimum design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q381494)
