Towards computational complexity certification for constrained mpc based on lagrange relaxation and the fast gradient method
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
In a previous work we developed a convex infinite dimensional linear programming (LP) approach to approximating the region of attraction (ROA) of polynomial dynamical systems subject to compact basic semialgebraic state constraints. Finite dimensional rela ...
Redundant Gabor frames admit an infinite number of dual frames, yet only the canonical dual Gabor system, con- structed from the minimal l2-norm dual window, is widely used. This window function however, might lack desirable properties, such as good time-f ...
We study the multi-view imaging problem where one has to reconstruct a set of l images, representing a single scene, from a few measurements made at different viewpoints. We first express the solution of the problem as the minimizer of a non-convex objecti ...
We investigate a compressive sensing system in which the sensors introduce a distortion to the measurements in the form of unknown gains. We focus on blind calibration, using measures performed on a few unknown (but sparse) signals. We extend our earlier s ...
In this work, we study the task of distributed optimization over a network of learners in which each learner possesses a convex cost function, a set of affine equality constraints, and a set of convex inequality constraints. We propose a distributed diffus ...
Time-optimal path following considers the problem of moving along a predetermined geometric path in minimum time. In the case of a robotic manipulator with simplified constraints, a convex reformulation of this optimal control problem has been derived prev ...
Institute of Electrical and Electronics Engineers2013
We consider the problem of calibrating a compressed sensing measurement system under the assumption that the decalibration consists of unknown complex gains on each measure. We focus on blind calibration, using measures performed on a few unknown (but spar ...
Real-Time Optimization (RTO) via modifier adaptation is a class of methods for which measurements are used to iteratively adapt the model via input-affine additive terms. The modifier terms correspond to the deviations between the measured and predicted co ...
We propose an algorithmic framework for convex minimization problems of a composite function with two terms: a self-concordant function and a possibly nonsmooth regularization term. Our method is a new proximal Newton algorithm that features a local quadra ...
We study the multi-view imaging problem where one has to reconstruct a set of l images, representing a single scene, from a few measurements made at different viewpoints. We first express the solution of the problem as the minimizer of a non-convex objecti ...
