Silvio Fanzon
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Silvio Fanzon has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Kristian Bredies
Department of Mathematics and Scientific Computing, University of Graz
9 shared publications - Marcello Carioni
Department of Applied Mathematics University of Twente Enschede The Netherlands
7 shared publications - Francisco Romero
Institute of Mathematics and Scientific Computing, University of Graz, Graz, Austria
4 shared publications - Marcello Ponsiglione
Dipartimento di Matematica “Guido Castelnuovo”, SAPIENZA Università di Roma, Roma, Italy
3 shared publications - Daniel Walter
Institute of Numerical Mathematics, Johannes Kepler University Linz, 4040 Linz, Austria
2 shared publications John Fry
Department of Mathematics, University of Hull, Hull, UK
2 shared publications
Latest Publications
- 6 December 2024
- Published by Emerald Publishing in Managerial Finance
- Vol. 51 (7) , 1206-1216
Elementary econometric and strategic analysis of curling matches
Purpose: We develop a Markov model of curling matches. This enables strategic and econometric analyses to be performed alongside computer simulation work.Design/methodology/approach: We develop a Markov model of curling matches, parametrised by the probability of winning an end and the probability distribution of scoring ends. In practical applications, these end-winning probabilities can be estimated econometrically and are shown to depend on which team holds the hammer as well as the offensive and defensive strengths of the respective teams. Using a maximum entropy argument, based on the idea of characteristic scoring patterns in curling, we predict that the points distribution of scoring ends should follow a constrained geometric distribution.Findings: We provide analytical results detailing when it is optimal to blank the end in preference to scoring one point and losing possession of the hammer. Statistical and simulation analysis of international curling matches is also performed.Originality/value: Our work adds to the theory and application of sports analytics, especially Markov models, and to the econometric and strategic analysis of curling matches.
- 6 December 2024
- Published by Emerald Publishing in Managerial Finance
- Vol. 51 (7) , 1206-1216
Elementary econometric and strategic analysis of curling matches
Purpose: We develop a Markov model of curling matches. This enables strategic and econometric analyses to be performed alongside computer simulation work.Design/methodology/approach: We develop a Markov model of curling matches, parametrised by the probability of winning an end and the probability distribution of scoring ends. In practical applications, these end-winning probabilities can be estimated econometrically and are shown to depend on which team holds the hammer as well as the offensive and defensive strengths of the respective teams. Using a maximum entropy argument, based on the idea of characteristic scoring patterns in curling, we predict that the points distribution of scoring ends should follow a constrained geometric distribution.Findings: We provide analytical results detailing when it is optimal to blank the end in preference to scoring one point and losing possession of the hammer. Statistical and simulation analysis of international curling matches is also performed.Originality/value: Our work adds to the theory and application of sports analytics, especially Markov models, and to the econometric and strategic analysis of curling matches.
- Open Access
Faster identification of faster Formula 1 drivers via time-rank duality
Two natural ways of modelling Formula 1 race outcomes are a probabilistic approach, based on the exponential distribution, and econometric modelling of the ranks. Both approaches lead to exactly soluble race-winning probabilities. Equating race-winning probabilities leads to a set of equivalent parametrisations. This time-rank duality is attractive theoretically and leads to quicker ways of dis-entangling driver and car level effects.
Open AccessFaster identification of faster Formula 1 drivers via time-rank duality
Two natural ways of modelling Formula 1 race outcomes are a probabilistic approach, based on the exponential distribution, and econometric modelling of the ranks. Both approaches lead to exactly soluble race-winning probabilities. Equating race-winning probabilities leads to a set of equivalent parametrisations. This time-rank duality is attractive theoretically and leads to quicker ways of dis-entangling driver and car level effects.
- Open Access
- 22 March 2024
- Published by Elsevier in Economics Letters
- Vol. 237
Faster identification of faster Formula 1 drivers via time-rank duality
- 22 March 2024
- Published by Elsevier in Economics Letters
- Vol. 237
Open AccessFaster identification of faster Formula 1 drivers via time-rank duality
- Open Access
- 13 July 2023
- Published by Springer Nature in Mathematical Programming
- Vol. 205 (1-2) , 135-202
Asymptotic linear convergence of fully-corrective generalized conditional gradient methods
We proposea fully-corrective generalized conditional gradient method(FC-GCG) for the minimization of the sum of a smooth, convex loss function and a convex one-homogeneous regularizer over a Banach space. The algorithm relies on the mutual update of a finite set $$\mathcal {A}_k$$ of extremal points of the unit ball of the regularizer and of an iterate $$u_k \in {\text {cone}}(\mathcal {A}_k)$$ . Each iteration requires the solution of one linear problem to update $$\mathcal {A}_k$$ and of one finite dimensional convex minimization problem to update the iterate. Under standard hypotheses on the minimization problem we show that the algorithm converges sublinearly to a solution. Subsequently, imposing additional assumptions on the associated dual variables, this is improved to a linear rate of convergence. The proof of both results relies on two key observations: First, we prove the equivalence of the considered problem to the minimization of a lifted functional over a particular space of Radon measures using Choquet’s theorem. Second, the FC-GCG algorithm is connected to aPrimal-Dual-Active-Point methodon the lifted problem for which we finally derive the desired convergence rates.- 13 July 2023
- Published by Springer Nature in Mathematical Programming
- Vol. 205 (1-2) , 135-202
Open AccessAsymptotic linear convergence of fully-corrective generalized conditional gradient methods
We proposea fully-corrective generalized conditional gradient method(FC-GCG) for the minimization of the sum of a smooth, convex loss function and a convex one-homogeneous regularizer over a Banach space. The algorithm relies on the mutual update of a finite set $$\mathcal {A}_k$$ of extremal points of the unit ball of the regularizer and of an iterate $$u_k \in {\text {cone}}(\mathcal {A}_k)$$ . Each iteration requires the solution of one linear problem to update $$\mathcal {A}_k$$ and of one finite dimensional convex minimization problem to update the iterate. Under standard hypotheses on the minimization problem we show that the algorithm converges sublinearly to a solution. Subsequently, imposing additional assumptions on the associated dual variables, this is improved to a linear rate of convergence. The proof of both results relies on two key observations: First, we prove the equivalence of the considered problem to the minimization of a lifted functional over a particular space of Radon measures using Choquet’s theorem. Second, the FC-GCG algorithm is connected to aPrimal-Dual-Active-Point methodon the lifted problem for which we finally derive the desired convergence rates. - Open Access
Asymptotic linear convergence of fully-corrective generalized conditional gradient methods
We propose a fully-corrective generalized conditional gradient method (FC-GCG) for the minimization of the sum of a smooth, convex loss function and a convex one-homogeneous regularizer over a Banach space. The algorithm relies on the mutual update of a finite set $\mathcal{A}_k$ of extremal points of the unit ball of the regularizer and of an iterate $u_k \in \operatorname{cone}(\mathcal{A}_k)$. Each iteration requires the solution of one linear problem to update $\mathcal{A}_k$ and of one finite dimensional convex minimization problem to update the iterate. Under standard hypotheses on the minimization problem we show that the algorithm converges sublinearly to a solution. Subsequently, imposing additional assumptions on the associated dual variables, this is improved to a linear rate of convergence. The proof of both results relies on two key observations: First, we prove the equivalence of the considered problem to the minimization of a lifted functional over a particular space of Radon measures using Choquet's theorem. Second, the FC-GCG algorithm is connected to a Primal-Dual-Active-point Method (PDAP) on the lifted problem for which we finally derive the desired convergence rates.Open AccessAsymptotic linear convergence of fully-corrective generalized conditional gradient methods
We propose a fully-corrective generalized conditional gradient method (FC-GCG) for the minimization of the sum of a smooth, convex loss function and a convex one-homogeneous regularizer over a Banach space. The algorithm relies on the mutual update of a finite set $\mathcal{A}_k$ of extremal points of the unit ball of the regularizer and of an iterate $u_k \in \operatorname{cone}(\mathcal{A}_k)$. Each iteration requires the solution of one linear problem to update $\mathcal{A}_k$ and of one finite dimensional convex minimization problem to update the iterate. Under standard hypotheses on the minimization problem we show that the algorithm converges sublinearly to a solution. Subsequently, imposing additional assumptions on the associated dual variables, this is improved to a linear rate of convergence. The proof of both results relies on two key observations: First, we prove the equivalence of the considered problem to the minimization of a lifted functional over a particular space of Radon measures using Choquet's theorem. Second, the FC-GCG algorithm is connected to a Primal-Dual-Active-point Method (PDAP) on the lifted problem for which we finally derive the desired convergence rates. - Open Access
A superposition principle for the inhomogeneous continuity equation with Hellinger-Kantorovich-regular coefficients
We study measure-valued solutions of the inhomogeneous continuity equation $\partial_t \rho_t + {\rm div}(v\rho_t) = g \rho_t$ where the coefficients $v$ and $g$ are of low regularity. A new superposition principle is proven for positive measure solutions and coefficients for which the recently-introduced dynamic Hellinger-Kantorovich energy is finite. This principle gives a decomposition of the solution into curves $t \mapsto h(t)\delta_{\gamma(t)}$ that satisfy the characteristic system $\dot \gamma(t) = v(t, \gamma(t))$, $\dot h(t) = g(t, \gamma(t)) h(t)$ in an appropriate sense. In particular, it provides a generalization of existing superposition principles to the low-regularity case of $g$ where characteristics are not unique with respect to $h$. Two applications of this principle are presented. First, uniqueness of minimal total-variation solutions for the inhomogeneous continuity equation is obtained if characteristics are unique up to their possible vanishing time. Second, the extremal points of dynamic Hellinger-Kantorovich-type regularizers are characterized. Such regularizers arise, e.g., in the context of dynamic inverse problems and dynamic optimal transport.Open AccessA superposition principle for the inhomogeneous continuity equation with Hellinger-Kantorovich-regular coefficients
We study measure-valued solutions of the inhomogeneous continuity equation $\partial_t \rho_t + {\rm div}(v\rho_t) = g \rho_t$ where the coefficients $v$ and $g$ are of low regularity. A new superposition principle is proven for positive measure solutions and coefficients for which the recently-introduced dynamic Hellinger-Kantorovich energy is finite. This principle gives a decomposition of the solution into curves $t \mapsto h(t)\delta_{\gamma(t)}$ that satisfy the characteristic system $\dot \gamma(t) = v(t, \gamma(t))$, $\dot h(t) = g(t, \gamma(t)) h(t)$ in an appropriate sense. In particular, it provides a generalization of existing superposition principles to the low-regularity case of $g$ where characteristics are not unique with respect to $h$. Two applications of this principle are presented. First, uniqueness of minimal total-variation solutions for the inhomogeneous continuity equation is obtained if characteristics are unique up to their possible vanishing time. Second, the extremal points of dynamic Hellinger-Kantorovich-type regularizers are characterized. Such regularizers arise, e.g., in the context of dynamic inverse problems and dynamic optimal transport. - Open Access
- 30 March 2022
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 23 (3) , 833-898
A Generalized Conditional Gradient Method for Dynamic Inverse Problems with Optimal Transport Regularization
We develop a dynamic generalized conditional gradient method (DGCG) for dynamic inverse problems with optimal transport regularization. We consider the framework introduced in Bredies and Fanzon (ESAIM: M2AN 54:2351–2382, 2020), where the objective functional is comprised of a fidelity term, penalizing the pointwise in time discrepancy between the observation and the unknown in time-varying Hilbert spaces, and a regularizer keeping track of the dynamics, given by the Benamou–Brenier energy constrained via the homogeneous continuity equation. Employing the characterization of the extremal points of the Benamou–Brenier energy (Bredies et al. in Bull Lond Math Soc 53(5):1436–1452, 2021), we define theatomsof the problem as measures concentrated on absolutely continuous curves in the domain. We propose a dynamic generalization of a conditional gradient method that consists of iteratively adding suitably chosenatomsto the current sparse iterate, and subsequently optimizing the coefficients in the resulting linear combination. We prove that the method converges with a sublinear rate to a minimizer of the objective functional. Additionally, we propose heuristic strategies and acceleration steps that allow to implement the algorithm efficiently. Finally, we provide numerical examples that demonstrate the effectiveness of our algorithm and model in reconstructing heavily undersampled dynamic data, together with the presence of noise.
- 30 March 2022
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 23 (3) , 833-898
Open AccessA Generalized Conditional Gradient Method for Dynamic Inverse Problems with Optimal Transport Regularization
We develop a dynamic generalized conditional gradient method (DGCG) for dynamic inverse problems with optimal transport regularization. We consider the framework introduced in Bredies and Fanzon (ESAIM: M2AN 54:2351–2382, 2020), where the objective functional is comprised of a fidelity term, penalizing the pointwise in time discrepancy between the observation and the unknown in time-varying Hilbert spaces, and a regularizer keeping track of the dynamics, given by the Benamou–Brenier energy constrained via the homogeneous continuity equation. Employing the characterization of the extremal points of the Benamou–Brenier energy (Bredies et al. in Bull Lond Math Soc 53(5):1436–1452, 2021), we define theatomsof the problem as measures concentrated on absolutely continuous curves in the domain. We propose a dynamic generalization of a conditional gradient method that consists of iteratively adding suitably chosenatomsto the current sparse iterate, and subsequently optimizing the coefficients in the resulting linear combination. We prove that the method converges with a sublinear rate to a minimizer of the objective functional. Additionally, we propose heuristic strategies and acceleration steps that allow to implement the algorithm efficiently. Finally, we provide numerical examples that demonstrate the effectiveness of our algorithm and model in reconstructing heavily undersampled dynamic data, together with the presence of noise.
- Open Access
A generalized conditional gradient method for dynamic inverse problems with optimal transport regularization
We develop a dynamic generalized conditional gradient method (DGCG) for dynamic inverse problems with optimal transport regularization. We consider the framework introduced in (Bredies and Fanzon, ESAIM: M2AN, 54:2351-2382, 2020), where the objective functional is comprised of a fidelity term, penalizing the pointwise in time discrepancy between the observation and the unknown in time-varying Hilbert spaces, and a regularizer keeping track of the dynamics, given by the Benamou-Brenier energy constrained via the homogeneous continuity equation. Employing the characterization of the extremal points of the Benamou-Brenier energy (Bredies et al., arXiv:1907.11589, 2019) we define the atoms of the problem as measures concentrated on absolutely continuous curves in the domain. We propose a dynamic generalization of a conditional gradient method that consists in iteratively adding suitably chosen atoms to the current sparse iterate, and subsequently optimize the coefficients in the resulting linear combination. We prove that the method converges with a sublinear rate to a minimizer of the objective functional. Additionally, we propose heuristic strategies and acceleration steps that allow to implement the algorithm efficiently. Finally, we provide numerical examples that demonstrate the effectiveness of our algorithm and model at reconstructing heavily undersampled dynamic data, together with the presence of noise.
Open AccessA generalized conditional gradient method for dynamic inverse problems with optimal transport regularization
We develop a dynamic generalized conditional gradient method (DGCG) for dynamic inverse problems with optimal transport regularization. We consider the framework introduced in (Bredies and Fanzon, ESAIM: M2AN, 54:2351-2382, 2020), where the objective functional is comprised of a fidelity term, penalizing the pointwise in time discrepancy between the observation and the unknown in time-varying Hilbert spaces, and a regularizer keeping track of the dynamics, given by the Benamou-Brenier energy constrained via the homogeneous continuity equation. Employing the characterization of the extremal points of the Benamou-Brenier energy (Bredies et al., arXiv:1907.11589, 2019) we define the atoms of the problem as measures concentrated on absolutely continuous curves in the domain. We propose a dynamic generalization of a conditional gradient method that consists in iteratively adding suitably chosen atoms to the current sparse iterate, and subsequently optimize the coefficients in the resulting linear combination. We prove that the method converges with a sublinear rate to a minimizer of the objective functional. Additionally, we propose heuristic strategies and acceleration steps that allow to implement the algorithm efficiently. Finally, we provide numerical examples that demonstrate the effectiveness of our algorithm and model at reconstructing heavily undersampled dynamic data, together with the presence of noise.
- Open Access
- 26 June 2021
- Published by Wiley in Bulletin of the London Mathematical Society
- Vol. 53 (5) , 1436-1452
On the extremal points of the ball of the Benamou–Brenier energy
- 26 June 2021
- Published by Wiley in Bulletin of the London Mathematical Society
- Vol. 53 (5) , 1436-1452
Open AccessOn the extremal points of the ball of the Benamou–Brenier energy
- 16 November 2020
- Published by EDP Sciences in ESAIM: Mathematical Modelling and Numerical Analysis
- Vol. 54 (6) , 2351-2382
An optimal transport approach for solving dynamic inverse problems in spaces of measures
In this paper we propose and study a novel optimal transport based regularization of linear dynamic inverse problems. The considered inverse problems aim at recovering a measure valued curve and are dynamic in the sense that (i) the measured data takes values in a time dependent family of Hilbert spaces, and (ii) the forward operators are time dependent and map, for each time, Radon measures into the corresponding data space. The variational regularization we propose is based on dynamic (un-)balanced optimal transport which means that the measure valued curves to recover (i) satisfy the continuity equation,i.e., the Radon measure at timetis advected by a velocity fieldvand varies with a growth rateg, and (ii) are penalized with the kinetic energy induced byvand a growth energy induced byg. We establish a functional-analytic framework for these regularized inverse problems, prove that minimizers exist and are unique in some cases, and study regularization properties. This framework is applied to dynamic image reconstruction in undersampled magnetic resonance imaging (MRI), modelling relevant examples of time varying acquisition strategies, as well as patient motion and presence of contrast agents.
- 16 November 2020
- Published by EDP Sciences in ESAIM: Mathematical Modelling and Numerical Analysis
- Vol. 54 (6) , 2351-2382
An optimal transport approach for solving dynamic inverse problems in spaces of measures
In this paper we propose and study a novel optimal transport based regularization of linear dynamic inverse problems. The considered inverse problems aim at recovering a measure valued curve and are dynamic in the sense that (i) the measured data takes values in a time dependent family of Hilbert spaces, and (ii) the forward operators are time dependent and map, for each time, Radon measures into the corresponding data space. The variational regularization we propose is based on dynamic (un-)balanced optimal transport which means that the measure valued curves to recover (i) satisfy the continuity equation,i.e., the Radon measure at timetis advected by a velocity fieldvand varies with a growth rateg, and (ii) are penalized with the kinetic energy induced byvand a growth energy induced byg. We establish a functional-analytic framework for these regularized inverse problems, prove that minimizers exist and are unique in some cases, and study regularization properties. This framework is applied to dynamic image reconstruction in undersampled magnetic resonance imaging (MRI), modelling relevant examples of time varying acquisition strategies, as well as patient motion and presence of contrast agents.