Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity Problems

Author： Zhou Guanglu Toh Kim-Chuan Zhao Gongyun

Publisher： Springer Publishing Company

ISSN： 0926-6003

Source： Computational Optimization and Applications, Vol.27, Iss.3, 2004-03, pp. : 269-283

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

An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem

By Kheirfam B. Mahdavi-Amiri N.

Optimization, Vol. 64, Iss. 7, 2015-07 ,pp. : 1577-1591

Taylor & Francis Ltd

Access to resources Recommend Favorite

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

An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization

By Mansouri H. Zangiabadi M.

Optimization, Vol. 62, Iss. 2, 2013-02 ,pp. : 285-297

Taylor & Francis Ltd

Access to resources Recommend Favorite

Convergence Analysis of an Inexact Infeasible Interior Point Method for Semidefinite Programming

By Bellavia Stefania Pieraccini Sandra

Computational Optimization and Applications, Vol. 29, Iss. 3, 2004-12 ,pp. : 289-313

Springer Publishing Company

Access to resources Recommend Favorite

An Infeasible Interior-Point Method with Nonmonotonic Complementarity Gaps

By Gasparo Maria Grazia Pieraccini Sandra Armellini Alessandro

Optimization Methods and Software, Vol. 17, Iss. 4, 2002-01 ,pp. : 561-586

Taylor & Francis Ltd

Access to resources Recommend Favorite