# American Institute of Mathematical Sciences

January  2019, 15(1): 59-79. doi: 10.3934/jimo.2018032

## The inexact log-exponential regularization method for mathematical programs with vertical complementarity constraints

 a, b. School of Mathematical Sciences, Dalian University of Technology, Liaoning 116024, China c. School of Finance, Zhejiang University of Finance and Economics, Zhejiang 310018, China

* Corresponding author: Li-Ping Pang

Received  February 2017 Revised  November 2017 Published  April 2018

Fund Project: The first author is supported by Huzhou science and technology plan on No.2016GY03

We study the convergence of the log-exponential regularization method for mathematical programs with vertical complementarity constraints (MPVCC). The previous paper assume that the sequence of Lagrange multipliers are bounded and it can be found by software. However, the KKT points can not be computed via Matlab subroutines exactly in many cases. We note that it is realistic to compute inexact KKT points from a numerical point of view. We prove that, under the MPVCC-MFCQ assumption, the accumulation point of the inexact KKT points is Clarke (C-) stationary point. The idea of inexact KKT conditions can be used to define stopping criteria for many practical algorithms. Furthermore, we introduce a feasible strategy that guarantees inexact KKT conditions and provide some numerical examples to certify the reliability of the approach. It means that we can apply the inexact regularization method to solve MPVCC and show the advantages of the improvement.

Citation: Liping Pang, Na Xu, Jian Lv. The inexact log-exponential regularization method for mathematical programs with vertical complementarity constraints. Journal of Industrial & Management Optimization, 2019, 15 (1) : 59-79. doi: 10.3934/jimo.2018032
##### References:

show all references

##### References:
The numerical results for Example 2
 t $(y^t_1, y^t_2, y^t_3, y^t_4, z^t_1, z^t_2)$ $f^t$ 0.2 (0.0592, -0.4868, 0.3863, 0.2741, 1.0058, 0.4937) 1.7496 0.01 (-0.0000, -0.4999, 0.4011, 0.1994, 1.0001, 0.4999) 1.6929 0.005 ( 0.0000, -0.5000, 0.3997, 0.1998, 1.0000, 0.5000) 1.6901
 t $(y^t_1, y^t_2, y^t_3, y^t_4, z^t_1, z^t_2)$ $f^t$ 0.2 (0.0592, -0.4868, 0.3863, 0.2741, 1.0058, 0.4937) 1.7496 0.01 (-0.0000, -0.4999, 0.4011, 0.1994, 1.0001, 0.4999) 1.6929 0.005 ( 0.0000, -0.5000, 0.3997, 0.1998, 1.0000, 0.5000) 1.6901
