摘要：We study the generalizedk-median version of the warehouse-retailer network design problem(kWRND).We formulate the k-WRND as a binary integer program and propose a 6-approximation randomized algorithm based on Lagrangian relaxation.

摘要：支持向量机(SVM)是统计学理论和最优化交叉融合产生的一类重要的机器学习方法,在文本分类、疾病诊断和人脸检测等领域有广泛应用.损失函数是SVM的核心研究内容,它的变分性质在最优性条件刻画、优化算法设计、支持向量表示以及对偶问题研究中发挥着重要作用.本文总结和分析0-1损失函数及其18种常用的SVM代理损失函数,并给出这些损失函数的三种变分性质:次微分、邻近点算子和Fenchel共轭,其中9种邻近点算子和15种Fenchel共轭由本文给出.

摘要：In this paper, we give some convergence results on the gradient projection method with exact stepsize rule for solving the minimization problem with convex constraints. Especially, we show that if the objective function is convex and its gradient is Lipschitz continuous, then the whole sequence of iterations produced by this method with bounded exact stepsizes converges to a solution of the concerned problem.

摘要：文中介绍了硬架支模的探讨与应用。