SearcharxivSearch

arXiv subjects

Tuomo Valkonen

Publications and source records attributed to Tuomo Valkonen.

At least 19 recordsLinked to original sources

Primal-dual multigrid methods for nonsmooth optimization

In optimization, one often encounters problems of the form $\min_x F(x)+E(x)+G(Kx)$. In this work, we combine primal-dual algorithms with multigrid techniques for their solution. To link the the fine-grid and coarse-grid problems problems, we introduce a nonsmooth primal-dual coherence condition, and an efficient partially linearized line search procedure. Our work is motivated by total variation regularized inverse imaging problems, on which we demonstrate the efficacy of the method, being able to solve problems not previously possible with forward-backward multigrid methods.

math.OC

Point source localisation with unbalanced optimal transport

Replacing the quadratic proximal penalty familiar from Hilbert spaces by an unbalanced optimal transport distance, we develop forward-backward type optimisation methods in spaces of Radon measures. We avoid the actual computation of the optimal transport distances through the use of transport three-plans and the rough concept of transport subdifferentials. The resulting algorithm has a step similar to the sliding heuristics previously introduced for conditional gradient methods, however, now non-heuristically derived from the geometry of the space. We demonstrate the improved numerical performance of the approach.

math.OC

Single-loop approaches to nonsmooth bilevel optimisation

We study bilevel optimisation problems in which the inner problem is represented as a set-valued, parametric constraint. We develop relevant optimistic and pessimistic calculus rules, derive corresponding optimality conditions, and formulate nonsmooth adjoint inclusions based on both the Fréchet and limiting coderivatives. Founded on these results, we propose a single-loop algorithm that accommodates a wide range of inner and adjoint steps, including those of primal-dual methods. We prove its convergence. Numerical experiments on total variation regularised inverse problems demonstrate the practicality of the approach.

math.OC

Dynamic inverse problems: Single-loop online algorithms

We study efficient online methods for dynamic inverse problems with infinite time horizon. We concentrate, in particular, on problems whose forward model arises from a PDE. Our motivating application is flow monitoring with Electrical Impedance Tomography (EIT). The idea of such online methods is to take single steps of of standard optimisation algorithms, on each time index; each data frame. A predictor, based on problem dynamics, is used to transfer iterates one from time index to the next one. If we monitor a fast flow with a correspondingly fast measurement modality, such as EIT, basic methods are unable to solve the PDE before new data arrives. Our idea, then, is to not solve it, and instead, on each iteration, each time index, take single or few steps of standard iterative solvers towards the solution of both the PDE and an adjoint PDE. This is what ``single loop'' refers to. To the overall problem, we apply standard online optimisation methods, at the outside developed for exact gradients $\nabla E_k(x^k)$ of the iteration-dependent data fidelity $E_k$ that incorporates the PDE. We replace the gradient by a single-loop estimate $\tilde\grad E_k(x^k)$ that satisfies standard smoothness properties with summable errors. This allows standard regret proofs to go through. Our numerical experiments on dynamic EIT validate the theoretical predictions and highlight the potential of the proposed approach for the real-time solution of PDE-constrained dynamic inverse problems.

math.OC

Dynamic inverse problems: Online regularisation theory

We develop regularisation theory for dynamic inverse problems, solved using online methods with an infinite time horizon. Using concepts of subregularity to treat nonsmooth regularisers, we prove that time-averaged reconstruction errors converge to zero as noise, algorithmic errors, and regularisation vanish as the horizon grows. We illustrate the theory numerically with a dynamic electrical impedance tomography example.

math.NA

Leak localisation with a measure source convection-diffusion model

We study the inverse problem of locating gas leaks from line-of-sight concentration measurements using a convection-diffusion model with the source term a Radon measure. By imposing sparsity-promoting regularisation on this measure, we recover point sources - identifying both their locations and intensities - rather than diffuse approximations. We jointly estimate the underlying physical convection (wind) and diffusion parameters. Our main theoretical contribution is the stability analysis of the convection-diffusion equation with respect to its parameters: the measure, and the convection and diffusion fields. Numerically, we employ a semi-grid-free optimisation approach for reconstructing the source measure. Our experiments demonstrate accurate localisation, highlighting the potential of the method for practical gas emission detection.

