full
search.png

Search

close.png

Cancel

arrow
Volume 22, Issue 3
An Optimal Method for Adjusting the Centering Parameter in the Wide-Neighborhood Primal-Dual Interior-Point Algorithm for Linear Programming

Wenbao Ai

J. Comp. Math., 22 (2004), pp. 437-446.

Published online: 2004-06

Preview Full PDF 2387 25455

Cited by

google scholar semantic scholar
Export citation
  • Abstract

In this paper we present a dynamic optimal method for adjusting the centering parameter in the wide-neighborhood primal-dual interior-point algorithms for linear programming, while the centering parameter is generally a constant in the classical wide-neighborhood primal-dual interior-point algorithms. The computational results show that the new method is more efficient.

  • Keywords

Linear programming, Primal-dual interior point methods, Wide-neighbourhood methods.

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-22-437, author = {Ai , Wenbao}, title = {An Optimal Method for Adjusting the Centering Parameter in the Wide-Neighborhood Primal-Dual Interior-Point Algorithm for Linear Programming}, journal = {Journal of Computational Mathematics}, year = {2004}, volume = {22}, number = {3}, pages = {437--446}, abstract = {

In this paper we present a dynamic optimal method for adjusting the centering parameter in the wide-neighborhood primal-dual interior-point algorithms for linear programming, while the centering parameter is generally a constant in the classical wide-neighborhood primal-dual interior-point algorithms. The computational results show that the new method is more efficient.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/10317.html} }
TY - JOUR T1 - An Optimal Method for Adjusting the Centering Parameter in the Wide-Neighborhood Primal-Dual Interior-Point Algorithm for Linear Programming AU - Ai , Wenbao JO - Journal of Computational Mathematics VL - 3 SP - 437 EP - 446 PY - 2004 DA - 2004/06 SN - 22 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/10317.html KW - Linear programming, Primal-dual interior point methods, Wide-neighbourhood methods. AB -

In this paper we present a dynamic optimal method for adjusting the centering parameter in the wide-neighborhood primal-dual interior-point algorithms for linear programming, while the centering parameter is generally a constant in the classical wide-neighborhood primal-dual interior-point algorithms. The computational results show that the new method is more efficient.

Ai , Wenbao. (2004). An Optimal Method for Adjusting the Centering Parameter in the Wide-Neighborhood Primal-Dual Interior-Point Algorithm for Linear Programming. Journal of Computational Mathematics. 22 (3). 437-446. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard