On a global search in D.C. optimization problems
From MaRDI portal
Publication:1982902
DOI10.1007/978-3-030-38603-0_17zbMATH Open1477.90075OpenAlexW2999184487MaRDI QIDQ1982902FDOQ1982902
Authors: A. S. Strekalovskiĭ 
Publication date: 14 September 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-38603-0_17
Recommendations
Cited In (17)
- On the merit and penalty functions for the d.c. optimization
- On local search in d.c. optimization problems
- A new necessary and sufficient global optimality condition for canonical DC problems
- Title not available (Why is that?)
- On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game
- Global Optimization and Constraint Satisfaction
- DC semidefinite programming and cone constrained DC optimization. I: Theory
- Deletion-by-infeasibility rule for DC-constrained global optimization
- Title not available (Why is that?)
- Computational Study of Local Search Methods for a D.C. Optimization Problem with Inequality Constraints
- Minimizing sequences in a constrained DC optimization problem
- On a solving bilevel d.c.-convex optimization problems
- A local search method for optimization problem with d.c. inequality constraints
- Promising GAHC and HC12 algorithms in global optimization tasks
- Global and local search methods for D.C. constrained problems
- Title not available (Why is that?)
- Hybrid global search algorithm with genetic blocks for solving hexamatrix games
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)
