A dual Bregman proximal gradient method for relatively-strongly convex optimization

DOI10.3934/NACO.2021028zbMATH Open1497.90150OpenAlexW3184536587MaRDI QIDQ2092292FDOQ2092292

Xinwei Liu, Jin-Zan Liu

Publication date: 2 November 2022

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2021028

Recommendations

• scientific article; zbMATH DE number 1070393
• A fast dual proximal gradient algorithm for convex minimization and applications
• Dual convergence of the proximal point method with Bregman distances for linear programming
• Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
• On dual convergence of the generalized proximal point method with Bregman distances
• A dual regularized method for solving a class of convex minimization problems
• A bundle Bregman proximal method for convex nondifferentiable minimization
• Proximal Minimization Methods with Generalized Bregman Functions
• A dual split Bregman method for fast \(\ell ^{1}\) minimization
• A dual gradient-projection method for large-scale strictly convex quadratic problems

zbMATH Keywords

dual methodBregman distancerelative smoothnessrelatively strong convexity

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• First-Order Methods in Optimization
• Title not available (Why is that?)
• Optimum Designs in Regression Problems
• Image deblurring with Poisson data: from cells to galaxies
• A generalized proximal point algorithm for certain non-convex minimization problems
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Title not available (Why is that?)
• On the weak convergence of an ergodic iteration for the solution of variational inequalities for monotone operators in Hilbert space
• A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
• Joint and separate convexity of the Bregman distance.
• A fast dual proximal gradient algorithm for convex minimization and applications
• Relatively Smooth Convex Optimization by First-Order Methods, and Applications
• A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
• A simplified view of first order methods for optimization
• Accelerated Bregman proximal gradient methods for relatively smooth convex optimization

Cited In (2)

• On dual convergence of the generalized proximal point method with Bregman distances
• Choice of the parameters in a primal-dual algorithm for Bregman iterated variational regularization

This page was built for publication: A dual Bregman proximal gradient method for relatively-strongly convex optimization

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