A first-order primal-dual algorithm with linesearch
From MaRDI portal
Abstract: The paper proposes a linesearch for a primal-dual method. Each iteration of the linesearch requires to update only the dual (or primal) variable. For many problems, in particular for regularized least squares, the linesearch does not require any additional matrix-vector multiplications. We prove convergence of the proposed method under standard assumptions. We also show an ergodic rate of convergence for our method. In case one or both of the prox-functions are strongly convex, we modify our basic method to get a better convergence rate. Finally, we propose a linesearch for a saddle point problem with an additional smooth term. Several numerical experiments confirm the efficiency of our proposed methods.
Recommendations
- On the linear convergence of the general first order primal-dual algorithm
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Unified linear convergence of first-order primal-dual algorithms for saddle point problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- An introduction to continuous optimization for imaging
- Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
- Convex analysis and monotone operator theory in Hilbert spaces
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Projected reflected gradient methods for monotone variational inequalities
- Proximal extrapolated gradient methods for variational inequalities
- Sparse Reconstruction by Separable Approximation
Cited in
(79)- On the proximal gradient algorithm with alternated inertia
- Variable sample-size operator extrapolation algorithm for stochastic mixed variational inequalities
- A balanced augmented Lagrangian method with correction for linearly constrained optimization
- Golden ratio primal-dual algorithm with linesearch
- GRPDA revisited: relaxed condition and connection to Chambolle-Pock's primal-dual algorithm
- On convergence of the Arrow-Hurwicz method for saddle point problems
- On the geometry and refined rate of primal-dual hybrid gradient for linear programming
- New convergence analysis of a primal-dual algorithm with large stepsizes
- Accelerated Bregman Primal-Dual Methods Applied to Optimal Transport and Wasserstein Barycenter Problems
- Proximal alternating direction method of multipliers with convex combination proximal centers
- A nested primal-dual iterated Tikhonov method for regularized convex optimization
- Misfit function for full waveform inversion based on the Wasserstein metric with dynamic formulation
- Bregman three-operator splitting methods
- A smooth primal-dual optimization framework for nonsmooth composite convex minimization
- Convergence analysis of a new relaxed algorithm with inertial for solving split feasibility problems
- A generalized primal-dual algorithm with improved convergence condition for saddle point problems
- A preconditioned version of a nested primal-dual algorithm for image deblurring
- A double extrapolation primal-dual algorithm for saddle point problems
- An accelerated forward-backward-half forward splitting algorithm for monotone inclusion with applications to image restoration
- First-order methods for convex optimization
- An implementable first-order primal-dual algorithm for structured convex optimization
- An adaptive PDHG algorithm with relaxed stepsize condition for composite convex optimization
- Understanding the convergence of the preconditioned PDHG method: a view of indefinite proximal ADMM
- New inertial relaxed method for solving split feasibilities
- A symmetric version of the generalized Chambolle-Pock-He-Yuan method for saddle point problems
- A primal-dual algorithm with line search for general convex-concave saddle point problems
- Approximate first-order primal-dual algorithms for saddle point problems
- A projected primal-dual method for solving constrained monotone inclusions
- Algorithms and applications for split equality problem with related problems
- Stochastic primal-dual hybrid gradient algorithm with adaptive step sizes
- Unified linear convergence of first-order primal-dual algorithms for saddle point problems
- On the linear convergence of the general first order primal-dual algorithm
- Inexact first-order primal-dual algorithms
- Faster first-order primal-dual methods for linear programming using restarts and sharpness
- A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems
- Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists
- Preconditioned golden ratio primal-dual algorithm with linesearch
- Convergence rate of \(\mathcal{O}(1/k)\) for optimistic gradient and extragradient methods in smooth convex-concave saddle point problems
- Single-forward-step projective splitting: exploiting cocoercivity
- Primal-dual accelerated gradient methods with small-dimensional relaxation oracle
- Sparse approximations with interior point methods
- A golden ratio proximal alternating direction method of multipliers for separable convex optimization
- On the ergodic convergence rates of a first-order primal-dual algorithm
- A golden ratio primal-dual algorithm for structured convex optimization
- A phase model using the Huber norm for estimating point spread function under frozen flow hypothesis
- Convergence of a generalized primal-dual algorithm with an improved condition for saddle point problems
- A weighted difference of anisotropic and isotropic total variation for relaxed Mumford-Shah color and multiphase image segmentation
- A step-free primal-dual algorithm for solving bilinear saddle point problem
- Two general splitting methods with alternated inertia for solving split equality problem in Hilbert spaces
- ADMM for monotone operators: convergence analysis and rates
- A second order primal-dual dynamical system for a convex-concave bilinear saddle point problem
- The golden ratio primal-dual algorithm with two new stepsize rules for convex-concave saddle point problems
- A separate preconditioned primal-dual splitting algorithm for composite monotone inclusion problems
- Nonlinear preconditioned primal-dual method with projection for nonconvex-nonconcave minimax problems
- New primal-dual algorithm for convex-concave saddle point problems
- Non-ergodic convergence rate of an inertial accelerated primal-dual algorithm for saddle point problems
- Filtering-based preconditioner for accelerated high-dimensional cone-beam CT image reconstruction
- A partially inexact generalized primal-dual hybrid gradient method for saddle point problems with bilinear couplings
- Strong convergence of alternated inertial \(CQ\) relaxed method with application in signal recovery
- Bregman primal-dual first-order method and application to sparse semidefinite programming
- A decomposition approach on the base of Brownian iteration for the linear programming where all basis matrices are M-matrix
- A modified primal-dual algorithm for matrix completion problems
- Variable sample-size optimistic mirror descent algorithm for stochastic mixed variational inequalities
- Convergence analysis of new inertial method for the split common null point problem
- Double inertial parameters forward-backward splitting method: Applications to compressed sensing, image processing, and SCAD penalty problems
- A splitting preconditioned primal-dual algorithm with interpolation and extrapolation for bilinear saddle point problem
- Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates
- Global and linear convergence of alternated inertial methods for split feasibility problems
- A primal-dual splitting algorithm with convex combination and larger step sizes for composite monotone inclusion problems
- Projective splitting with forward steps
- A distributed primal-dual hybrid gradient algorithm for fair resource allocation
- Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems
- Alternated inertial subgradient extragradient method for equilibrium problems
- An alternative extrapolation scheme of PDHGM for saddle point problem with nonlinear function
- A view of computational models for image segmentation
- Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
- An improved first-order primal-dual algorithm with a new correction step
- ACQUIRE: an inexact iteratively reweighted norm approach for TV-based Poisson image restoration
- An alternated inertial general splitting method with linearization for the split feasibility problem
This page was built for publication: A first-order primal-dual algorithm with linesearch
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606652)
