arXiv:2502.06399v3 Announce Type: replace-cross Abstract: We study the computation of the Petz-Augustin mean of order $\alpha \in (0,1) \cup (1,\infty)$, defined as the minimizer of a weighted sum of $n$ Petz-R\'enyi divergences of order $\alpha$ over the set of $d$-by-$d$ quantum states, where the Petz-R\'enyi divergence is a quantum generalization of the classical R\'enyi divergence. We propose the first algorithm with a non-asymptotic convergence guarantee for solving this optimization problem. The iterates are guaranteed to converge to the Petz-Augustin mean at a linear rate of $O\left( \lvert 1 - 1/\alpha \rvert^T \right)$ with respect to the Thompson metric for $\alpha\in(1/2,1)\cup(1,\infty)$, where $T$ denotes the number of iterations. The algorithm has an initialization time complexity of $O\left(nd^3\right)$ and a per-iteration time complexity of $O\left(nd^2 + d^3\right)$. Two applications follow. The first application concerns the Petz-Augustin capacity of order $\alpha\in(1/2,1)$, which generalizes the quantum channel capacity and characterizes the optimal error exponent in classical-quantum channel coding. To compute this quantity, we propose the first iterative method with a non-asymptotic convergence guarantee, which uses our algorithm for computing the Petz-Augustin mean as a subroutine. The second application concerns the equilibrium prices in Fisher markets with constant elasticity of substitution (CES) utilities. We establish that when all buyers have CES utilities of common elasticity, the equilibrium prices are equivalent to the Petz-Augustin mean when all quantum states commute. In this case, our proposed algorithm is a t\^{a}tonnement process \`{a} la Walras. We further extend the algorithm to inhomogeneous Fisher markets, where buyers have CES utilities with different elasticities, and prove a faster convergence rate than existing t\^{a}tonnement-type algorithms.