A new primal-dual algorithm for minimizing the sum of three functions with a linear operator

From MaRDI portal
Publication:1785510

DOI10.1007/s10915-018-0680-3zbMath1415.65142arXiv1611.09805OpenAlexW2963496223WikidataQ130164913 ScholiaQ130164913MaRDI QIDQ1785510

Ming Yan

Publication date: 28 September 2018

Published in: Journal of Scientific Computing (Search for Journal in Brave)

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




Related Items

Reflected three-operator splitting method for monotone inclusion problemProportional-integral projected gradient method for conic optimizationA novel regularization based on the error function for sparse recoveryUnified linear convergence of first-order primal-dual algorithms for saddle point problemsPreconditioned three-operator splitting algorithm with applications to image restorationProximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New TwistsA partially inexact generalized primal-dual hybrid gradient method for saddle point problems with bilinear couplingsUniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splittingPrimal-dual fixed point algorithm based on adapted metric method for solving convex minimization problem with applicationInertial-relaxed splitting for composite monotone inclusionsLearning Regularization Parameter-Maps for Variational Image Reconstruction Using Deep Neural Networks and Algorithm UnrollingStructure Preserving Primal Dual Methods for Gradient Flows with Nonlinear Mobility Transport DistancesMulti-step inertial forward-backward-half forward algorithm for solving monotone inclusionThe operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysisBregman three-operator splitting methodsOperator Splitting Performance Estimation: Tight Contraction Factors and Optimal Parameter SelectionLower complexity bounds of first-order methods for convex-concave bilinear saddle-point problemsA first-order inexact primal-dual algorithm for a class of convex-concave saddle point problemsNew convergence analysis of a primal-dual algorithm with large stepsizesA second-order adaptive Douglas-Rachford dynamic method for maximal \(\alpha\)-monotone operatorsRegularization with multilevel non-stationary tight framelets for image restorationOn the equivalence of the primal-dual hybrid gradient method and Douglas-Rachford splittingNew convergence results for inertial Krasnoselskii-Mann iterations in Hilbert spaces with applicationsSparse group fused Lasso for model segmentation: a hybrid approachFinding the forward-Douglas-Rachford-forward methodNon-stationary First-Order Primal-Dual Algorithms with Faster Convergence RatesSolving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithmsBregman primal-dual first-order method and application to sparse semidefinite programmingDualize, split, randomize: toward fast nonsmooth optimization algorithmsAlgorithmic versatility of SPF-regularization methodsApproximate first-order primal-dual algorithms for saddle point problemsData-driven gradient flowsAn inertial semi-forward-reflected-backward splitting and its application


Uses Software


Cites Work