Forward-backward splitting with Bregman distances
From MaRDI portal
Publication:2405497
DOI10.1007/s10013-016-0238-3zbMath1371.90106arXiv1505.05198OpenAlexW2962706047MaRDI QIDQ2405497
Publication date: 25 September 2017
Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.05198
Banach spaceBregman distanceLegendre functionforward-backward algorithmmultivariate minimizationvariable quasi-Bregman monotonicity
Related Items (29)
A simplified view of first order methods for optimization ⋮ Monotone operator theory in convex optimization ⋮ A Nonlinearly Preconditioned Forward-Backward Splitting Method and Applications ⋮ Regularizing with Bregman--Moreau Envelopes ⋮ First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems ⋮ Non-smooth non-convex Bregman minimization: unification and new algorithms ⋮ Affine Invariant Convergence Rates of the Conditional Gradient Method ⋮ A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity ⋮ A stochastic variance reduction algorithm with Bregman distances for structured composite problems ⋮ No-regret algorithms in on-line learning, games and convex optimization ⋮ Perturbed Fenchel duality and first-order methods ⋮ Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability ⋮ First-order methods for convex optimization ⋮ Resolvent of the parallel composition and the proximity operator of the infimal postcomposition ⋮ Convergence Analysis for Bregman Iterations in Minimizing a Class of Landau Free Energy Functionals ⋮ Re-examination of Bregman functions and new properties of their divergences ⋮ Contracting Proximal Methods for Smooth Convex Optimization ⋮ Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute gradient for structured convex optimization ⋮ Quartic first-order methods for low-rank minimization ⋮ The forward-backward splitting method and its convergence rate for the minimization of the sum of two functions in Banach spaces ⋮ A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization ⋮ Bregman forward-backward operator splitting ⋮ Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity ⋮ Adaptive FISTA for Nonconvex Optimization ⋮ A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption ⋮ On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity ⋮ A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima ⋮ On the nonexpansive operators based on arbitrary metric: a degenerate analysis ⋮ Dual Space Preconditioning for Gradient Descent
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Latent variable graphical model selection via convex optimization
- Variable quasi-Bregman monotone sequences
- Convex functions, monotone operators and differentiability.
- Variable metric quasi-Fejér monotonicity
- On the Lambert \(w\) function
- A forward–backward splitting algorithm for the minimization of non-smooth convex functionals in Banach space
- Image deblurring with Poisson data: from cells to galaxies
- Iterating Bregman Retractions
- Bregman Monotone Optimization Algorithms
- ESSENTIAL SMOOTHNESS, ESSENTIAL STRICT CONVEXITY, AND LEGENDRE FUNCTIONS IN BANACH SPACES
- Penalized maximum likelihood image restoration with positivity constraints: multiplicative algorithms
- Signal Recovery by Proximal Forward-Backward Splitting
- Relative loss bounds for multidimensional regression problems
This page was built for publication: Forward-backward splitting with Bregman distances
