We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
On solving difference of convex functions programs with linear complementarity constraints.
- Authors
Le Thi, Hoai An; Nguyen, Thi Minh Tam; Dinh, Tao Pham
- 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.
- Subjects
COMPLEMENTARITY constraints (Mathematics); LINEAR complementarity problem; CONVEX functions; NONCONVEX programming; DIFFERENTIABLE functions
- Publication
Computational Optimization & Applications, 2023, Vol 86, Issue 1, p163
- ISSN
0926-6003
- Publication type
Article
- DOI
10.1007/s10589-023-00487-y