本文给出了无界域上大规模凹二次规划的一种下逼近算法，并证明了算法的收敛性。
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.
本文给出了无界域上大规模凹二次规划的一种下逼近算法，并证明了算法的收敛性。
In this paper, a lower approximating algorithm of large-scale concave quadratic programming in unbounded domain is constructed.
本文给出了无界域上大规模凹二次规划的一种下逼近算法，并证明了算法的收敛性。
In this paper, a lower approximating algorithm of large-scale concave quadratic programming in unbounded domain is constructed.
应用推荐