Convergence rate analysis of the multiplicative gradient method for PET-type problems
From MaRDI portal
Publication:6161276
DOI10.1016/j.orl.2022.11.010zbMath1525.90404arXiv2109.05601MaRDI QIDQ6161276
Publication date: 27 June 2023
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.05601
Cites Work
- Smooth minimization of non-smooth functions
- Barrier subgradient method
- Introductory lectures on convex optimization. A basic course.
- A Mathematical View of Interior-Point Methods in Convex Optimization
- The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography
- An algorithm for maximizing expected log investment return
- On the Second-Order Feasibility Cone: Primal-Dual Representation and Efficient Projection
- On the computation of rate-distortion functions (Corresp.)
- Relatively Smooth Convex Optimization by First-Order Methods, and Applications
- Rounding of Polytopes in the Real Number Model of Computation
- A Statistical Model for Positron Emission Tomography
- An algorithm for computing the capacity of arbitrary discrete memoryless channels
- Computation of channel capacity and rate-distortion functions
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Convergence rate analysis of the multiplicative gradient method for PET-type problems