A parametric augmented Lagrangian algorithm for real-time economic NMPC

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.

We address the problem of designing stabilizing control policies for nonlinear systems in discrete-time, while minimizing an arbitrary cost function. When the system is linear and the cost is convex, the System Level Synthesis (SLS) approach offers an effe ...

Visual Focus of Attention (VFOA) estimation in conversation is challenging as it relies on difficult to estimate information (gaze) combined with scene features like target positions and other contextual information (speaking status) allowing to disambigua ...

Consider F is an element of C(RxX,Y) such that F(lambda, 0) = 0 for all lambda is an element of R, where X and Y are Banach spaces. Bifurcation from the line Rx{0} of trivial solutions is investigated in cases where F(lambda, center dot ) need not be Frech ...

The calculation of electron correlation is vital for the description of atomistic phenomena in physics, chemistry, and biology. However, accurate wavefunction-based methods exhibit steep scaling and often sluggish convergence with respect to the basis set ...

Functional time series is a temporally ordered sequence of not necessarily independent random curves. While the statistical analysis of such data has been traditionally carried out under the assumption of completely observed functional data, it may well ha ...

In arXiv:1909.01269 it was shown that the scaling dimension of the lightest charge n operator in the U (1) model at the Wilson-Fisher fixed point in D = 4 - epsilon can be computed semiclassically for arbitrary values of lambda n, where lambda is the pertu ...

In every dimension d >= 2, we give an explicit formula that expresses the values of any Schwartz function on R-d only in terms of its restrictions, and the restrictions of its Fourier transform, to all origin-centered spheres whose radius is the square roo ...

This paper introduces a new algorithm for consensus optimization in a multi-agent network, where all agents collaboratively find a minimizer for the sum of their private functions. All decentralized algorithms rely on communications between adjacent nodes. ...

We study a fixed point property for linear actions of discrete groups on weakly complete convex proper cones in locally convex topological vector spaces. We search to understand the class of discrete groups which enjoys this property and we try to generali ...

In this work, we study the computational complexity of the Minimum Distance Code Detection problem. In this problem, we are given a set of noisy codeword observations and we wish to find a code in a set of linear codes C of a given dimension k, for which t ...

Vulnerability metrics play a key role in the understanding of cascading failures and target/random attacks to a network. The graph fragmentation problem (GFP) is the result of a worst-case analysis of a random attack. We can choose a fixed number of indivi ...

The objective of this thesis is to provide a mathematical and computational framework for the proactive maintenance of complex systems with a particular application to structural health monitoring (SHM). SHM techniques rely primarily on sensor responses to ...

Transformers have been proven a successful model for a variety of tasks in sequence modeling. However, computing the attention matrix, which is their key component, has quadratic complexity with respect to the sequence length, thus making them prohibitivel ...

A parametric augmented Lagrangian algorithm for real-time economic NMPC

Chat with Graph Search

Neural System Level Synthesis: Learning over All Stabilizing Policies for Nonlinear Systems

Visual Focus of Attention Estimation in 3D Scene with an Arbitrary Number of Targets

Global bifurcation at isolated singular points of the Hadamard derivative

Efficient Treatment of Correlation Energies at the Basis-Set Limit by Monte Carlo Summation of Continuum States

Sparsely Observed Functional Time Series: Theory and Applications

Feynman diagrams and the large charge expansion in 3-epsilon dimensions

Fourier Interpolation From Spheres

Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimization

Invariant Integrals on Topological Groups and Applications

On the Computational Complexity of Blind Detection of Binary Linear Codes

Graph fragmentation problem: analysis and synthesis

Numerical methods for structural anomaly detection using model order reduction and data-driven techniques

Fast Transformers with Clustered Attention