QQ客服 官方微博 反馈留言

	Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization (EI收录)
	Bian, Wei[1]; Chen, Xiaojun[2]; Ye, Yinyu[3]
刊名	Mathematical Programming
	2014
卷号	149页码:301-327
关键词	Constrained optimization Iterative methods Optimization Quadratic programming
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/2217068
专题	华南理工大学
作者单位	1.[1] Department of Mathematics, Harbin Institute of Technology, Harbin, China 2.[2] Department of Applied Mathematics, The Hong Kong Polytechnic University, Hong Kong, China 3.[3] Department of Management Science and Engineering, Stanford University, Stanford 4.CA 5.94305, United States
推荐引用方式 GB/T 7714	Bian, Wei[1],Chen, Xiaojun[2],Ye, Yinyu[3]. Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization (EI收录)[J]. Mathematical Programming,2014,149:301-327.
APA	Bian, Wei[1],Chen, Xiaojun[2],&Ye, Yinyu[3].(2014).Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization (EI收录).Mathematical Programming,149,301-327.
MLA	Bian, Wei[1],et al."Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization (EI收录)".Mathematical Programming 149(2014):301-327.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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