442 citations
- University of AntwerpBE597 papers
- Charles UniversityCZ595 papers
- Institute of High Energy PhysicsCN590 papers
- University of HelsinkiFI582 papers
- A. Alikhanyan National LaboratoryAM580 papers
- Universidade do Estado do Rio de JaneiroBR580 papers
- Vrije Universiteit BrusselBE578 papers
- Helsinki Institute of PhysicsFI577 papers
- Beihang UniversityCN574 papers
- Institute of Nuclear Physics of LyonFR574 papers
- Lappeenranta-Lahti University of TechnologyFI574 papers
- National Institute of Chemical Physics and BiophysicsEE574 papers
22 papers · 1 filter
Forward-backward splitting in bilaterally bounded Alexandrov spaces
Heikki von Koch, Tuomo Valkonen
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-backwar…
Multigrid methods for total variation
Felipe Guerra, Tuomo Valkonen
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. O…
Proximal methods for point source localisation
Tuomo Valkonen
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 m…
A nonsmooth primal-dual method with interwoven PDE constraint solver
Bjørn Jensen, Tuomo Valkonen
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…
Linearly convergent bilevel optimization with single-step inner methods
Ensio Suonperä, Tuomo Valkonen
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 inn…
Optimizing Connected Components Graph Partitioning With Minimum Size Constraints Using Integer Programming and Spectral Clustering Techniques
Mishelle Cordero, Andrés Miniguano-Trujillo, Diego Recalde +2
In this work, a graph partitioning problem in a fixed number of connected components is considered. Given an undirected graph with costs on the edges, the problem consists of parti…