On the rate of local convergence of high-order-infeasible-path-following algorithms for P*-linear complementarity problems

Computational Optimization and Applications

Saved in:

Bibliographic Details
Main Authors:	Zhao, G., Sun, J.
Other Authors:	DECISION SCIENCES
Format:	Article
Published:	2013
Online Access:	http://scholarbank.nus.edu.sg/handle/10635/45068
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	National University of Singapore

id	sg-nus-scholar.10635-45068
record_format	dspace
spelling	sg-nus-scholar.10635-450682015-01-06T12:11:45Z On the rate of local convergence of high-order-infeasible-path-following algorithms for P-linear complementarity problems Zhao, G. Sun, J. DECISION SCIENCES MATHEMATICS Computational Optimization and Applications 14 3 293-307 CPPPE 2013-10-10T05:02:37Z 2013-10-10T05:02:37Z 1999 Article Zhao, G.,Sun, J. (1999). On the rate of local convergence of high-order-infeasible-path-following algorithms for P-linear complementarity problems. Computational Optimization and Applications 14 (3) : 293-307. ScholarBank@NUS Repository. 09266003 http://scholarbank.nus.edu.sg/handle/10635/45068 NOT_IN_WOS Scopus
institution	National University of Singapore
building	NUS Library
country	Singapore
collection	ScholarBank@NUS
description	Computational Optimization and Applications
author2	DECISION SCIENCES
author_facet	DECISION SCIENCES Zhao, G. Sun, J.
format	Article
author	Zhao, G. Sun, J.
spellingShingle	Zhao, G. Sun, J. On the rate of local convergence of high-order-infeasible-path-following algorithms for P*-linear complementarity problems
author_sort	Zhao, G.
title	On the rate of local convergence of high-order-infeasible-path-following algorithms for P*-linear complementarity problems
title_short	On the rate of local convergence of high-order-infeasible-path-following algorithms for P*-linear complementarity problems
title_full	On the rate of local convergence of high-order-infeasible-path-following algorithms for P*-linear complementarity problems
title_fullStr	On the rate of local convergence of high-order-infeasible-path-following algorithms for P*-linear complementarity problems
title_full_unstemmed	On the rate of local convergence of high-order-infeasible-path-following algorithms for P*-linear complementarity problems
title_sort	on the rate of local convergence of high-order-infeasible-path-following algorithms for p*-linear complementarity problems
publishDate	2013
url	http://scholarbank.nus.edu.sg/handle/10635/45068
_version_	1681083015166427136

On the rate of local convergence of high-order-infeasible-path-following algorithms for P*-linear complementarity problems

Similar Items