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

ISSN： 0022-3239

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

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

A Polynomial Interior-Point Algorithm for Monotone Linear Complementarity Problems

By Mansouri H.

Journal of Optimization Theory and Applications, Vol. 157, Iss. 2, 2013-05 ,pp. : 451-461

Springer Publishing Company

Access to resources Recommend Favorite

A primal-dual interior-point algorithm for quadratic programming

By Dominguez Juan González-Lima María

Numerical Algorithms, Vol. 42, Iss. 1, 2006-05 ,pp. : 1-30

Springer Publishing Company

Access to resources Recommend Favorite

Globally Convergent Interior-Point Algorithm for Nonlinear Programming

By Akrotirianakis I. Rustem B.

Journal of Optimization Theory and Applications, Vol. 125, Iss. 3, 2005-06 ,pp. : 497-521

Springer Publishing Company

Access to resources Recommend Favorite

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

Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming

By Recht P. Schade P.H.

Optimization, Vol. 56, Iss. 4, 2007-08 ,pp. : 495-514

Taylor & Francis Ltd

Access to resources Recommend Favorite