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

Publisher： Cambridge University Press

E-ISSN： 1446-8735|49|2|259-270

ISSN： 1446-1811

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

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 PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION

By  

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

Cambridge University Press

Access to resources Recommend Favorite

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

By  

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

Cambridge University Press

Access to resources Recommend Favorite

Bounds for the Probability Generating Functional of a Gibbs Point Process

By  

Advances in Applied Probability, Vol. 46, Iss. 1, 2014-03 ,pp. : 21-34

Cambridge University Press

Access to resources Recommend Favorite

ABS-type methods for solving full row rank linear systems using a new rank two update

By  

Bulletin of the Australian Mathematical Society, Vol. 70, Iss. 1, 2004-08 ,pp. : 17-34

Cambridge University Press

Access to resources Recommend Favorite