THE INEXACT LOG-EXPONENTIAL REGULARIZATION METHOD FOR MATHEMATICAL PROGRAMS WITH VERTICAL COMPLEMENTARITY CONSTRAINTS

被引:3
作者
Pang, Liping [1 ]
Xu, Na [1 ]
Lv, Jian [2 ]
机构
[1] Dalian Univ Technol, Sch Math Sci, Dalian 116024, Liaoning, Peoples R China
[2] Zhejiang Univ Finance & Econ, Sch Finance, Hangzhou 310018, Zhejiang, Peoples R China
关键词
Mathematical program with vertical complementarity constraints; inexact KKT points; C-/M-stationarity; constraint qualification; convergence; inexact regularization method; CONVERGENCE PROPERTIES; OPTIMIZATION; STATIONARITY; OPTIMALITY; ALGORITHM; SCHEME;
D O I
10.3934/jimo.2018032
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
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.
引用
收藏
页码:59 / 79
页数:21
相关论文
共 27 条
[1]   On the behaviour of constrained optimization methods when Lagrange multipliers do not exist [J].
Andreani, R. ;
Martinez, J. M. ;
Santos, L. T. ;
Svaiter, B. F. .
OPTIMIZATION METHODS & SOFTWARE, 2014, 29 (03) :646-657
[2]   A NEW SEQUENTIAL OPTIMALITY CONDITION FOR CONSTRAINED OPTIMIZATION AND ALGORITHMIC CONSEQUENCES [J].
Andreani, Roberto ;
Martinez, J. M. ;
Svaiter, B. F. .
SIAM JOURNAL ON OPTIMIZATION, 2010, 20 (06) :3533-3554
[3]  
[Anonymous], 2006, THESIS U TSUKUBA JAP
[4]  
Bazaraa M. S., 1976, FDN OPTIMIZATION, V122
[5]   An interior point algorithm for large-scale nonlinear programming [J].
Byrd, RH ;
Hribar, ME ;
Nocedal, J .
SIAM JOURNAL ON OPTIMIZATION, 1999, 9 (04) :877-900
[6]   Nonlinear programming without a penalty function [J].
Fletcher, R ;
Leyffer, S .
MATHEMATICAL PROGRAMMING, 2002, 91 (02) :239-269
[7]   SNOPT: An SQP algorithm for large-scale constrained optimization [J].
Gill, PE ;
Murray, W ;
Saunders, MA .
SIAM JOURNAL ON OPTIMIZATION, 2002, 12 (04) :979-1006
[8]  
Gowda MS, 1996, INT J GAME THEORY, V25, P1
[9]   Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints [J].
Hoheisel, Tim ;
Kanzow, Christian ;
Schwartz, Alexandra .
MATHEMATICAL PROGRAMMING, 2013, 137 (1-2) :257-288
[10]   On the multiplier-penalty-approach for quasi-variational inequalities [J].
Kanzow, Christian .
MATHEMATICAL PROGRAMMING, 2016, 160 (1-2) :33-63