A global QP-free algorithm for mathematical programs with complementarity constraints
Abstract In this paper, a primal–dual interior point QP-free algorithm for mathematical programs with complementarity constraints is presented. Firstly, based on Fischer–Burmeister function and smoothing techniques, the investigated problem is approximated by a smooth nonlinear constrained optimizat...
| Main Authors: | , |
|---|---|
| 格式: | Article |
| 語言: | English |
| 出版: |
SpringerOpen
2020-08-01
|
| 叢編: | Journal of Inequalities and Applications |
| 主題: | |
| 在線閱讀: | http://link.springer.com/article/10.1186/s13660-020-02479-6 |