math.AP

Introduction to Nonsmooth Analysis and Optimization

Functions that are not differentiable in the classical sense have become a central tool in modern mathematical models for imaging, inverse problems, machine learning, and optimal control of differential equations. These models are increasingly formulated in infinite-dimensional function spaces to be independent of problem size and discretization quality. This book presents a unified and rigorous introduction to the infinite-dimensional analysis and algorithmic solution of nonsmooth optimization problems arising from the above-mentioned models, from the necessary theoretical tools of nonsmooth analysis to state-of-the-art algorithms and their convergence and stability analysis.

math.OC

Well-posedness of nonlinear parabolic equations with unbounded drift via nonlinear evolution theory

We develop a nonlinear evolution framework for nonlinear parabolic equations with unbounded drift terms formulated in Lorentz spaces. The main contribution lies in the construction of uniformly m-accretive operators based on Lorentz-Sobolev embeddings, which allows us to apply the Crandall-Liggett generation theorem for nonlinear evolution equations. Within this framework, we establish existence, uniqueness, and stability of mild solutions. We further show that these mild solutions coincide with weak solutions, ensuring consistency with the variational formulation. Finally, we investigate the long-time asymptotic behavior of solutions.

math.AP

Forward-backward splitting in bilaterally bounded Alexandrov spaces

With the goal of solving optimisation problems on non-Riemannian manifolds, such as geometrical surfaces with sharp edges, we develop and prove the convergence of a forward-backward method in Alexandrov spaces with curvature bounded both from above and from below. This bilateral boundedness is crucial for the availability of both the gradient and proximal steps, instead of just one or the other. We numerically demonstrate the behaviour of the proposed method on simple geometrical surfaces in $\mathbb{R}^3$.

math.OC

Differential estimates for fast first-order multilevel nonconvex optimisation