The numerical results for Example 4, 5
 Example Algorithm $z$ $f$ $Gap$ 4 Algorithm 2 (0.0000, 2.0000) 0.0000 100 % fmincon (0.0004, 2.0000) 0.0000 99.98 % ADH (0.0000, 1.9988) 0.0000 99.94 % AH (-0.0000, 1.9999) 0.0000 100 % $Polak^1$ (0.0000, 1.8708) 0.0167 93.54 % 5 Algorithm 2 (0.7500, 0.0000) 0.0625 100 % fmincon (0.7500, 0.0003) 0.0625 99.96 % ADH (0.7500, 0.0000) 0.0625 100 % AH (0.7500, 0.0000) 0.0625 100 % $Polak^1$ (0.7500, 0.0000) 0.0625 100 %
 Example Algorithm $z$ $f$ $Gap$ 4 Algorithm 2 (0.0000, 2.0000) 0.0000 100 % fmincon (0.0004, 2.0000) 0.0000 99.98 % ADH (0.0000, 1.9988) 0.0000 99.94 % AH (-0.0000, 1.9999) 0.0000 100 % $Polak^1$ (0.0000, 1.8708) 0.0167 93.54 % 5 Algorithm 2 (0.7500, 0.0000) 0.0625 100 % fmincon (0.7500, 0.0003) 0.0625 99.96 % ADH (0.7500, 0.0000) 0.0625 100 % AH (0.7500, 0.0000) 0.0625 100 % $Polak^1$ (0.7500, 0.0000) 0.0625 100 %
 [1] Jie Zhang, Shuang Lin, Li-Wei Zhang. A log-exponential regularization method for a mathematical program with general vertical complementarity constraints. Journal of Industrial & Management Optimization, 2013, 9 (3) : 561-577. doi: 10.3934/jimo.2013.9.561 [2] Tim Hoheisel, Christian Kanzow, Alexandra Schwartz. Improved convergence properties of the Lin-Fukushima-Regularization method for mathematical programs with complementarity constraints. Numerical Algebra, Control & Optimization, 2011, 1 (1) : 49-60. doi: 10.3934/naco.2011.1.49 [3] Jinyan Fan, Jianyu Pan. On the convergence rate of the inexact Levenberg-Marquardt method. Journal of Industrial & Management Optimization, 2011, 7 (1) : 199-210. doi: 10.3934/jimo.2011.7.199 [4] Shuang Chen, Li-Ping Pang, Dan Li. An inexact semismooth Newton method for variational inequality with symmetric cone constraints. Journal of Industrial & Management Optimization, 2015, 11 (3) : 733-746. doi: 10.3934/jimo.2015.11.733 [5] Zhili Ge, Gang Qian, Deren Han. Global convergence of an inexact operator splitting method for monotone variational inequalities. Journal of Industrial & Management Optimization, 2011, 7 (4) : 1013-1026. doi: 10.3934/jimo.2011.7.1013 [6] Yongchao Liu. Quantitative stability analysis of stochastic mathematical programs with vertical complementarity constraints. Numerical Algebra, Control & Optimization, 2018, 8 (4) : 451-460. doi: 10.3934/naco.2018028 [7] Jinyan Fan, Jianyu Pan. Inexact Levenberg-Marquardt method for nonlinear equations. Discrete & Continuous Dynamical Systems - B, 2004, 4 (4) : 1223-1232. doi: 10.3934/dcdsb.2004.4.1223 [8] Yi Zhang, Liwei Zhang, Jia Wu. On the convergence properties of a smoothing approach for mathematical programs with symmetric cone complementarity constraints. Journal of Industrial & Management Optimization, 2018, 14 (3) : 981-1005. doi: 10.3934/jimo.2017086 [9] X. X. Huang, D. Li, Xiaoqi Yang. Convergence of optimal values of quadratic penalty problems for mathematical programs with complementarity constraints. Journal of Industrial & Management Optimization, 2006, 2 (3) : 287-296. doi: 10.3934/jimo.2006.2.287 [10] Dan Li, Li-Ping Pang, Fang-Fang Guo, Zun-Quan Xia. An alternating linearization method with inexact data for bilevel nonsmooth convex optimization. Journal of Industrial & Management Optimization, 2014, 10 (3) : 859-869. doi: 10.3934/jimo.2014.10.859 [11] Hui Gao, Jian Lv, Xiaoliang Wang, Liping Pang. An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information. Journal of Industrial & Management Optimization, 2017, 13 (5) : 0-0. doi: 10.3934/jimo.2019135 [12] Lei Guo, Gui-Hua Lin. Globally convergent algorithm for solving stationary points for mathematical programs with complementarity constraints via nonsmooth reformulations. Journal of Industrial & Management Optimization, 2013, 9 (2) : 305-322. doi: 10.3934/jimo.2013.9.305 [13] Xiantao Xiao, Jian Gu, Liwei Zhang, Shaowu Zhang. A sequential convex program method to DC program with joint chance constraints. Journal of Industrial & Management Optimization, 2012, 8 (3) : 733-747. doi: 10.3934/jimo.2012.8.733 [14] Chunlin Hao, Xinwei Liu. A trust-region filter-SQP method for mathematical programs with linear complementarity constraints. Journal of Industrial & Management Optimization, 2011, 7 (4) : 1041-1055. doi: 10.3934/jimo.2011.7.1041 [15] Zheng-Hai Huang, Jie Sun. A smoothing Newton algorithm for mathematical programs with complementarity constraints. Journal of Industrial & Management Optimization, 2005, 1 (2) : 153-170. doi: 10.3934/jimo.2005.1.153 [16] Wei Ouyang, Li Li. Hölder strong metric subregularity and its applications to convergence analysis of inexact Newton methods. Journal of Industrial & Management Optimization, 2017, 13 (5) : 0-0. doi: 10.3934/jimo.2019105 [17] Michal Kočvara, Jiří V. Outrata. Inverse truss design as a conic mathematical program with equilibrium constraints. Discrete & Continuous Dynamical Systems - S, 2017, 10 (6) : 1329-1350. doi: 10.3934/dcdss.2017071 [18] Gui-Hua Lin, Masao Fukushima. A class of stochastic mathematical programs with complementarity constraints: reformulations and algorithms. Journal of Industrial & Management Optimization, 2005, 1 (1) : 99-122. doi: 10.3934/jimo.2005.1.99 [19] Nahid Banihashemi, C. Yalçın Kaya. Inexact restoration and adaptive mesh refinement for optimal control. Journal of Industrial & Management Optimization, 2014, 10 (2) : 521-542. doi: 10.3934/jimo.2014.10.521 [20] Adela Capătă. Optimality conditions for strong vector equilibrium problems under a weak constraint qualification. Journal of Industrial & Management Optimization, 2015, 11 (2) : 563-574. doi: 10.3934/jimo.2015.11.563

2018 Impact Factor: 1.025