Publication:2768007

From MaRDI portal
Revision as of 15:31, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


zbMath1160.65319MaRDI QIDQ2768007

Heinz H. Bauschke, Jonathan M. Borwein

Publication date: 9 April 2002



65K05: Numerical mathematical programming methods

90C25: Convex programming


Related Items

The Bregman Proximal Average, On the linear convergence of a Bregman proximal point algorithm, Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant, Chain Rule Optimal Transport, Unnamed Item, Existence and Approximation of Fixed Points of Right Bregman Nonexpansive Operators, A Spectral Estimation Framework for Phase Retrieval via Bregman Divergence Minimization, Distributed mirror descent algorithm over unbalanced digraphs based on gradient weighting technique, Dualities for Non-Euclidean Smoothness and Strong Convexity under the Light of Generalized Conjugacy, Geometry preserving multi-task metric learning, Compositions and convex combinations of Bregman weakly relatively nonexpansive operators in reflexive Banach spaces, Klee sets and Chebyshev centers for the right Bregman distance, Stochastic mirror descent method for distributed multi-agent optimization, Iterative regularization via dual diagonal descent, Duality for Bregman projections onto translated cones and affine subspaces., Steered sequential projections for the inconsistent convex feasibility problem, Alternating minimization as sequential unconstrained minimization: a survey, Accelerated Bregman proximal gradient methods for relatively smooth convex optimization, A dual Bregman proximal gradient method for relatively-strongly convex optimization, Matrix versions of the Hellinger distance, On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity, On the joint convexity of the Bregman divergence of matrices, Event-triggered distributed online convex optimization with delayed bandit feedback