Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
From MaRDI portal
Publication:2912264
DOI10.1137/100814494zbMATH Open1250.90066OpenAlexW2021548137MaRDI QIDQ2912264FDOQ2912264
Authors: Bingsheng He, Xiaoming Yuan 
Publication date: 14 September 2012
Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/100814494
Recommendations
- A new primal-dual algorithm for solving saddle-point problems
- A refined primal-dual algorithm for a saddle-point problem with applications to imaging
- On the convergence of primal-dual hybrid gradient algorithms for total variation image restoration
- Convergence analysis for a primal-dual monotone + skew splitting algorithm with applications to total variation minimization
- A double extrapolation primal-dual algorithm for saddle point problems
total variationimage restorationproximal point algorithmsaddle-point problemprimal-dual methodcontraction method
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Numerical solution to inverse problems in abstract spaces (65J22)
Cited In (only showing first 100 items - show all)
- Compressive Sensing
- The saddle point problem of polynomials
- Primal-dual hybrid gradient method for distributionally robust optimization problems
- PPA-like contraction methods for convex optimization: a framework using variational inequality approach
- A preconditioning technique for first-order primal-dual splitting method in convex optimization
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- Bregman three-operator splitting methods
- Primal-dual splitting method for high-order model with application to image restoration
- A parallel method for earth mover's distance
- The auxiliary problem principle with self-adaptive penalty parameter for multi-area economic dispatch problem
- A primal-dual multiplier method for total variation image restoration
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- A primal-dual flow for affine constrained convex optimization
- A parallel splitting ALM-based algorithm for separable convex programming
- A class of customized proximal point algorithms for linearly constrained convex optimization
- Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators
- Diffusion tensor imaging with deterministic error bounds
- A projected primal-dual method for solving constrained monotone inclusions
- A Convex Approach for Image Restoration with Exact Poisson--Gaussian Likelihood
- Higher-order total variation approaches and generalisations
- On the linear convergence of the general first order primal-dual algorithm
- A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems
- A primal-dual prediction-correction algorithm for saddle point optimization
- Alternating Direction Method of Multipliers for Linear Inverse Problems
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- Block-proximal methods with spatially adapted acceleration
- On the ergodic convergence rates of a first-order primal-dual algorithm
- A golden ratio primal-dual algorithm for structured convex optimization
- Resolvent splitting for sums of monotone operators with minimal lifting
- Unbalanced and partial \(L_1\) Monge-Kantorovich problem: a scalable parallel first-order method
- A new implementable prediction-correction method for monotone variational inequalities with separable structure
- ADMM for monotone operators: convergence analysis and rates
- Convergence Rate Analysis of Primal-Dual Splitting Schemes
- An inertial forward-backward algorithm for monotone inclusions
- A modified Chambolle-Pock primal-dual algorithm for Poisson noise removal
- Convergence analysis of primal-dual based methods for total variation minimization with finite element approximation
- A customized proximal point algorithm for convex minimization with linear constraints
- Alternating split Bregman method for the bilaterally constrained image deblurring problem
- An extended primal-dual algorithm framework for nonconvex problems: application to image reconstruction in spectral CT
- A Distributed ADMM-like Method for Resource Sharing over Time-Varying Networks
- An efficient primal dual prox method for non-smooth optimization
- Easily Parallelizable and Distributable Class of Algorithms for Structured Sparsity, with Optimal Acceleration
- A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization
- Multi-step fixed-point proximity algorithms for solving a class of optimization problems arising from image processing
- A primal-dual algorithm framework for convex saddle-point optimization
- Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization
- Fractional-order total variation image restoration based on primal-dual algorithm
- Partial Smoothness and Constant Rank
- The Moreau envelope approach for the L1/TV image denoising model
- Forward-Backward-Half Forward Algorithm for Solving Monotone Inclusions
- The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector
- Wavelet inpainting by fractional order total variation
- Regularisation, optimisation, subregularity
- A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions
- Degenerate Preconditioned Proximal Point Algorithms
- Total Variation Regularization Strategies in Full-Waveform Inversion
- A First-Order Primal-Dual Algorithm with Linesearch
- Vector and Matrix Optimal Mass Transport: Theory, Algorithm, and Applications
- A proximal point algorithm with asymmetric linear term
- Convergence analysis of an inexact three-operator splitting algorithm
- Data-Driven Nonsmooth Optimization
- Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery
- An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems
- Acceleration of the PDHGM on partially strongly convex functions
- Convergence analysis of a variable metric forward-backward splitting algorithm with applications
- Solving inverse problems using data-driven models
- A 2D diffeomorphic image registration model with inequality constraint
- A fast proximal point algorithm for \(\ell_{1}\)-minimization problem in compressed sensing
- Proximal Activation of Smooth Functions in Splitting Algorithms for Convex Image Recovery
- Monotone operator theory in convex optimization
- An improved first-order primal-dual algorithm with a new correction step
- An Accelerated Linearized Alternating Direction Method of Multipliers
- Convergent non-overlapping domain decomposition methods for variational image segmentation
- Local linear convergence analysis of Primal–Dual splitting methods
- A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates
- On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective
- Generalized variational framework with minimax optimization for parametric blind deconvolution
- A relaxed parameter condition for the primal-dual hybrid gradient method for saddle-point problem
- Robust optimization in power systems: a tutorial overview
- GRPDA revisited: relaxed condition and connection to Chambolle-Pock's primal-dual algorithm
- On convergence of the Arrow-Hurwicz method for saddle point problems
- Acceleration of primal-dual methods by preconditioning and simple subproblem procedures
- On the Convergence of Stochastic Primal-Dual Hybrid Gradient
- A Peaceman-Rachford splitting method with monotone plus skew-symmetric splitting for nonlinear saddle point problems
- Image restoration based on the minimized surface regularization
- An accelerated primal-dual iterative scheme for the L 2 -TV regularized model of linear inverse problems
- A double extrapolation primal-dual algorithm for saddle point problems
- RECENT ADVANCES IN DOMAIN DECOMPOSITION METHODS FOR TOTAL VARIATION MINIMIZATION
- Linearly convergent bilevel optimization with single-step inner methods
- Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis
- Local saddle points for unconstrained polynomial optimization
- Understanding the convergence of the preconditioned PDHG method: a view of indefinite proximal ADMM
- A splitting primal-dual proximity algorithm for solving composite optimization problems
- Non-stationary Douglas-Rachford and alternating direction method of multipliers: adaptive step-sizes and convergence
- Approximate first-order primal-dual algorithms for saddle point problems
- A new prediction-correction primal-dual hybrid gradient algorithm for solving convex minimization problems with Linear constraints
- The geometry of monotone operator splitting methods
- Some extensions of the operator splitting schemes based on Lagrangian and primal–dual: a unified proximal point analysis
- Unified linear convergence of first-order primal-dual algorithms for saddle point problems
- A nonsmooth primal-dual method with interwoven PDE constraint solver
This page was built for publication: Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912264)
