On a global search in D.C. optimization problems

DOI10.1007/978-3-030-38603-0_17zbMATH Open1477.90075OpenAlexW2999184487MaRDI QIDQ1982902FDOQ1982902

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

• Global and local search methods for D.C. constrained problems
• Global optimality conditions and exact penalization
• Extremal problems with d.c.-contraints.
• scientific article; zbMATH DE number 2206827
• scientific article; zbMATH DE number 1569002

zbMATH Keywords

convergencenonconvex optimizationoptimality conditionslinearized problemexact penaltyD.C. functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cited In (12)

• On local search in d.c. optimization 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
• On a Solving Bilevel D.C.-Convex Optimization Problems
• Title not available (Why is that?)
• Computational Study of Local Search Methods for a D.C. Optimization Problem with Inequality Constraints
• Promising GAHC and HC12 algorithms in global optimization tasks
• 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)