Publications related to A Regularized Robust Design Criterion for Uncertain Data

Sampling can be faster than optimization

Optimization algorithms and Monte Carlo sampling algorithms have provided the computational foundations for the rapid growth in applications of statistical machine learning in recent years. There is, however, limited theoretical understanding of the relati ...

PNAS2019

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

Alcherio Martinoli, Izzet Kagan Erünsal, Rodrigo Martins de Matos Ventura

In recent years, extensive research is conducted on the coordination and cooperation strategies of multirotor Micro Aerial Vehicles (MAVs) to perform high-level missions such as scientific exploration, search and rescue, intelligence gathering etc. [1], [2 ...

2019

The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches

Aris Filos Ratsikas

We resolve the computational complexity of two problems known as NECKLACE-SPLITTING and DISCRETE HAM SANDWICH, showing that they are PPA-complete. For NECKLACE SPLITTING, this result is specific to the important special case in which two thieves share the ...

ACM2019

RBF Based CWENO Method

Jan Sickmann Hesthaven, Fabian Mönkeberg

Solving hyperbolic conservation laws on general grids can be important to reduce the computational complexity and increase accuracy in many applications. However, the use of non-uniform grids can introduce challenges when using high-order methods. We propo ...

2018

Distributed Rate Allocation in Switch-Based Multiparty Videoconferencing System

Pascal Frossard, Sergio Mena, Stefano D'Aronco

Multiparty videoconferences, or more generally multiparty video calls, are gaining a lot of popularity as they offer a rich communication experience. These applications have, however, large requirements in terms of both network and computational resources ...

2017

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

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

Jean-Yves Le Boudec, Mario Paolone, Dan-Cristian Tomozei, Konstantina Christakou

The optimal power-flow problem (OPF) has always played a key role in the planning and operation of power systems. Due to the non-linear nature of the AC power-flow equations, the OPF problem is known to be non-convex, therefore hard to solve. During the la ...

Elsevier2017

Complexity Certification of the Fast Alternating Minimization Algorithm for Linear MPC

Colin Neil Jones, Ye Pu, Melanie Nicole Zeilinger

In this technical note, the fast alternating minimization algorithm (FAMA) is proposed to solve model predictive control (MPC) problems with polytopic and second-order cone constraints. Two splitting strategies with efficient implementations for MPC proble ...

2017

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 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

A Regularized Robust Design Criterion for Uncertain Data

Graph Chatbot

Chat with 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”

The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches

A Comment on “Computational Complexity of Stochastic Programming Problems”

Sampling can be faster than optimization

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

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

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

RBF Based CWENO Method

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

Complexity Certification of the Fast Alternating Minimization Algorithm for Linear MPC