Pages that link to "Item:Q2405497"

The following pages link to Forward-backward splitting with Bregman distances (Q2405497):

Displaying 27 items.

• A simplified view of first order methods for optimization (Q1650767) (← links)
• Monotone operator theory in convex optimization (Q1650774) (← links)
• Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute'' gradient for structured convex optimization (Q2020608) (← links)
• Quartic first-order methods for low-rank minimization (Q2031993) (← links)
• The forward-backward splitting method and its convergence rate for the minimization of the sum of two functions in Banach spaces (Q2037899) (← links)
• A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization (Q2046565) (← links)
• Bregman forward-backward operator splitting (Q2047252) (← links)
• On the nonexpansive operators based on arbitrary metric: a degenerate analysis (Q2093074) (← links)
• Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity (Q2302825) (← links)
• A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption (Q2322358) (← links)
• On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity (Q2322369) (← links)
• Non-smooth non-convex Bregman minimization: unification and new algorithms (Q2420780) (← links)
• Perturbed Fenchel duality and first-order methods (Q2687051) (← links)
• Resolvent of the parallel composition and the proximity operator of the infimal postcomposition (Q2688920) (← links)
• Regularizing with Bregman--Moreau Envelopes (Q4561226) (← links)
• First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems (Q4577742) (← links)
• Re-examination of Bregman functions and new properties of their divergences (Q4613995) (← links)
• A Nonlinearly Preconditioned Forward-Backward Splitting Method and Applications (Q5069192) (← links)
• Contracting Proximal Methods for Smooth Convex Optimization (Q5139832) (← links)
• Adaptive FISTA for Nonconvex Optimization (Q5235485) (← links)
• A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima (Q5853567) (← links)
• Dual Space Preconditioning for Gradient Descent (Q5857297) (← links)
• Affine Invariant Convergence Rates of the Conditional Gradient Method (Q6076864) (← links)
• No-regret algorithms in on-line learning, games and convex optimization (Q6120936) (← links)
• Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability (Q6161546) (← links)
• First-order methods for convex optimization (Q6169988) (← links)
• Convergence Analysis for Bregman Iterations in Minimizing a Class of Landau Free Energy Functionals (Q6194524) (← links)