Global and local search methods for D.C. constrained problems

DOI10.1007/978-3-030-49988-4_1zbMath1464.90068OpenAlexW3037462440MaRDI QIDQ2663718

Alexander S. Strekalovsky

Publication date: 19 April 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-49988-4_1

zbMATH Keywords

difference of convex functionslocal searchlinearized problemglobal searchexact penaltyequality and inequality constraintscritical vector

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

This page was built for publication: Global and local search methods for D.C. constrained problems