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.
A novel decomposition scheme to solve parametric nonconvex programs as they arise in Nonlinear Model Predictive Control (NMPC) is presented. It consists of a fixed number of alternating proximal gradient steps and a dual update per time step. Hence, the pr ...
This thesis deals with the development of numerical methods for solving nonconvex optimisation problems by means of decomposition and continuation techniques. We first introduce a novel decomposition algorithm based on alternating gradient projections and ...
This thesis contributes towards the design and analysis of fast and distributed optimization algorithms based on splitting techniques, such as proximal gradient methods or alternation minimization algorithms, with the application of solving model predictiv ...
In North America, a common design practice for steel frame buildings with perimeter steel special moment frames (SMFs) is to employ deep and slender wide-flange steel columns (i.e., range of column depth, d > 16 inches). Till recently, very little was know ...
This paper examines the effectiveness of variable speed limits (VSLs) on improving traffic flow efficiency and reducing vehicular emissions in a stylized setting of morning commute where a fixed number of individuals commute from home to work through the f ...
This paper presents a method to verify closed-loop properties of optimization-based controllers for deterministic and stochastic constrained polynomial discrete-time dynamical systems. The closed-loop properties amenable to the proposed technique include g ...
This thesis consists of two parts. The first part is about a variant of Banach's fixed point theorem and its applications to several partial differential equations (PDE's), abstractly of the form [ \mathcal Lu + \mathcal Q(u) = f.] The main result of thi ...
We consider networks of agents cooperating to minimize a global objective, modeled as the aggregate sum of regularized costs that are not required to be differentiable. Since the subgradients of the individual costs cannot generally be assumed to be unifor ...
We address the problem of choosing a fixed number of sensor vertices in a graph in order to detect the source of a partially-observed diffusion process on the graph itself. Building on the definition of double resolvability we introduce a notion of vertex ...
Motivated by the significant performance gains which polar codes experience under successive cancellation list decoding, their scaling exponent is studied as a function of the list size. In particular, the error probability is fixed, and the tradeoff betwe ...