4 papers
Identification with Orthogonal Basis Functions: Convergence Speed, Asymptotic Bias, and Rate-Optimal Pole Selection
Jiayun Li, Yiwen Lu, Yilin Mo +1
This paper is concerned with performance analysis and pole selection problem in identifying linear time-invariant (LTI) systems using orthogonal basis functions (OBFs), a system id…
Tannenbaum's gain-margin optimization meets Polyak's heavy-ball algorithm
Wuwei Wu, Jie Chen, Mihailo R. JovanoviÄ +1
This paper highlights an apparent, yet relatively unknown link between algorithm design in optimization theory and controller synthesis in robust control. Specifically, quadratic o…
Automated algorithm design for convex optimization problems with linear equality constraints
Ibrahim K. Ozaslan, Wuwei Wu, Jie Chen +2
Synthesis of optimization algorithms typically follows a {\em design-then-analyze\/} approach, which can obscure fundamental performance limits and hinder the systematic developmen…
Coordinated Multi-Agent Patrolling with State-Dependent Cost Rates: Asymptotically Optimal Policies for Large-Scale Systems
Jing Fu, Zengfu Wang, Jie Chen
We study a large-scale patrol problem with state-dependent costs and multi-agent coordination.We consider heterogeneous agents, rather general reward functions, and the capabilitie…