A splitting primal-dual proximity algorithm for solving composite optimization problems
From MaRDI portal
Publication:2404000
DOI10.1007/s10114-016-5625-xzbMath1370.90181arXiv1507.08413OpenAlexW2249860883MaRDI QIDQ2404000
Meng Wen, Ji-Gen Peng, Chuan-Xi Zhu, Yu-Chao Tang
Publication date: 12 September 2017
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.08413
Related Items (6)
Preconditioned three-operator splitting algorithm with applications to image restoration ⋮ Primal-dual fixed point algorithm based on adapted metric method for solving convex minimization problem with application ⋮ An inertial primal‐dual fixed point algorithm for composite optimization problems ⋮ Solving monotone inclusions involving the sum of three maximally monotone operators and a cocoercive operator with applications ⋮ Efficient primal-dual fixed point algorithms with dynamic stepsize for composite convex optimization problems ⋮ Preconditioned Douglas-Rachford type primal-dual method for solving composite monotone inclusion problems with applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Nonlinear total variation based noise removal algorithms
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- Operator splittings, Bregman methods and frame shrinkage in image processing
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- A unified primal-dual algorithm framework based on Bregman iteration
- A modification of the Arrow-Hurwicz method for search of saddle points
- A first-order primal-dual algorithm for convex problems with applications to imaging
- AIR tools -- a MATLAB package of algebraic iterative reconstruction methods
- Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
- The Split Bregman Method for L1-Regularized Problems
- A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
This page was built for publication: A splitting primal-dual proximity algorithm for solving composite optimization problems