Abstract
We propose a new family of relaxation schemes for mathematical programs with complementarity constraints. We discuss the properties of the sequence of relaxed non-linear programs as well as stationary properties of limiting points. A sub-family of our relaxation schemes has the desired property of converging to an M-stationary point. A stronger convergence result is also proved in the affine case. A comprehensive numerical comparison between existing relaxation methods is performed on the library of test problems MacMPEC which shows promising results for our new method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Definitions of stationary points of a non-linear program at the beginning of Sect. 3.2.1.
- 2.
Definitions of M- and S-stationarity points are given in Definition 3.3.
- 3.
\(\lim \limits _{k \rightarrow \infty } A^k = A\) pointwise means that for all sequences \(\{ x^k \}\) with \(x^k \in A^k\) for all k implies \(\lim \limits _{k \rightarrow \infty } x^k \in A\) and for any \(x^* \in A\) there exists a sequence \(x^k\) with \(x^k \in A^k\) such that \(\lim \limits _{k \rightarrow \infty } x^k = x^*\).
- 4.
For indices \(i \in \mathcal {I}_{GH}^{0+}(x^k;t_k)\) (symmetry for indices \(i \in \mathcal {I}_{GH}^{+0}(x^k;t_k)\)), then \(\lambda ^{G,k}_i=\eta ^{\Phi ,k}_i {t_{2,k}}\theta '_{{t_{1,k}}}(G_i(x^k)){F_{2i}(x^k;t_k)}\) and \(\lambda ^{H,k}_i=\eta ^{\Phi ,k}_i{F_{2i}(x^k;t_k)}\). Therefore, considering that \(t_k \theta '_{{t_{1,k}}}(G_i(x^k)) <1\), we get \(\lambda ^{G,k}_i < \lambda ^{H,k}_i\). All in all the infinite norm is not obtained at these components.
- 5.
\((I,I^c,I^-)\) is a partition of \(\mathcal {I}_{GH}^{00}(z;t)\) means that \(I\cup I^c\cup I^- = \mathcal {I}_{GH}^{00}(z;t)\) and \(I\cap I^c=I \cap I^- = I^c \cap I^-=\emptyset \).
- 6.
We remind that \({F_{1i}(x^k;t_k)}=H_i(x)-{t_{2,k}}\theta _{{t_{1,k}}}(G_i(x)) \text{ and } {F_{2i}(x^k;t_k)}=G_i(x)-{t_{2,k}}\theta _{{t_{1,k}}}(H_i(x))\). Thus, \(\lim _{k \rightarrow \infty } ({F_{2i}(x^k;t_k)},{F_{1i}(x^k;t_k)}) = (G_i(x^*),0)\) and \(G_i(x^*)>0\).
References
Abdallah, L., Haddou, M., Migot, T.: Solving absolute value equation using complementarity and smoothing functions. J. Comput. Appl. Math. 327, 196–207 (2018)
Abdallah, L., Haddou, M., Migot, T.: A sub-additive DC approach to the complementarity problem. Comput. Optim. Appl. 73(2), 509–534 (2019)
Andreani, R., Haeser, G., Secchin, L.D., Silva, P.J.S.: New sequential optimality conditions for mathematical programs with complementarity constraints and algorithmic consequences. SIAM J. Optim. 29(4), 3201–3230 (2019)
Andreani, R., Martínez, J.M., Svaiter, B.F.: A new sequential optimality condition for constrained optimization and algorithmic consequences. SIAM J. Optim. 20(6), 3533–3554 (2010)
Bazaraa, M.S., Shetty, C.M.: Foundations of Optimization, vol. 122. Springer Science & Business Media (2012)
DeMiguel, V., Friedlander, M.P., Nogales, F.J., Scholtes, S.: A two-sided relaxation scheme for mathematical programs with equilibrium constraints. SIAM J. Optim. 16(2), 587–609 (2005)
Dussault, J.-P., Haddou, M., Kadrani, A., Migot, T.: On approximate stationary points of the regularized mathematical program with complementarity constraints. J. Optim. Theory Appl. 186(2), 504–522 (2020)
Dussault, J.-P., Haddou, M., Migot, T.: Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method. Optimization 68(2–3), 509–538 (2019)
Flegel, M.L., Kanzow, C.: Abadie-type constraint qualification for mathematical programs with equilibrium constraints. J. Optim. Theory Appl. 124(3), 595–614 (2005)
Flegel, M.L., Kanzow, C.: On the Guignard constraint qualification for mathematical programs with equilibrium constraints. Optimization 54(6), 517–534 (2005)
Flegel, M.L., Kanzow, C.: A direct proof for M-stationarity under MPEC-GCQ for mathematical programs with equilibrium constraints. Springer (2006)
Fletcher, R., Leyffer, S.: Solving mathematical programs with complementarity constraints as nonlinear programs. Optim. Methods Softw. 19(1), 15–40 (2004)
Fourer, R., Gay, D., Kernighan, B.: Ampl, vol. 119. Boyd & Fraser (1993)
Gill, P.E., Murray, W., Saunders, M.A.: SNOPT: an SQP algorithm for large-scale constrained optimization. SIAM Rev. 47, 99–131 (2005)
Guo, L., Lin, G.-H., Ye, J.J.: Solving mathematical programs with equilibrium constraints. J. Optim. Theory Appl. 166(1), 234–256 (2015)
Hoheisel, T., Kanzow, C., Schwartz, A.: Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints. Math. Program. 137(1–2), 257–288 (2013)
Kadrani, A., Dussault, J.-P., Benchakroun, A.: A new regularization scheme for mathematical programs with complementarity constraints. SIAM J. Optim. 20(1), 78–103 (2009)
Kanzow, C., Schwartz, A.: Mathematical programs with equilibrium constraints: enhanced fritz john-conditions, new constraint qualifications, and improved exact penalty results. SIAM J. Optim. 20(5), 2730–2753 (2010)
Kanzow, C., Schwartz, A.: A new regularization method for mathematical programs with complementarity constraints with strong convergence properties. SIAM J. Optim. 23(2), 770–798 (2013)
Kanzow, C., Schwartz, A.: Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints. Comput. Optim. Appl. 59(1–2), 249–262 (2014)
Kanzow, C., Schwartz, A.: The price of inexactness: convergence properties of relaxation methods for mathematical programs with complementarity constraints revisited. Math. Oper. Res. 40(2), 253–275 (2015)
Leyffer, S.: Macmpec: Ampl collection of mpecs. Argonne National Laboratory. www.mcs.anl.gov/leyfier/MacMPEC (2000)
Lin, G.-H., Fukushima, M.: A modified relaxation scheme for mathematical programs with complementarity constraints. Ann. Oper. Res. 133(1–4), 63–84 (2005)
Luo, Z.-Q., Pang, J.-S., Ralph, D.: Mathematical programs with equilibrium constraints. Cambridge University Press (1996)
Murtagh, B.A., Saunders, M.A.: Minos 5.0 user’s guide. Technical report, DTIC Document (1983)
Outrata, J.V.: Optimality conditions for a class of mathematical programs with equilibrium constraints. Math. Oper. Res. 24(3), 627–644 (1999)
Outrata, J.V.: A generalized mathematical program with equilibrium constraints. SIAM J. Control Optim. 38(5), 1623–1638 (2000)
Pang, J.-S., Fukushima, M.: Complementarity constraint qualifications and simplified b-stationarity conditions for mathematical programs with equilibrium constraints. Comput. Optim. Appl. 13(1), 111–136 (1999)
Ramos, A.: Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences. Optim. Meth. Softw. 36(1), 45–81 (2021)
Scheel, H., Scholtes, S.: Mathematical programs with complementarity constraints: stationarity, optimality, and sensitivity. Math. Oper. Res. 25(1), 1–22 (2000)
Scholtes, S.: Convergence properties of a regularization scheme for mathematical programs with complementarity constraints. SIAM J. Optim. 11(4), 918–936 (2001)
Schwartz, A.: Mathematical programs with complementarity constraints: theory, methods, and applications. PhD thesis, Ph. D. dissertation, Institute of Applied Mathematics and Statistics, University of Würzburg (2011)
Steffensen, S., Ulbrich, M.: A new relaxation scheme for mathematical programs with equilibrium constraints. SIAM J. Optim. 20(5), 2504–2539 (2010)
Wächter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. program. 106(1), 25–57 (2006)
Ye, J.J.: Constraint qualifications and necessary optimality conditions for optimization problems with variational inequality constraints. SIAM J. Optim. 10(4), 943–962 (2000)
Ye, J.J.: Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints. J. Math. Anal. Appl. 307(1), 350–369 (2005)
Ye, J.J., Ye, X.Y.: Necessary optimality conditions for optimization problems with variational inequality constraints. Math. Oper. Res. 22(4), 977–997 (1997)
Ye, J.J., Zhu, D.L., Zhu, Q.J.: Exact penalization and necessary optimality conditions for generalized bilevel programming problems. SIAM J. Optim. 7(2), 481–507 (1997)
Acknowledgements
This research was partially supported by the NSERC grantand partially by a french grant from “l’Ecole des Docteurs de l’UBL” and “le Conseil Régional de Bretagne”. The authors would like to thank the referees for their help and valuable comments.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendices
Appendix
3.7 Proof of a Technical Lemma
In the proof of Theorem 3.4.4 and Theorem 3.4.5, we use the following lemma that links the gradients of G and H with the gradients of \({F_{1}(x;t)}\) and \({F_{2}(x;t)}\).
Lemma 3.7.6
Let \((I,I^c,I^-)\) be any partition of \(\mathcal {I}_{GH}^{00}(x;t)\). Assume that the gradients
are linearly independent. Then, LICQ holds at x for (3.13).
Proof
We show that the gradients of the constraints of (3.13) are positively linearly independent. For this purpose, we prove that the trivial solution is the only solution to the equation
where \(\mathop {\mathrm {supp}}(\eta ^g)\subseteq \mathcal {I}_g(x)\), \(\mathop {\mathrm {supp}}(\eta ^G)\subseteq \mathcal {I}_G(x;\bar{t})\), \(\mathop {\mathrm {supp}}(\eta ^H)\subseteq \mathcal {I}_H(x;\bar{t})\), \(\mathop {\mathrm {supp}}(\eta ^\Phi )\subseteq \mathcal {I}_{GH}^{+0}(x;t) \cup \mathcal {I}_{GH}^{0+}(x;t)\), \(\mathop {\mathrm {supp}}(\nu ^{{F_{1}(x;t)}})\subseteq I\), \(\mathop {\mathrm {supp}}(\nu ^{{F_{2}(x;t)}})\subseteq I\), \(\mathop {\mathrm {supp}}(\mu ^{{F_{1}(x;t)}})\subseteq I^c\), \(\mathop {\mathrm {supp}}(\mu ^{{F_{2}(x;t)}})\subseteq I^c\), \(\mathop {\mathrm {supp}}(\delta ^{{F_{1}(x;t)}})\subseteq I^-\), and \(\mathop {\mathrm {supp}}(\delta ^{{F_{2}(x;t)}})\subseteq I^-\) where \(I \cup I^c \cup I^-=\mathcal {I}_{GH}^{00}(x;t)\) and \(I,I^c,I^-\) have a two-by-two empty intersection.
By definition of \({F_{1}(x;t)}\) and \({F_{2}(x;t)}\), it holds that
The gradient of \({\Phi ^B(G(x),H(x);t)}\) is given by Lemma 3.3.3.
We now replace those gradients in the equation above
with
By linear independence assumption, we obtain
So, it follows for \(i \in I^-\) that
So \(\delta ^{{F_{1}(x;t)}}_i=\delta ^{{F_{2}(x;t)}}_i=0\), since \(i \in \mathcal {I}_{GH}^{00}(x;t)\) gives
by properties of \(\theta \) and (3.8). Similarly, we get \(\mu ^{{F_{1}(x;t)}}_i=\mu ^{{F_{2}(x;t)}}_i=\nu ^{{F_{2}(x;t)}}_i=\nu ^{{F_{1}(x;t)}}_i=0\). \(\square \)
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Dussault, JP., Haddou, M., Migot, T. (2021). The New Butterfly Relaxation Method for Mathematical Programs with Complementarity Constraints. In: Laha, V., Maréchal, P., Mishra, S.K. (eds) Optimization, Variational Analysis and Applications. IFSOVAA 2020. Springer Proceedings in Mathematics & Statistics, vol 355. Springer, Singapore. https://doi.org/10.1007/978-981-16-1819-2_3
Download citation
DOI: https://doi.org/10.1007/978-981-16-1819-2_3
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-1818-5
Online ISBN: 978-981-16-1819-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)