A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems
From MaRDI portal
Publication:2234476
DOI10.1007/S11075-021-01069-XzbMATH Open1478.90088OpenAlexW3136016287MaRDI QIDQ2234476FDOQ2234476
Authors: Fan Jiang, Zhongming Wu, Hongchao Zhang, Xing-Ju Cai 
Publication date: 19 October 2021
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-021-01069-x
Recommendations
- Approximate first-order primal-dual algorithms for saddle point problems
- Unified linear convergence of first-order primal-dual algorithms for saddle point problems
- A primal-dual algorithm framework for convex saddle-point optimization
- Inexact first-order primal-dual algorithms
- Primal-dual first-order methods for a class of cone programming
- A primal-dual algorithm with line search for general convex-concave saddle point problems
- Optimal primal-dual methods for a class of saddle point problems
- Primal-Dual First-Order Methods for Affinely Constrained Multi-block Saddle Point Problems
- A generalized primal-dual algorithm with improved convergence condition for saddle point problems
- An implementable first-order primal-dual algorithm for structured convex optimization
convex optimizationsaddle point problemslinear convergenceinexactfirst-order primal-dual algorithmnonergodic convergence
Convex programming (90C25) Minimax problems in mathematical programming (90C47) Numerical methods for variational inequalities and related problems (65K15)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Nonlinear total variation based noise removal algorithms
- Variational Analysis
- 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
- Implicit Functions and Solution Mappings
- Some continuity properties of polyhedral multifunctions
- Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- Title not available (Why is that?)
- The cosparse analysis model and algorithms
- A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions
- A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
- A reduced Newton method for constrained linear least-squares problems
- On the ergodic convergence rates of a first-order primal-dual algorithm
- A three-operator splitting scheme and its optimization applications
- Inexact first-order primal-dual algorithms
- An improved first-order primal-dual algorithm with a new correction step
- A first-order primal-dual algorithm with linesearch
- Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
- Smoothing and Decomposition for Analysis Sparse Recovery
- Approximate ADMM algorithms derived from Lagrangian splitting
- Precompact convergence of the nonconvex primal-dual hybrid gradient algorithm
- The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings
- An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems
- On inexact ADMMs with relative error criteria
- A new primal-dual algorithm for minimizing the sum of three functions with a linear operator
- Approximate first-order primal-dual algorithms for saddle point problems
Cited In (15)
- A preconditioning technique for first-order primal-dual splitting method in convex optimization
- Understanding the convergence of the preconditioned PDHG method: a view of indefinite proximal ADMM
- A primal-dual algorithm with line search for general convex-concave saddle point problems
- Approximate first-order primal-dual algorithms for saddle point problems
- Unified linear convergence of first-order primal-dual algorithms for saddle point problems
- Inexact first-order primal-dual algorithms
- Non-ergodic convergence rate of an inertial accelerated primal-dual algorithm for saddle point problems
- A primal-dual algorithm framework for convex saddle-point optimization
- A partially inexact generalized primal-dual hybrid gradient method for saddle point problems with bilinear couplings
- A New Insight on Augmented Lagrangian Method with Applications in Machine Learning
- General Inexact Primal-Dual Hybrid Gradient Methods for Saddle-Point Problems and Convergence Analysis
- Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes
- Primal-Dual First-Order Methods for Affinely Constrained Multi-block Saddle Point Problems
- An improved first-order primal-dual algorithm with a new correction step
- Inexact asymmetric forward-backward-adjoint splitting algorithms for saddle point problems
This page was built for publication: A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2234476)
