On solving difference of convex functions programs with linear complementarity constraints - Université de Lorraine Access content directly
Journal Articles Computational Optimization and Applications Year : 2023

On solving difference of convex functions programs with linear complementarity constraints

Abstract

We address a large class of Mathematical Programs with Linear Complementarity Constraints which minimizes a continuously differentiable DC function (Difference of Convex functions) on a set defined by linear constraints and linear complementarity constraints, named Difference of Convex functions programs with Linear Complementarity Constraints. Using exact penalty techniques, we reformulate it, via four penalty functions, as standard Difference of Convex functions programs. The difference of convex functions algorithm (DCA), an efficient approach in nonconvex programming framework, is then developed to solve the resulting problems. Two particular cases are considered: quadratic problems with linear complementarity constraints and asymmetric eigenvalue complementarity problems. Numerical experiments are performed on several benchmark data, and the results show the effectiveness and the superiority of the proposed approaches comparing with some standard methods.
No file

Dates and versions

hal-04151433 , version 1 (04-07-2023)

Identifiers

Cite

Hoai An Le Thi, Thi Minh Tam Nguyen, Tao Pham Dinh. On solving difference of convex functions programs with linear complementarity constraints. Computational Optimization and Applications, 2023, 86 (1), pp.163-197. ⟨10.1007/s10589-023-00487-y⟩. ⟨hal-04151433⟩
21 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More