A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming

Author： Gonzalez-Lima María   Oliveira Aurelio   Oliveira Danilo  

Publisher： Springer Publishing Company

ISSN： 0926-6003

Source： Computational Optimization and Applications, Vol.56, Iss.3, 2013-12, pp. : 573-597

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Interior-point methods for linear programming: a review

By Singh J.N.   Singh D.  

International Journal of Mathematical Education in Science and Technology, Vol. 33, Iss. 3, 2002-05 ,pp. : 405-423

Taylor & Francis Ltd

Access to resources Recommend Favorite

Interior-Point Methods with Decomposition for Solving Large-Scale Linear Programs

By Zhao G.Y.  

Journal of Optimization Theory and Applications, Vol. 102, Iss. 1, 1999-07 ,pp. : 169-192

Springer Publishing Company

Access to resources Recommend Favorite

Dual versus primal-dual interior-point methods for linear and conic programming

By Todd M.  

Mathematical Programming, Vol. 111, Iss. 1-2, 2008-01 ,pp. : 301-313

Springer Publishing Company

Access to resources Recommend Favorite

Erratum to: Inexact constraint preconditioners for linear systems arising in interior point methods

By Bergamaschi Luca   Gondzio Jacek   Venturin Manolo   Zilli Giovanni  

Computational Optimization and Applications, Vol. 49, Iss. 2, 2011-06 ,pp. : 401-406

Springer Publishing Company

Access to resources Recommend Favorite

A Polynomial Arc-Search Interior-Point Algorithm for Linear Programming

By Yang Yaguang  

Journal of Optimization Theory and Applications, Vol. 158, Iss. 3, 2013-09 ,pp. : 859-873

Springer Publishing Company

Access to resources Recommend Favorite