On a global search in D.C. optimization problems

DOI10.1007/978-3-030-38603-0_17zbMath1477.90075OpenAlexW2999184487MaRDI QIDQ1982902

Alexander S. Strekalovsky

Publication date: 14 September 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-38603-0_17

zbMATH Keywords

convergenceoptimality conditionsnonconvex optimizationlinearized problemexact penaltyD.C. functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (4)

DC semidefinite programming and cone constrained DC optimization. I: Theory ⋮ On a Solving Bilevel D.C.-Convex Optimization 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

This page was built for publication: On a global search in D.C. optimization problems