A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION

E-ISSN： 1446-8735|51|4|476-491

ISSN： 1446-1811

Source： ANZIAM Journal, Vol.51, Iss.4, 2011-02, pp. : 476-491

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 kernel function based Interior-Point Methods for solving ()-linear complementarity problem

By Peyghami M. Amini Keyvan

Acta Mathematica Sinica, Vol. 26, Iss. 9, 2010-09 ,pp. : 1761-1778

Springer Publishing Company

Access to resources Recommend Favorite

A FULL NT-STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION BASED ON A SELF-REGULAR PROXIMITY

ANZIAM Journal, Vol. 53, Iss. 1, 2012-03 ,pp. : 48-67

Cambridge University Press

Access to resources Recommend Favorite

A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods

ANZIAM Journal, Vol. 49, Iss. 2, 2007-10 ,pp. : 259-270

Cambridge University Press

Access to resources Recommend Favorite

An interior point method for linear programming based on a class of Kernel functions

Bulletin of the Australian Mathematical Society, Vol. 71, Iss. 1, 2005-02 ,pp. : 139-153

Cambridge University Press

Access to resources Recommend Favorite

On systems of extended primal-dual variational inequalities

By Konnov I.V.

Applicable Analysis, Vol. 91, Iss. 10, 2012-10 ,pp. : 1881-1890

Taylor & Francis Ltd

Access to resources Recommend Favorite