Complexity analysis of interior point methods for linear programming based on a parameterized kernel function-Reference-Cited by-同舟云学术

Complexity analysis of interior point methods for linear programming based on a parameterized kernel function

Published:2016-10 Issue:4-5 Volume:50 Page:935-949
ISSN:0399-0559
Container-title:RAIRO - Operations Research
language:
Short-container-title:RAIRO-Oper. Res.

Author:

Bouafia Mousaab,Benterki Djamel,Yassine Adnan

Publisher

EDP Sciences

Subject

Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science

Link

http://www.rairo-ro.org/10.1051/ro/2015056/pdf

Reference22 articles.

1. E.D. Andersen, J. Gondzio, Cs. Meszaros and X. Xu, Implementation of interior point methods for large scale linear programming, in: Interior Point Methods of Mathematical Programming, edited by T. Terlaky. Kluwer Academic Publisher, The Netherlands (1996) 189–252.

2. Y.Q. Bai and C. Roos, A primal-dual interior point method based on a new kernel function with linear growth rate, in: Proc. of the 9th Australian Optimization Day. Perth, Australia (2002).

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Large-update Primal-dual Interior-point Algorithm for Convex Quadratic Optimization Based on a New Bi-parameterized Bi-hyperbolic Kernel Function;Lobachevskii Journal of Mathematics;2024-03

2. Interior-point algorithm for linear programming based on a new descent direction;RAIRO - Operations Research;2023-09

3. Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function;Boletim da Sociedade Paranaense de Matemática;2022-02-02

4. Novel Kernel Function With a Hyperbolic Barrier Term to Primal-dual Interior Point Algorithm for SDP Problems;Acta Mathematicae Applicatae Sinica, English Series;2022-01

5. A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function;Optimization and Engineering;2020-06-10