Global Optimization Method for Solving Mathematical Programs with Linear Complementarity Constraints

被引:0
|
作者
N. V. Thoai
Y. Yamamoto
A. Yoshise
机构
[1] University of Trier,Department of Mathematics
[2] University of Tsukuba,Institute of Policy and Planning Sciences
[3] University of Tsukuba,Institute of Policy and Planning Sciences
关键词
Programs with linear complementarity constraints; equilibrium constraints; bilevel programming; global optimization;
D O I
暂无
中图分类号
学科分类号
摘要
We propose a method for finding a global optimal solution of programs with linear complementarity constraints. This problem arises for instance in bilevel programming. The main idea of the method is to generate a sequence of points either ending at a global optimal solution within a finite number of iterations or converging to a global optimal solution. The construction of such sequence is based on branch-and-bound techniques, which have been used successfully in global optimization. Results on a numerical test of the algorithm are reported.
引用
收藏
页码:467 / 490
页数:23
相关论文
共 50 条
  • [1] Global optimization method for solving mathematical programs with linear complementarity constraints
    Thoai, NV
    Yamamoto, Y
    Yoshise, A
    [J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2005, 124 (02) : 467 - 490
  • [2] Solving mathematical programs with complementarity constraints as nonlinear programs
    Fletcher, R
    Leyffer, S
    [J]. OPTIMIZATION METHODS & SOFTWARE, 2004, 19 (01): : 15 - 40
  • [3] A Robust SQP Method for Mathematical Programs with Linear Complementarity Constraints
    Xinwei Liu
    Georgia Perakis
    Jie Sun
    [J]. Computational Optimization and Applications, 2006, 34 : 5 - 33
  • [4] A robust SQP method for mathematical programs with linear complementarity constraints
    Liu, XW
    Perakis, G
    Sun, J
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2006, 34 (01) : 5 - 33
  • [5] Global convergence of a smooth approximation method for mathematical programs with complementarity constraints
    Yin, Hongxia
    Zhang, Jianzhong
    [J]. MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2006, 64 (02) : 255 - 269
  • [6] Global Convergence of a Smooth Approximation Method for Mathematical Programs with Complementarity Constraints
    Hongxia Yin
    Jianzhong Zhang
    [J]. Mathematical Methods of Operations Research, 2006, 64 : 255 - 269
  • [7] Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment
    Yan Zhang
    Nikolaos V. Sahinidis
    [J]. Optimization Letters, 2016, 10 : 325 - 340
  • [8] On the global solution of linear programs with linear complementarity constraints
    Hu, Jing
    Mitchell, John E.
    Pang, Jong-Shi
    Bennett, Kristin P.
    Kunapuli, Gautam
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2008, 19 (01) : 445 - 471
  • [9] Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment
    Zhang, Yan
    Sahinidis, Nikolaos V.
    [J]. OPTIMIZATION LETTERS, 2016, 10 (02) : 325 - 340
  • [10] A SMOOTHING METHOD FOR MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS
    He, Suxiang
    Shen, Tingting
    Zhang, Jie
    [J]. PACIFIC JOURNAL OF OPTIMIZATION, 2020, 16 (04): : 525 - 545