Two convergent primal-dual hybrid gradient type methods for convex programming with linear constraints

DOI10.1007/S41980-023-00778-4MaRDI QIDQ6100752zbMATH OpenOpenAlexFDO

Authors M. Sun, Jing Liu, Maoying Tian

Publication date 22 June 2023

Published in Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s41980-023-00778-4

zbMATH Keywords

global convergenceconvergence rateconvex programmingprimal-dual hybrid gradient method

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Recommendations

• On the convergence of primal-dual hybrid gradient algorithm
• A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
• Acceleration and global convergence of a first-order primal-dual method for nonconvex problems
• On the convergence of stochastic primal-dual hybrid gradient
• Precompact convergence of the nonconvex primal-dual hybrid gradient algorithm

Cites work

• scientific article; zbMATH DE number 6270284 (Why is no real title available?)
• A class of customized proximal point algorithms for linearly constrained convex optimization
• A customized proximal point algorithm for convex minimization with linear constraints
• A first-order primal-dual algorithm for convex problems with applications to imaging
• A prediction-correction-based primal-dual hybrid gradient method for linearly constrained convex minimization
• Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
• Convex Analysis
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• From the projection and contraction methods for variational inequalities to the splitting contraction methods for convex optimization
• Improved Lagrangian-PPA based prediction correction method for linearly constrained convex optimization
• On convergence of the Arrow-Hurwicz method for saddle point problems
• On the \(O(1/t)\) convergence rate of the parallel descent-like method and parallel splitting augmented Lagrangian method for solving a class of variational inequalities
• On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators
• PPA-like contraction methods for convex optimization: a framework using variational inequality approach
• Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities

Cited in

(2)

• Constrained ?-subgradient method for simultaneous solution of the primal and dual problems of convex programming
• A new prediction-correction primal-dual hybrid gradient algorithm for solving convex minimization problems with Linear constraints

This page was built for publication: Two convergent primal-dual hybrid gradient type methods for convex programming with linear constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6100752)