QQ客服 官方微博 反馈留言

	A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function
	Zhang Lipu[1]; Bai Yanqin[2]; Xu Yinghong[3]
刊名	NUMERICAL ALGORITHMS
	2012
卷号	61页码:57-81
关键词	Monotone linear complementarity problems Interior-point algorithm Complexity analysis
ISSN号	1017-1398
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/2296091
专题	上海大学
作者单位	1.[1]Zhejiang A&F Univ, Dept Math, Hangzhou 311300, Zhejiang, Peoples R China. 2.Shanghai Univ, Dept Math, Shanghai 200444, Peoples R China. 3.[2]Shanghai Univ, Dept Math, Shanghai 200444, Peoples R China. 4.[3]Zhejiang Sci Tech Univ, Dept Math, Hangzhou 310018, Zhejiang, Peoples R China.
推荐引用方式 GB/T 7714	Zhang Lipu[1],Bai Yanqin[2],Xu Yinghong[3]. A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function[J]. NUMERICAL ALGORITHMS,2012,61:57-81.
APA	Zhang Lipu[1],Bai Yanqin[2],&Xu Yinghong[3].(2012).A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function.NUMERICAL ALGORITHMS,61,57-81.
MLA	Zhang Lipu[1],et al."A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function".NUMERICAL ALGORITHMS 61(2012):57-81.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。