Combinatorial Penalties: Which structures are preserved by convex relaxations?
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.
We investigate a compressive sensing system in which the sensors introduce a distortion to the measurements in the form of unknown gains. We focus on blind calibration, using measures performed on a few unknown (but sparse) signals. We extend our earlier s ...
Image recovery in optical interferometry is an ill-posed nonlinear inverse problem arising from incomplete power spectrum and bi-spectrum measurements. We formulate a linear version of the problem for the order-3 tensor formed by the tensor product of the ...
Time-optimal path following considers the problem of moving along a predetermined geometric path in minimum time. In the case of a robotic manipulator with simplified constraints, a convex reformulation of this optimal control problem has been derived prev ...
Institute of Electrical and Electronics Engineers2013
We consider the problem of calibrating a compressed sensing measurement system under the assumption that the decalibration consists of unknown complex gains on each measure. We focus on blind calibration, using measures performed on a few unknown (but spar ...
Machine learning is most often cast as an optimization problem. Ideally, one expects a convex objective function to rely on efficient convex optimizers with nice guarantees such as no local optima. Yet, non-convexity is very frequent in practice and it may ...
Solving a convex optimization problem within an a priori certified period of time is a challenging problem. This paper discusses the certification of Nesterov’s fast gradient method for problems with a strictly quadratic objective and a feasible set given ...
Vision is a natural tool for human-computer interaction, since it pro- vides visual feedback to the user and mimics some human behaviors. It requires however the fast and robust computation of motion primi- tives, which remains a difficult problem. In this ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011
In this work, we exploit the fact that wavelets can represent magnetic resonance images well, with relatively few coefficients. We use this property to improve magnetic resonance imaging (MRI) reconstructions from undersampled data with arbitrary k-space t ...
Institute of Electrical and Electronics Engineers2011
Problems dealing with the design and the operations of gas transmission networks are challenging. The difficulty mainly arises from the simultaneous modeling of gas transmission laws and of the investment costs. The combination of the two yields a non-line ...
We extend the domain of application of a method developed recently for joint reconstruction of l images, representing the same scene, from few multi-view measurements. While this method was initially designed for planar scenes, we show here that parametric ...
