Publications associées à A Regularized Robust Design Criterion for Uncertain Data

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

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

A Regularized Robust Design Criterion for Uncertain Data

Graph Chatbot

Chattez avec Graph Search

Sampling can be faster than optimization

Decentralized Nonlinear Model Predictive Control for 3D Formation of Multirotor Micro Aerial Vehicles with Relative Sensing and Estimation

The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches

RBF Based CWENO Method

Distributed Rate Allocation in Switch-Based Multiparty Videoconferencing System

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

AC OPF in radial distribution networks – Part I: On the limits of the branch flow convexification and the alternating direction method of multipliers

Complexity Certification of the Fast Alternating Minimization Algorithm for Linear MPC

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

A Comment on “Computational Complexity of Stochastic Programming Problems”

Sampling can be faster than optimization

The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches

A Comment on “Computational Complexity of Stochastic Programming Problems”

RBF Based CWENO Method

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

Complexity Certification of the Fast Alternating Minimization Algorithm for Linear MPC

Distributed Rate Allocation in Switch-Based Multiparty Videoconferencing System

AC OPF in radial distribution networks – Part I: On the limits of the branch flow convexification and the alternating direction method of multipliers

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

Decentralized Nonlinear Model Predictive Control for 3D Formation of Multirotor Micro Aerial Vehicles with Relative Sensing and Estimation