Bregman proximal gradient method for linear optimization under entropic constraints
From MaRDI portal
Cites work
- A Bregman proximal perspective on classical and quantum Blahut-Arimoto algorithms
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- A Mathematical Theory of Communication
- A simplified view of first order methods for optimization
- An algorithm for computing the capacity of arbitrary discrete memoryless channels
- Bregman Divergence Based Em Algorithm and its Application to Classical and Quantum Rate Distortion Theory
- Bregman-divergence-based Arimoto-Blahut algorithm
- Computation of channel capacity and rate-distortion functions
- Constrained Information Design
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Convex analysis and monotone operator theory in Hilbert spaces
- Coordination Capacity
- Elements of Information Theory
- Empirical Distributions of Beliefs Under Imperfect Observation
- Entropy in linear programs
- First-order methods in optimization
- Geometric Programming Duals of Channel Capacity and Rate Distortion
- How to play with a biased coin?
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- Information theory. Coding theorems for discrete memoryless systems
- Informationally optimal correlation
- Joint Empirical Coordination of Source and Channel
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- On the computation of rate-distortion functions (Corresp.)
- Optimal Use of Communication Resources
- Persuasion with limited communication capacity
- Proximity Operators of Discrete Information Divergences
- Relative entropy optimization and its applications
- Relatively smooth convex optimization by first-order methods, and applications
- Repeated games with bounded entropy
- Reverse EM-problem based on Bregman divergence and its application to classical and quantum information theory
- Secret Correlation in Repeated Games with Imperfect Monitoring
- Strategic entropy and complexity in repeated games
- The role of duality in optimization problems involving entropy functionals with applications to information theory
This page was built for publication: Bregman proximal gradient method for linear optimization under entropic constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7254697)
