Publication

Complexity Certification of the Fast Alternating Minimization Algorithm for Linear Model Predictive Control

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.

Image reconstruction of non-planar scenes from compressed multi-view measurements

Pierre Vandergheynst, Gilles Puy

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

2013

Generating Fast Indulgent Algorithms

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Synchronous distributed algorithms are easier to design and prove correct than algorithms that tolerate asynchrony. Yet, in the real world, networks experience asynchrony and other timing anomalies. In this paper, we address the question of how to efficien ...

Springer Verlag2012

Computational Complexity Certification for Real-Time MPC With Input Constraints Based on the Fast Gradient Method

Colin Neil Jones

This paper proposes to use Nesterov's fast gradient method for the solution of linear quadratic model predictive control (MPC) problems with input constraints. The main focus is on the method's a priori computational complexity certification which consists ...

Institute of Electrical and Electronics Engineers2012

Randomized versus Deterministic Implementations of Concurrent Data Structures

Dan Alistarh

One of the key trends in computing over the past two decades has been increased distribution, both at the processor level, where multi-core architectures are now the norm, and at the system level, where many key services are currently distributed overmulti ...

EPFL2012

Generating Fast Indulgent Algorithms

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2011

Multicore thermal management using approximate explicit Model Predictive Control

Giovanni De Micheli, David Atienza Alonso, Colin Neil Jones, Francesco Zanini

Meeting temperature constraints and reducing the hot-spots are critical for achieving reliable and efficient operation of complex multi-core systems. In this paper we aim at achieving an online smooth thermal control action that minimizes the performance l ...

IEEE Press2010

Multicore thermal management using approximate explicit model predictive control

Giovanni De Micheli, David Atienza Alonso, Colin Neil Jones, Francesco Zanini

IEEE2010

Neighboring extremals in optimization and control

Sébastien Gros

Optimization arises naturally when process performance needs improvement. This is often the case in industry because of competition – the product has to be proposed at the lowest possible cost. From the point of view of control, optimization consists in de ...

EPFL2007

Minkowski sums of polytopes

Christophe Weibel

Minkowski sums are a very simple geometrical operation, with applications in many different fields. In particular, Minkowski sums of polytopes have shown to be of interest to both industry and the academic world. This thesis presents a study of these sums, ...

EPFL2007

The Inherent Price of Indulgence

Rachid Guerraoui, Partha Dutta

This paper presents a tight lower bound on the time complexity of indulgent consensus algorithms, i.e., consensus algorithms that use unreliable failure detectors. We state and prove our tight lower bound in the unifying framework of round-by-round fault d ...

2005