Forward-Backward Splitting for Optimal Transport Based Problems
Related publications (47)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
The design of a microvascular flow network embedded in an actively-cooled polymeric material is presented. A multi-objective Genetic Algorithm (GA) combined with the finite element method is first used to determine the quasi-optimized network configuration ...
We present a novel method for convex unconstrained optimization that, without any modifications, ensures: (i) accelerated convergence rate for smooth objectives, (ii) standard convergence rate in the general (non-smooth) setting, and (iii) standard converg ...
This work studies the problem of statistical inference for Fréchet means in the Wasserstein space of measures on Euclidean spaces, W2(Rd). This question arises naturally from the problem of separating amplitude and phase variation i ...
Mean-field variational inference is one of the most popular approaches to inference in discrete random fields. Standard mean-field optimization is based on coordinate descent and in many situations can be impractical. Thus, in practice, various parallel te ...
This dissertation develops geometric variational models for different inverse problems in imaging that are ill-posed, designing at the same time efficient numerical algorithms to compute their solutions. Variational methods solve inverse problems by the fo ...
The desire to operate chemical processes in a safe and economically optimal way has motivated the development of so-called real-time optimization (RTO) methods [1]. For continuous processes, these methods aim to compute safe and optimal steady-state set ...
We present a novel method for convex unconstrained optimization that, without any modifications, ensures: (i) accelerated convergence rate for smooth objectives, (ii) standard convergence rate in the general (non-smooth) setting, and (iii) standard converg ...
This thesis contributes towards the design and analysis of fast and distributed optimization algorithms based on splitting techniques, such as proximal gradient methods or alternation minimization algorithms, with the application of solving model predictiv ...
The convergence of properly time-scaled and normalized maxima of independent standard Brownian motions to the Brown-Resnick process is well-known in the literature. In this paper, we study the extremal functional behavior of non-Gaussian processes, namely ...
In a recent article series, the authors have promoted convex optimization algorithms for radio-interferometric imaging in the framework of compressed sensing, which leverages sparsity regularization priors for the associated inverse problem and defines a m ...