Theoretical aspect of diagonal Bregman proximal methods

DOI10.1155/2020/3108056zbMath1442.90144OpenAlexW2999309645WikidataQ126335454 ScholiaQ126335454MaRDI QIDQ2176024

S. Kabbadj

Publication date: 30 April 2020

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/3108056

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

Inexact version of Bregman proximal gradient algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence of a proximal point algorithm for solving minimization problems
• Penalty-proximal methods in convex programming
• Penalization in non-classical convex programming via variational convergence
• Smoothing approximation to the square-order exact penalty functions for constrained optimization
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Limiting behaviour of the approximate first order and second order directional derivatives for a convex function
• Monotone Operators and the Proximal Point Algorithm
• Perturbation des méthodes d'optimisation. Applications
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Numerical methods for nondifferentiable convex optimization
• Proximité et dualité dans un espace hilbertien