A prediction-correction-based primal-dual hybrid gradient method for linearly constrained convex minimization

DOI10.1007/S11075-018-0618-8MaRDI QIDQ2274166zbMATH OpenOpenAlexFDO

Authors Feng Ma, Yiming Bi, Bin Gao

Publication date 19 September 2019

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11075-018-0618-8

zbMATH Keywords

convex minimizationlinear constraintsprediction-correction methodpdhg

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites work

• scientific article; zbMATH DE number 3309655 (Why is no real title available?)
• scientific article; zbMATH DE number 3341597 (Why is no real title available?)
• A Singular Value Thresholding Algorithm for Matrix Completion
• 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 general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
• A primal-dual prediction-correction algorithm for saddle point optimization
• A unified primal-dual algorithm framework based on Bregman iteration
• An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems
• An improved first-order primal-dual algorithm with a new correction step
• An introduction to continuous optimization for imaging
• Atomic decomposition by basis pursuit
• Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
• Exact matrix completion via convex optimization
• Fixed point and Bregman iterative methods for matrix rank minimization
• Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
• Monotone Operators and the Proximal Point Algorithm
• Multiplier and gradient methods
• Nonlinear total variation based noise removal algorithms
• On the convergence of primal-dual hybrid gradient algorithm
• On the convergence of primal-dual hybrid gradient algorithms for total variation image restoration
• On the ergodic convergence rates of a first-order primal-dual algorithm
• Optimal primal-dual methods for a class of saddle point problems
• Sparse image and signal processing. Wavelets, curvelets, morphological diversity

Cited in

(2)

• A new prediction-correction primal-dual hybrid gradient algorithm for solving convex minimization problems with Linear constraints
• Two convergent primal-dual hybrid gradient type methods for convex programming with linear constraints

Describes a project that uses

Uses Software

• PDCO

This page was built for publication: A prediction-correction-based primal-dual hybrid gradient method for linearly constrained convex minimization

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