A customized proximal point algorithm for convex minimization with linear constraints

被引：53

作者：

He, Bingsheng ^{[1
,2
]}

Yuan, Xiaoming ^{[3
]}

Zhang, Wenxing ^{[4
]}

机构：

[1] Nanjing Univ, Int Ctr Management Sci & Engn, Nanjing 210093, Jiangsu, Peoples R China

[2] Nanjing Univ, Dept Math, Nanjing 210093, Jiangsu, Peoples R China

[3] Hong Kong Baptist Univ, Dept Math, Hong Kong, Hong Kong, Peoples R China

[4] Univ Elect Sci & Technol China, Sch Math Sci, Chengdu 611731, Peoples R China

来源：

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS | 2013年 / 56卷 / 03期

关键词：

Convex minimization; Proximal point algorithm; Resolvent operator; Augmented Lagrangian method; THRESHOLDING ALGORITHM; DECOMPOSITION;

D O I：

10.1007/s10589-013-9564-5

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper demonstrates a customized application of the classical proximal point algorithm (PPA) to the convex minimization problem with linear constraints. We show that if the proximal parameter in metric form is chosen appropriately, the application of PPA could be effective to exploit the simplicity of the objective function. The resulting subproblems could be easier than those of the augmented Lagrangian method (ALM), a benchmark method for the model under our consideration. The efficiency of the customized application of PPA is demonstrated by some image processing problems.

引用

页码：559 / 572

页数：14

共 50 条

[1] A customized proximal point algorithm for convex minimization with linear constraints
Bingsheng He
Xiaoming Yuan
Wenxing Zhang
[J]. Computational Optimization and Applications, 2013, 56 : 559 - 572
[2] A customized Douglas–Rachford splitting algorithm for separable convex minimization with linear constraints
Deren Han
Hongjin He
Hai Yang
Xiaoming Yuan
[J]. Numerische Mathematik, 2014, 127 : 167 - 200
[3] A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
Han, Deren
He, Hongjin
Yang, Hai
Yuan, Xiaoming
[J]. NUMERISCHE MATHEMATIK, 2014, 127 (01) : 167 - 200
[4] ON THE CONVERGENCE OF THE PROXIMAL POINT ALGORITHM FOR CONVEX MINIMIZATION
GULER, O
[J]. SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1991, 29 (02) : 403 - 419
[5] An Accelerated Inexact Proximal Point Algorithm for Convex Minimization
He, Bingsheng
Yuan, Xiaoming
[J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2012, 154 (02) : 536 - 548
[6] An Accelerated Inexact Proximal Point Algorithm for Convex Minimization
Bingsheng He
Xiaoming Yuan
[J]. Journal of Optimization Theory and Applications, 2012, 154 : 536 - 548
[7] The Proximal Alternating Minimization Algorithm for Two-Block Separable Convex Optimization Problems with Linear Constraints
Sandy Bitterlich
Radu Ioan Boţ
Ernö Robert Csetnek
Gert Wanka
[J]. Journal of Optimization Theory and Applications, 2019, 182 : 110 - 132
[8] The Proximal Alternating Minimization Algorithm for Two-Block Separable Convex Optimization Problems with Linear Constraints
Bitterlich, Sandy
Bot, Radu Ioan
Csetnek, Ernoe Robert
Wanka, Gert
[J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2019, 182 (01) : 110 - 132
[9] On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective
Ma, Feng
[J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2019, 73 (03) : 871 - 901
[10] On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective
Feng Ma
[J]. Computational Optimization and Applications, 2019, 73 : 871 - 901

← 1 2 3 4 5 →