A Finite Algorithm for Almost Linear Complementarity Problems

ISSN： 0163-0563

Source： Numerical Functional Analysis and Optimization, Vol.28, Iss.11-12, 2007-11, pp. : 1387-1403

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

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

By Zhou Guanglu Toh Kim-Chuan Zhao Gongyun

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

Springer Publishing Company

Access to resources Recommend Favorite

A modified damped Newton method for linear complementarity problems

By Bai Zhong-Zhi Dong Jun-Liang

Numerical Algorithms, Vol. 42, Iss. 3-4, 2006-07 ,pp. : 207-228

Springer Publishing Company

Access to resources Recommend Favorite

Solution of parametric vertical block linear complementarity problems

International Journal of Computer Mathematics, Vol. 84, Iss. 3, 2007-03 ,pp. : 325-332

Taylor & Francis Ltd

Access to resources Recommend Favorite

Robust solution of monotone stochastic linear complementarity problems

By Chen Xiaojun

Mathematical Programming, Vol. 117, Iss. 1-2, 2009-03 ,pp. : 51-80

Springer Publishing Company

Access to resources Recommend Favorite