The Exactness of the \ell₁ Penalty Function for a Class of Mathematical Programs with Generalized Complementarity Constraints

From MaRDI portal
Publication:6401640

DOI10.1016/J.FMRE.2023.04.006arXiv2206.04844MaRDI QIDQ6401640FDOQ6401640


Authors: Yukuan Hu, Xin Liu Edit this on Wikidata


Publication date: 9 June 2022

Abstract: In a Mathematical Program with Generalized Complementarity Constraints (MPGCC), complementarity relationships are imposed between each pair of variable blocks. MPGCC includes the traditional Mathematical Program with Complementarity Constraints (MPCC) as a special case. On account of the disjunctive feasible region, MPCC and MPGCC are generally difficult to handle. The ell1 penalty method, often adopted in computation, opens a way of circumventing the difficulty. Yet it remains unclear about the exactness of the ell1 penalty function, namely, whether there exists a sufficiently large penalty parameter so that the penalty problem shares the optimal solution set with the original one. In this paper, we consider a class of MPGCCs that are of multi-affine objective functions. This problem class finds applications in various fields, e.g., the multi-marginal optimal transport problems in many-body quantum physics and the pricing problem in network transportation. We first provide an instance from this class, the exactness of whose ell1 penalty function cannot be derived by existing tools. We then establish the exactness results under rather mild conditions. Our results cover those existing ones for MPCC and apply to multi-block contexts.













This page was built for publication: The Exactness of the $\ell_1$ Penalty Function for a Class of Mathematical Programs with Generalized Complementarity Constraints

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