Publications related to Reconstruction of irregularly sampled discrete-time bandlimited signals with unknown sampling locations

The Linear Programming Approach to Reach-Avoid Problems for Markov Decision Processes

Maryam Kamgarpour, John Lygeros, Tyler Summers

One of the most fundamental problems in Markov decision processes is analysis and control synthesis for safety and reachability specifications. We consider the stochastic reach-avoid problem, in which the objective is to synthesize a control policy to max ...

2017

Frobenius techniques in birational geometry

Zsolt Patakfalvi

This is a survey for the 2015 AMS Summer Institute on Algebraic Geometry about the Frobenius type techniques recently used extensively in positive characteristic algebraic geometry. We first explain the basic ideas through simple versions of the fundamenta ...

2017

A Comment on “Computational Complexity of Stochastic Programming Problems”

Daniel Kuhn, Grani Adiwena Hanasusanto, Wolfram Wiesemann

Although stochastic programming problems were always believed to be computationally challenging, this perception has only recently received a theoretical justification by the seminal work of Dyer and Stougie (Mathematical Programming A, 106(3):423–432, 200 ...

Springer Heidelberg2016

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Michaël Unser, Martin Kurt Storath

We consider

L ^{ 1 }

-TV regularization of univariate signals with values on the real line or on the unit circle. While the real data space leads to a convex optimization problem, the problem is nonconvex for circle-valued data. In this paper, we deriv ...

SIAM2016

K-Adaptability in Two-Stage Distributionally Robust Binary Programming

Daniel Kuhn, Grani Adiwena Hanasusanto, Wolfram Wiesemann

We propose to approximate two-stage distributionally robust programs with binary recourse decisions by their associated K-adaptability problems, which pre-select K candidate second-stage policies here-and-now and implement the best of these policies once t ...

Elsevier Science Bv2016

K-Adaptability in Two-Stage Robust Binary Programming

Daniel Kuhn, Grani Adiwena Hanasusanto, Wolfram Wiesemann

Over the last two decades, robust optimization has emerged as a computationally attractive approach to formulate and solve single-stage decision problems affected by uncertainty. More recently, robust optimization has been successfully applied to multi-sta ...

Informs2015

Algebraic twists of modular forms and Hecke orbits

Philippe Michel

We consider the question of the correlation of Fourier coefficients of modular forms with functions of algebraic origin. We establish the absence of correlation in considerable generality (with a power saving of Burgess type) and a corresponding equidistri ...

Springer Verlag2015

Rigorous optimization recipes for sparse and low rank inverse problems with applications in data sciences

Anastasios Kyrillidis

Many natural and man-made signals can be described as having a few degrees of freedom relative to their size due to natural parameterizations or constraints; examples include bandlimited signals, collections of signals observed from multiple viewpoints in ...

EPFL2014

An inexact proximal path-following algorithm for constrained convex minimization

Volkan Cevher, Quoc Tran Dinh, Anastasios Kyrillidis

Many scientific and engineering applications feature large-scale non-smooth convex minimization problems over convex sets. In this paper, we address an important instance of this broad class where we assume that the non-smooth objective is equipped with a ...

Siam Publications2014

Blind Phase Calibration in Sparse Recovery

Rémi Gribonval, Gilles Puy

We consider a blind calibration problem in a compressed sensing measurement system in which each sensor introduces an unknown phase shift to be determined. We show that this problem can be approached similarly to the problem of phase retrieval from quadrat ...

2013

Reconstruction of irregularly sampled discrete-time bandlimited signals with unknown sampling locations

Graph Chatbot

Chat with Graph Search

The Linear Programming Approach to Reach-Avoid Problems for Markov Decision Processes

Frobenius techniques in birational geometry

A Comment on “Computational Complexity of Stochastic Programming Problems”

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

K-Adaptability in Two-Stage Distributionally Robust Binary Programming

K-Adaptability in Two-Stage Robust Binary Programming

Algebraic twists of modular forms and Hecke orbits

Rigorous optimization recipes for sparse and low rank inverse problems with applications in data sciences

An inexact proximal path-following algorithm for constrained convex minimization

Blind Phase Calibration in Sparse Recovery

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

The Linear Programming Approach to Reach-Avoid Problems for Markov Decision Processes

A Comment on “Computational Complexity of Stochastic Programming Problems”

K-Adaptability in Two-Stage Distributionally Robust Binary Programming

Algebraic twists of modular forms and Hecke orbits

An inexact proximal path-following algorithm for constrained convex minimization

Blind Phase Calibration in Sparse Recovery

Frobenius techniques in birational geometry

Rigorous optimization recipes for sparse and low rank inverse problems with applications in data sciences

K-Adaptability in Two-Stage Robust Binary Programming