Sciweavers

295 search results - page 11 / 59
» Robust control of polytopic systems by convex optimization
Sort
View
CDC
2008
IEEE
124views Control Systems» more  CDC 2008»
14 years 2 months ago
A proximal center-based decomposition method for multi-agent convex optimization
— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...
Ion Necoara, Johan A. K. Suykens
CDC
2009
IEEE
379views Control Systems» more  CDC 2009»
13 years 11 months ago
Receding horizon cost optimization for overly constrained nonlinear plants
— A receding horizon control algorithm, originally proposed for tracking best-possible steady-states in the presence of overly stringent state and/or input constraints, is analyz...
David Angeli, Rishi Amrit, James B. Rawlings
JACM
2011
152views more  JACM 2011»
12 years 11 months ago
Robust principal component analysis?
This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component i...
Emmanuel J. Candès, Xiaodong Li, Yi Ma, Joh...
CDC
2010
IEEE
226views Control Systems» more  CDC 2010»
13 years 3 months ago
Fast primal-dual projected linear iterations for distributed consensus in constrained convex optimization
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
Ion Necoara, Ioan Dumitrache, Johan A. K. Suykens
CDC
2010
IEEE
112views Control Systems» more  CDC 2010»
13 years 3 months ago
Online Convex Programming and regularization in adaptive control
Online Convex Programming (OCP) is a recently developed model of sequential decision-making in the presence of time-varying uncertainty. In this framework, a decisionmaker selects ...
Maxim Raginsky, Alexander Rakhlin, Serdar Yük...