一种极小化两个凸函数之和的混合近似邻近点算法  

A Hybrid Approximate Proximal Point Algorithm for Minimizing the Sum of Two Convex Function

作　　者：陈雍梅 白富生[1] 

机构地区：[1]重庆师范大学数学学院,重庆401331

出　　处：《重庆师范大学学报（自然科学版）》2014年第4期6-11,共6页Journal of Chongqing Normal University:Natural Science

基　　金：重庆市自然科学基金资助项目(No.cstc2011jjA00010)

摘　　要：本文提出一种混合近似邻近点算法以求解极小化两个凸函数之和的无约束优化问题。通过将邻近点算法中的优化问题转化为一系列极小化近似函数的子问题来求解,以得到此优化问题的最优解。在子问题中用线性模型来取代原问题目标函数中非线性程度较低的函数,而在下一个子问题中,用二次模型来取代非线性程度较高的函数,进行交替运算。在临近点算法的框架下,求出原问题的解。最后给出3个算例以说明本文所给出的算法是有效的。In this article, hybrid approximate proximal point algorithm is proposed to minimize the sum of two convex functions. It replaces the optimization problem in the proximal point algorithm by a series of subproblems of minimizing the approximate function to get the optimal solution of optimization problem. In the subproblems, the function with less nonlinearity is replaced by its linear model and the other is replaced by its quadratic model alternately. Under the framework of the proximal point algorithm, we can find tile solution of the original problem. Three numerical examples are given to illustrate the effectiveness of the present algorithm.

关 键 词：凸规划 近似邻近点算法 线性模型 二次模型 

分 类 号：O221.2[理学—运筹学与控制论]