Interior point based continuous methods for linear programming

被引：0

作者：

Liao, Li-Zhi ^{[1
]}

机构：

[1] Hong Kong Baptist Univ, Dept Math, Kowloon, Hong Kong, Peoples R China

来源：

2010 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS IJCNN 2010 | 2010年

关键词：

NONLINEAR GEOMETRY; TRAJECTORIES; AFFINE;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In this paper, the interior point based continuous method is proposed for linear programming. The continuous method model can be viewed as the continuous realization of the existing interior point method for linear programming. Our study will be under the framework of the continuous method for optimization. As a result, we are able to study the behaviors of these continuous method models in a unified format. A key component of the continuous method is an ordinary differential equation (ODE), which is established based on the interior point method for linear programming. The properties of the ODE along with the convergence issues will be addressed.

引用

页数：3

共 50 条

[41] Interior-point algorithm for linear programming based on a new descent direction
Billel, Zaoui
Djamel, Benterki
Aicha, Kraria
Hadjer, Raouache
RAIRO-OPERATIONS RESEARCH, 2023, 57 (05) : 2473 - 2491
[42] An interior point method, based on rank-1 updates, for linear programming
Sturm, JF
Zhang, SZ
MATHEMATICAL PROGRAMMING, 1998, 81 (01) : 77 - 87
[43] An interior point method, based on rank-1 updates, for linear programming
Jos F. Sturm
Shuzhong Zhang
Mathematical Programming, 1998, 81 : 77 - 87
[44] Interior point method, based on rank-1 updates, for linear programming
Sturm, Jos F.
Zhang, Shuzhong
Mathematical Programming, Series A, 1998, 81 (01): : 77 - 87
[45] Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming
Silva, Daniele
Velazco, Marta
Oliveira, Aurelio
MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2017, 85 (01) : 97 - 112
[46] Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming
Daniele Silva
Marta Velazco
Aurelio Oliveira
Mathematical Methods of Operations Research, 2017, 85 : 97 - 112
[47] Sparsity in convex quadratic programming with interior point methods
Mészáros, C
OPTIMIZATION METHODS & SOFTWARE, 2006, 21 (05): : 733 - 745
[48] Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming
Chai, Joo-Siong
Toh, Kim-Chuan
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2007, 36 (2-3) : 221 - 247
[49] A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
Oliveira, ARL
Sorensen, DC
LINEAR ALGEBRA AND ITS APPLICATIONS, 2005, 394 (1-3) : 1 - 24
[50] Sparsity in convex quadratic programming with interior point methods
Laboratory of Operations Research and Decision Systems, Hungarian Academy of Sciences, P.O. Box 63, H-1518 Budapest, Hungary
Optim Method Software, 2006, 5 (733-745):

← 1 2 3 4 5 →