On solving difference of convex functions programs with linear complementarity constraints

被引:0
|
作者
Hoai An Le Thi
Thi Minh Tam Nguyen
Tao Pham Dinh
机构
[1] Université de Lorraine,Faculty of Fundamental Science
[2] LGIPM,Laboratory of Mathematics (LMI)
[3] Institut Universitaire de France (IUF),undefined
[4] Posts and Telecommunications Institute of Technology,undefined
[5] National Institute for Applied Sciences,undefined
关键词
Mathematical program with linear complementarity constraints; Difference of convex functions programming; Difference of convex functions algorithm; Difference of convex functions constraints; Penalty function; 90C26; 90C30; 90C33; 90C90;
D O I
暂无
中图分类号
学科分类号
摘要
We address a large class of Mathematical Programs with Linear Complementarity Constraints which minimizes a continuously differentiable DC function (Difference of Convex functions) on a set defined by linear constraints and linear complementarity constraints, named Difference of Convex functions programs with Linear Complementarity Constraints. Using exact penalty techniques, we reformulate it, via four penalty functions, as standard Difference of Convex functions programs. The difference of convex functions algorithm (DCA), an efficient approach in nonconvex programming framework, is then developed to solve the resulting problems. Two particular cases are considered: quadratic problems with linear complementarity constraints and asymmetric eigenvalue complementarity problems. Numerical experiments are performed on several benchmark data, and the results show the effectiveness and the superiority of the proposed approaches comparing with some standard methods.
引用
收藏
页码:163 / 197
页数:34
相关论文
共 50 条
  • [1] On solving difference of convex functions programs with linear complementarity constraints
    Thi, Hoai An Le
    Nguyen, Thi Minh Tam
    Dinh, Tao Pham
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2023, 86 (01) : 163 - 197
  • [2] A study of the difference-of-convex approach for solving linear programs with complementarity constraints
    Francisco Jara-Moroni
    Jong-Shi Pang
    Andreas Wächter
    [J]. Mathematical Programming, 2018, 169 : 221 - 254
  • [3] A study of the difference-of-convex approach for solving linear programs with complementarity constraints
    Jara-Moroni, Francisco
    Pang, Jong-Shi
    Wachter, Andreas
    [J]. MATHEMATICAL PROGRAMMING, 2018, 169 (01) : 221 - 254
  • [4] On convex quadratic programs with linear complementarity constraints
    Bai, Lijie
    Mitchell, John E.
    Pang, Jong-Shi
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2013, 54 (03) : 517 - 554
  • [5] On convex quadratic programs with linear complementarity constraints
    Lijie Bai
    John E. Mitchell
    Jong-Shi Pang
    [J]. Computational Optimization and Applications, 2013, 54 : 517 - 554
  • [6] A Sequential Convex Programming Approach to Solving Quadratic Programs and Optimal Control Problems With Linear Complementarity Constraints
    Hall, Jonas
    Nurkanovic, Armin
    Messerer, Florian
    Diehl, Moritz
    [J]. IEEE CONTROL SYSTEMS LETTERS, 2022, 6 : 536 - 541
  • [7] On linear programs with linear complementarity constraints
    Hu, Jing
    Mitchell, John E.
    Pang, Jong-Shi
    Yu, Bin
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2012, 53 (01) : 29 - 51
  • [8] On linear programs with linear complementarity constraints
    Jing Hu
    John E. Mitchell
    Jong-Shi Pang
    Bin Yu
    [J]. Journal of Global Optimization, 2012, 53 : 29 - 51
  • [9] ALGORITHMS FOR SOLVING OPTIMIZATION PROGRAMS INVOLVING DIFFERENCE OF CONVEX FUNCTIONS
    Boufi, Karima
    Fadil, Abdessamad
    Roubi, Ahmed
    [J]. Applied Set-Valued Analysis and Optimization, 2025, 7 (01): : 71 - 91
  • [10] Solving linear programs with complementarity constraints using branch-and-cut
    Bin Yu
    John E. Mitchell
    Jong-Shi Pang
    [J]. Mathematical Programming Computation, 2019, 11 : 267 - 310