Solving a class of bilevel programming problems by DC programming and DCA

MaRDI QIDQ6873106zbMATH OpenFDO

Authors W. Bouguern, S. Addouneh, Hanene Debbiche

Publication date 19 January 2026

Published in Nonlinear Dynamics and Systems Theory (Search for Journal in Brave)

Full work available at URL http://e-ndst.kiev.ua/v25n6/2(102).pdf

zbMATH Keywords

bilevel programmingpenalty functionDC optimizationregularization approach

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Cites work

• A DC algorithm for solving non-uniquely solvable absolute value equations
• A DC algorithm for solving quadratic-linear bilevel optimization problems
• A DC programming approach for a class of bilevel programming problems and its application in portfolio selection
• A bundle algorithm applied to bilevel programming problems with non-unique lower level solutions
• An easy path to convex analysis and applications
• Application of discrete event simulation and system dynamics modeling in optimizing the performance of outpatient department
• Continuous-time optimal portfolio selection using mean-CaR models
• DC programming and DCA: thirty years of developments
• On the numerical solution of a class of Stackelberg problems
• Optimality conditions for bilevel programming problems
• Solution of bilevel optimization problems using the KKT approach
• Test problem construction for linear bilevel programming problems

This page was built for publication: Solving a class of bilevel programming problems by DC programming and DCA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6873106)