期刊
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
卷 27, 期 3, 页码 223-246出版社
SPRINGER
DOI: 10.1023/B:COAP.0000013057.54647.6d
关键词
mathematical program with equilibrium constraints; P-matrix linear complementarity problem; reformulation; smoothing approximation
We consider a mathematical program whose constraints involve a parametric P-matrix linear complementarity problem with the design ( upper level) variables as parameters. Solutions of this complementarity problem define a piecewise linear function of the parameters. We study a smoothing function of this function for solving the mathematical program. We investigate the limiting behaviour of optimal solutions, KKT points and B-stationary points of the smoothing problem. We show that a class of mathematical programs with P-matrix linear complementarity constraints can be reformulated as a piecewise convex program and solved through a sequence of continuously differentiable convex programs. Preliminary numerical results indicate that the method and convex reformulation are promising.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据