Adaptive parallel primal-dual method for saddle point problems

DOI10.4208/NMTMA.2018.M1621MaRDI QIDQ4690831zbMATH OpenOpenAlexWikidataFDO

Authors Xiayang Zhang

Publication date 22 October 2018

Published in Numerical Mathematics: Theory, Methods and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4208/nmtma.2018.m1621

zbMATH Keywords

LASSOprimal-dual methodsaddle-point problem

Mathematics Subject Classification ID

Optimality conditions for minimax problems (49K35) Decomposition methods (49M27) Numerical mathematical programming methods (65K05) Convex programming (90C25)

Recommendations

• A relaxed parameter condition for the primal-dual hybrid gradient method for saddle-point problem
• A new primal-dual algorithm for solving saddle-point problems
• 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
• Optimal primal-dual methods for a class of saddle point problems

Cited in

(2)

• A relaxed parameter condition for the primal-dual hybrid gradient method for saddle-point problem
• Chambolle-Pock's primal-dual method with mismatched adjoint

This page was built for publication: Adaptive parallel primal-dual method for saddle point problems

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