Scalable Convex Methods for Phase Retrieval

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 self-concordant-like property of a smooth convex function is a new analytical structure that generalizes the self-concordant notion. While a wide variety of important applications feature the self- concordant-like property, this concept has heretofore ...

A method for certifying exact input trackability for constrained discrete time linear systems is introduced in this paper. A signal is assumed to be drawn from a reference set and the system must track this signal with a linear combination of its inputs. U ...

Mapping the local microstructure properties of the tissue in the brain is crucial to understand any pathological condition from a biological perspective. In recent years, microstructure-imaging techniques aimed at extracting such precious information by us ...

We present a novel approach to the reconstruction of depth from light field data. Our method uses dictionary representations and group sparsity constraints to derive a convex formulation. Although our solution results in an increase of the problem dimensio ...

Scalable Convex Methods for Phase Retrieval

Chat with Graph Search

Composite convex minimization involving self-concordant-like cost functions

Guaranteeing Input Tracking For Constrained Systems: Theory and Application to Demand Response

Accelerated Microstructure Imaging via Convex Optimization (AMICO) in crossing fibers

A Convex Solution to Disparity Estimation from Light Fields via the Primal-Dual Method