Algorithms for linear programming with linear complementarity constraints

被引：7

作者：

Judice, Joaquim J. ^{[1
,2
]}

机构：

[1] Univ Coimbra, Dept Matemat, P-3001454 Coimbra, Portugal

[2] Inst Telecomunicacoes, P-3001454 Coimbra, Portugal

来源：

TOP | 2012年 / 20卷 / 01期

关键词：

Complementarity problems; Global optimization; Nonlinear programming; Mathematical programming with linear complementarity constraints; MATHEMATICAL PROGRAMS; OPTIMALITY CONDITIONS; GLOBAL OPTIMIZATION; STATIONARY POINT; BOUND ALGORITHM; CUT ALGORITHM; ELASTIC-MODE; BRANCH; CONVERGENCE;

D O I：

10.1007/s11750-011-0228-2

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

Linear programming with linear complementarity constraints (LPLCC) is an area of active research in Optimization, due to its many applications, algorithms, and theoretical existence results. In this paper, a number of formulations for important nonconvex optimization problems are first reviewed. The most relevant algorithms for computing a complementary feasible solution, a stationary point, and a global minimum for the LPLCC are also surveyed, together with some comments about their efficiency and efficacy in practice.

引用

页码：4 / 25

页数：22

共 50 条

[21] Conic approximation to quadratic optimization with linear complementarity constraints [J].

Zhou, Jing ;

Fang, Shu-Cherng ;

Xing, Wenxun .

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2017, 66 (01) :97-122

[22] A computational study of global algorithms for linear bilevel programming [J].

de Sabóia, CHM ;

Campêlo, M ;

Scheimberg, S .

NUMERICAL ALGORITHMS, 2004, 35 (2-4) :155-173

[23] A Computational Study of Global Algorithms for Linear Bilevel Programming [J].

Carlos Henrique Medeiros de Sabóia ;

Manoel Campêlo ;

Susana Scheimberg .

Numerical Algorithms, 2004, 35 :155-173

[24] Algorithms and software for linear and nonlinear programming [J].

Wright, SJ .

FIFTH INTERNATIONAL CONFERENCE ON FOUNDATIONS OF COMPUTER-AIDED PROCESS DESIGN, 2000, 96 (323) :58-69

[25] A study of the difference-of-convex approach for solving linear programs with complementarity constraints [J].

Jara-Moroni, Francisco ;

Pang, Jong-Shi ;

Wachter, Andreas .

MATHEMATICAL PROGRAMMING, 2018, 169 (01) :221-254

[26] Global optimization of generalized linear fractional programming with nonlinear constraints [J].

Jiao, Hongwei ;

Guo, Yunrui ;

Shen, Peiping .

APPLIED MATHEMATICS AND COMPUTATION, 2006, 183 (02) :717-728

[27] Active set algorithm for mathematical programs with linear complementarity constraints [J].

Yin, Hongxia ;

Ding, Fei ;

Zhang, Jianzhong .

APPLIED MATHEMATICS AND COMPUTATION, 2011, 217 (21) :8291-8302

[28] Nonstationary Extrapolated Modulus Algorithms for the solution of the Linear Complementarity Problem [J].

Hadjidimos, A. ;

Tzoumas, M. .

LINEAR ALGEBRA AND ITS APPLICATIONS, 2009, 431 (1-2) :197-210

[29] An algorithm for global solution to bi-parametric linear complementarity constrained linear programs [J].

Lee, Yu-Ching ;

Pang, Jong-Shi ;

Mitchell, John E. .

JOURNAL OF GLOBAL OPTIMIZATION, 2015, 62 (02) :263-297

[30] Global algorithm for solving linear multiplicative programming problems [J].

Shen, Peiping ;

Huang, Bingdi .

OPTIMIZATION LETTERS, 2020, 14 (03) :693-710

← 1 2 3 4 5 →