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

Publisher： Cambridge University Press

E-ISSN： 1446-8735|53|1|48-67

ISSN： 1446-1811

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

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 SELF-REGULAR NEWTON BASED ALGORITHM FOR LINEAR OPTIMIZATION

By  

ANZIAM Journal, Vol. 51, Iss. 2, 2009-10 ,pp. : 286-301

Cambridge University Press

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 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

An Efficient Proximity Point Algorithm for Total-Variation-Based Image Restoration

By  

Advances in Applied Mathematics and Mechanics, Vol. 6, Iss. 2, 2014-04 ,pp. : 145-164

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

By  

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

Cambridge University Press

Access to resources Recommend Favorite