An inertial primal‐dual fixed point algorithm for composite optimization problems

DOI10.1002/MMA.8388MaRDI QIDQ6149155zbMATH OpenFDO

Authors M. Wen, Yu-Chao Tang, Angang Cui, Ji-Gen Peng

Publication date 4 March 2024

Published in Mathematical Methods in the Applied Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1604.05299

zbMATH Keywords

composite optimizationinertial algorithmoperator splittingproximity operator

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Abstract: We consider an inertial primal-dual fixed point algorithm (IPDFP) to compute the minimizations of the following Problem (1.1). This is a full splitting approach, in the sense that the nonsmooth functions are processed individually via their proximity operators. The convergence of the IPDFP is obtained by reformulating the Problem (1.1) to the sum of three convex functions. This work brings together and notably extends several classical splitting schemes, like the primaldual method proposed by Chambolle and Pock, and the recent proximity algorithms of Charles A. et al designed for the L1/TV image denoising model. The iterative algorithm is used for solving nondifferentiable convex optimization problems arising in image processing. The experimental results indicate that the proposed IPDFP iterative algorithm performs well with respect to state-of-the-art methods.

Cites work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A first-order primal-dual algorithm for convex problems with applications to imaging
• A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
• A primal-dual method of partial inverses for composite inclusions
• A primal-dual splitting algorithm for finding zeros of sums of maximal monotone operators
• A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
• A splitting primal-dual proximity algorithm for solving composite optimization problems
• A unified primal-dual algorithm framework based on Bregman iteration
• An inertial forward-backward algorithm for monotone inclusions
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Convex analysis and monotone operator theory in Hilbert spaces
• Data-driven nonsmooth optimization
• Denoising with higher order derivatives of bounded variation and an application to parameter estimation
• Fourth-order partial differential equations for noise removal
• High-Order Total Variation-Based Image Restoration
• scientific article; zbMATH DE number 3192366 (Why is no real title available?)
• Image recovery via total variation minimization and related problems
• Improved total variation-type regularization using higher order edge detectors
• Inertial Douglas-Rachford splitting for monotone inclusion problems
• Introductory lectures on convex optimization. A basic course.
• Iterative image restoration combining total variation minimization and a second-order functional
• On the Minimizing Property of a Second Order Dissipative System in Hilbert Spaces
• Proximity algorithms for the L1/TV image denoising model
• Solving coupled composite monotone inclusions by successive Fejér approximations of their Kuhn-Tucker set
• Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
• Weak convergence of an extended splitting method for monotone inclusions

This page was built for publication: An inertial primal‐dual fixed point algorithm for composite optimization problems

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