Publication

Complexity Certification of the Fast Alternating Minimization Algorithm for Linear MPC

Related publications (39)

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.

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

Colin Neil Jones, Ye Pu, Melanie Nicole Zeilinger

In this paper, the fast alternating minimization algorithm (FAMA) is proposed to solve model predictive control (MPC) problems with polytopic and second-order cone constraints. We extend previous theoretical results of FAMA to a more general case, where co ...

2014

Time–Data Tradeoffs by Aggressive Smoothing

Volkan Cevher

This paper proposes a tradeoff between sample complexity and computation time that applies to statistical estimators based on convex optimization. As the amount of data increases, we can smooth optimization problems more and more aggressively to achieve ac ...

2014

Environmental Influence on the Evolution of Morphological Complexity in Machines

Joshua Evan Auerbach

Whether, when, how, and why increased complexity evolves in biological populations is a longstanding open question. In this work we combine a recently developed method for evolving virtual organisms with an information-theoretic metric of morphological com ...

Public Library Science2014

Scalable sparse covariance estimation via self-concordance

Volkan Cevher, Quoc Tran Dinh, Anastasios Kyrillidis, Rabeeh Karimi Mahabadi

We consider the class of convex minimization problems, composed of a self-concordant function, such as the logdet metric, a convex data fidelity term h and, a regularizing -- possibly non-smooth -- function g. This type of problems have recently attracted ...

2014

Barrier Smoothing for Nonsmooth Convex Minimization

Volkan Cevher, Quoc Tran Dinh, Yen-Huan Li

This paper proposes a smoothing technique for nonsmooth convex minimization using self-concordant barriers. To illustrate the main ideas, we compare our technique and the proximity smoothing approach (Nesterov2005) via the classical gradient method on both ...

Ieee2014

Fast Byzantine Agreement

Rachid Guerraoui, Florian Huc

This paper presents the first probabilistic Byzantine Agreement algorithm whose communication and time complexities are poly-logarithmic. So far, the most effective probabilistic Byzantine Agreement algorithm had communication complexity and time complexit ...

2013

Interactive Function Computation

Michael Christoph Gastpar

We investigate the role of interaction for computa- tion problem settings where nodes intend to compute functions of the raw messages generated at other nodes. In this work, we make some progress on a more elementary research component: feedback. Specifica ...

2013

Towards computational complexity certification for constrained mpc based on lagrange relaxation and the fast gradient method

Colin Neil Jones

Solving a convex optimization problem within an a priori certified period of time is a challenging problem. This paper discusses the certification of Nesterov’s fast gradient method for problems with a strictly quadratic objective and a feasible set given ...

2011

An Efficient Method to Estimate the Suboptimality of Affine Controllers

Daniel Kuhn

We consider robust feedback control of time-varying, linear discrete-time systems operating over a finite horizon. For such systems, we consider the problem of designing robust causal controllers that minimize the expected value of a convex quadratic cost ...

Institute of Electrical and Electronics Engineers2011

An Efficient Method to Estimate the Suboptimality of Affine Controllers

Daniel Kuhn

Institute of Electrical and Electronics Engineers2011