A primal-dual fixed point algorithm based on proximity operator for convex set constrained separable problems

MaRDI QIDQ5166152zbMATH OpenFDO

Authors Peijun Chen, Xiaoqun Zhang, Jianguo Huang

Publication date 30 June 2014

zbMATH Keywords

convex separable minimizationproximity operatorfixed point algorithmconvex constraint

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Recommendations

• A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
• Algorithm based on primal-dual splitting method for solving a class of constrained separable convex optimization problem and its application
• Two-step fixed-point proximity algorithms for multi-block separable convex problems
• A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions
• Efficient primal-dual fixed point algorithms with dynamic stepsize for composite convex optimization problems

Cited in

(5)

• Efficient primal-dual fixed point algorithms with dynamic stepsize for composite convex optimization problems
• Finding Dantzig selectors with a proximity operator based fixed-point algorithm
• A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions
• A splitting primal-dual proximity algorithm for solving composite optimization problems
• Algorithm based on primal-dual splitting method for solving a class of constrained separable convex optimization problem and its application

This page was built for publication: A primal-dual fixed point algorithm based on proximity operator for convex set constrained separable problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166152)