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.
This work studies multi-agent sharing optimization problems with the objective function being the sum of smooth local functions plus a convex (possibly non-smooth) function coupling all agents. This scenario arises in many machine learning and engineering ...
We consider the problem of finding a saddle point for the convex-concave objective minxmaxyf(x)+⟨Ax,y⟩−g∗(y), where f is a convex function with locally Lipschitz gradient and g is convex and possibly non-smooth. We propose an ...
We introduce a new primal-dual reconstruction algorithm for fluorescence and bioluminescence tomography. As often in optical tomography, image reconstruction is performed by optimizing a multi-term convex cost function. Current reconstruction methods emplo ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011
We introduce a new primal-dual reconstruction algorithm for fluorescence and bioluminescence tomography. As often in optical tomography, image reconstruction is performed by optimizing a multi-term convex cost function. Current reconstruction methods emplo ...
