On a global search in D.C. optimization problems
From MaRDI portal
Recommendations
Cited in
(17)- Deletion-by-infeasibility rule for DC-constrained global optimization
- A new necessary and sufficient global optimality condition for canonical DC problems
- Hybrid global search algorithm with genetic blocks for solving hexamatrix games
- On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game
- A local search method for optimization problem with d.c. inequality constraints
- Global and local search methods for D.C. constrained problems
- On local search in d.c. optimization problems
- Promising GAHC and HC12 algorithms in global optimization tasks
- On the merit and penalty functions for the d.c. optimization
- scientific article; zbMATH DE number 1569002 (Why is no real title available?)
- On a solving bilevel d.c.-convex optimization problems
- scientific article; zbMATH DE number 6311514 (Why is no real title available?)
- scientific article; zbMATH DE number 2206827 (Why is no real title available?)
- Global Optimization and Constraint Satisfaction
- Minimizing sequences in a constrained DC optimization problem
- Computational Study of Local Search Methods for a D.C. Optimization Problem with Inequality Constraints
- D. C. optimization approach for finding Berge equilibrium in bimatrix game
This page was built for publication: On a global search in D.C. optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1982902)