With a view on bilevel and PDE-constrained optimisation, we develop iterative estimates $\widetilde{F'}(x^k)$ of $F'(x^k)$ for composite functions $F :=J \circ S$, where $S$ is the solution mapping of the inner optimisation problem or PDE. The idea is to form a single-loop method by interweaving updates of the iterate $x^k$ by an outer optimisation method, with updates of the estimate by single steps of standard optimisation methods and linear system solvers. When the inner methods satisfy simple tracking inequalities, the differential estimates can almost directly be employed in standard convergence proofs for general forward-backward type methods. We adapt those proofs to a general inexact setting in normed spaces, that, besides our differential estimates, also covers mismatched adjoints and unreachable optimality conditions in measure spaces. As a side product of these efforts, we provide improved convergence results for nonconvex Primal-Dual Proximal Splitting (PDPS). We numerically evaluate our methods on Electrical Impedance Tomography (EIT) and minimal surface control.

math.OC

Single-loop methods for bilevel parameter learning in inverse imaging

Bilevel optimisation is used in inverse imaging problems for hyperparameter learning/identification and experimental design, for instance, to find optimal regularisation parameters and forward operators. However, computationally, the process is costly. To reduce this cost, recently so-called single-loop approaches have been introduced. On each step of an outer optimisation method, they take just a single gradient step towards the solution of the inner problem. In this paper, we flexibilise the inner algorithm to include standard methods in inverse imaging. Moreover, as we have recently shown, significant performance improvements can be obtained in PDE-constrained optimisation by interweaving the steps of conventional iterative linear system solvers with the optimisation method. We now demonstrate how the adjoint equation in bilevel problems can also benefit from such interweaving. We evaluate the performance of our approach on identifying the deconvolution kernel for image deblurring, and the subsampling operator for magnetic resonance imaging (MRI).

math.OC

Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems

In this paper, we introduce both monotone and nonmonotone variants of LiBCoD, a \textbf{Li}nearized \textbf{B}lock \textbf{Co}ordinate \textbf{D}escent method for solving composite optimization problems. At each iteration, a random block is selected, and the smooth components of the objective are linearized along the chosen block in a Gauss-Newton approach. For the monotone variant, we establish a global sublinear convergence rate to a stationary point under the assumption of bounded iterates. For the nonmonotone variant, we derive a global sublinear convergence rate without requiring global Lipschitz continuity or bounded iterates. Preliminary numerical experiments highlight the promising performance of the proposed approach.

math.OC

Online optimisation for dynamic electrical impedance tomography

Online optimisation studies the convergence of optimisation methods as the data embedded in the problem changes. Based on this idea, we propose a primal dual online method for nonlinear time-discrete inverse problems. We analyse the method through regret theory and demonstrate its performance in real-time monitoring of moving bodies in a fluid with Electrical Impedance Tomography (EIT). To do so, we also prove the second-order differentiability of the Complete Electrode Model (CEM) solution operator on $L^\infty$.

math.OC

Multigrid methods for total variation

Based on a nonsmooth coherence condition, we construct and prove the convergence of a forward-backward splitting method that alternates between steps on a fine and a coarse grid. Our focus is a total variation regularised inverse imaging problems, specifically, their dual problems, for which we develop in detail the relevant coarse-grid problems. We demonstrate the performance of our method on total variation denoising and magnetic resonance imaging.

math.OC

Prediction techniques for dynamic imaging with online primal-dual methods

Online optimisation facilitates the solution of dynamic inverse problems, such as image stabilisation, fluid flow monitoring, and dynamic medical imaging. In this paper, we improve upon previous work on predictive online primal-dual methods on two fronts. Firstly, we provide a more concise analysis that symmetrises previously unsymmetric regret bounds, and relaxes previous restrictive conditions on the dual predictor. Secondly, based on the latter, we develop several improved dual predictors. We numerically demonstrate their efficacy in image stabilisation and dynamic positron emission tomography.

math.OC

A nonsmooth primal-dual method with interwoven PDE constraint solver

We introduce an efficient first-order primal-dual method for the solution of nonsmooth PDE-constrained optimization problems. We achieve this efficiency through not solving the PDE or its linearisation on each iteration of the optimization method. Instead, we run the method interwoven with a simple conventional linear system solver (Jacobi, Gauss-Seidel, conjugate gradients), always taking only one step of the linear system solver for each step of the optimization method. The control parameter is updated on each iteration as determined by the optimization method. We prove linear convergence under a second-order growth condition, and numerically demonstrate the performance on a variety of PDEs related to inverse problems involving boundary measurements.

math.OC

Proximal methods for point source localisation

Point source localisation is generally modelled as a Lasso-type problem on measures. However, optimisation methods in non-Hilbert spaces, such as the space of Radon measures, are much less developed than in Hilbert spaces. Most numerical algorithms for point source localisation are based on the Frank-Wolfe conditional gradient method, for which ad hoc convergence theory is developed. We develop extensions of proximal-type methods to spaces of measures. This includes forward-backward splitting, its inertial version, and primal-dual proximal splitting. Their convergence proofs follow standard patterns. We demonstrate their numerical efficacy.

math.OC

Linearly convergent bilevel optimization with single-step inner methods

We propose a new approach to solving bilevel optimization problems, intermediate between solving full-system optimality conditions with a Newton-type approach, and treating the inner problem as an implicit function. The overall idea is to solve the full-system optimality conditions, but to precondition them to alternate between taking steps of simple conventional methods for the inner problem, the adjoint equation, and the outer problem. While the inner objective has to be smooth, the outer objective may be nonsmooth subject to a prox-contractivity condition. We prove linear convergence of the approach for combinations of gradient descent and forward-backward splitting with exact and inexact solution of the adjoint equation. We demonstrate good performance on learning the regularization parameter for anisotropic total variation image denoising, and the convolution kernel for image deconvolution.

math.OC