摘要
本文给出了无界域上大规模凹二次规划的一种下逼近算法,并证明了算法的收敛性。
In this paper, a lower approximating algorithm of large-scale concave quadratic programming in unbounded domain is constructed. The convergence of the algorithm is discussed.
出处
《大学数学》
1994年第S1期72-75,共4页
College Mathematics
关键词
无界域
凹二次规划
下逼近函数
收敛
Unbounded domain, Concave quadratic programming, Lower appoximating function, Conversence
