QQ客服 官方微博 反馈留言

	A norm-relaxed SQP method of strongly sub-feasible direction for finely discretized problems from semi-infinite programming
	Xu, Qingjuan[1]; Jian, Jinbao[2]; Han, Daolan[3]
	2011
会议名称	2011 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2011
会议日期	2011-06-10
页码	456-460
URL标识	查看原文
内容类型	会议论文
URI标识	http://www.corc.org.cn/handle/1471x/2306354
专题	上海大学
作者单位	[1]Department of Mathematics, Shanghai University, Shanghai, China [2]College of Mathematics and Information, Guangxi University, Nanning, China [3]College of Mathematics and Computer Science, Guangxi University for Nationalities, Nanning, China
推荐引用方式 GB/T 7714	Xu, Qingjuan[1],Jian, Jinbao[2],Han, Daolan[3]. A norm-relaxed SQP method of strongly sub-feasible direction for finely discretized problems from semi-infinite programming[C]. 见:2011 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2011. 2011-06-10.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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