Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
Year of publication: |
October-December 2016
|
---|---|
Authors: | Bouafia, Mousaab ; Benterki, Djamel ; Yassine, Adnan |
Published in: |
RAIRO / Operations research. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 50.2016, 4/5, p. 935-949
|
Subject: | Linear optimization | Kernel function | interior point methods | complexity bound | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Interior-point algorithm for linear optimization based on a new trigonometric kernel function
Li, Xin, (2015)
-
A full-Newton step interior-point algorithm for linear optimization based on a finite barrier
Wang, Weiwei, (2016)
-
Simplified infeasible interior-point algorithm for linear optimization based on a simple function
Wang, Weiwei, (2018)
- More ...
-
A new efficient short-step projective interior point method for linear programming
Bouafia, Mousaab, (2018)
-
New effective projection method for variational inequalities problem
Grar, Hassina, (2015)
-
Euchi, Jalel, (2016)
- More ...