Presentation 2014-07-30
On Numerical Computation of Sparse Optimal Control
Takuya IKEDA, Masaaki NAGAHARA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this article, we consider sparse optimal control with L^2 regularization for the states. Under the normality assumption, we prove that the solutions of the sparse optimal control problem coincide those of an L^1 optimal control problem. By this theorem, we can numerically compute the sparse optimal control via L^1 optimal control. We also show a sufficient condition for the normality assumption, and illustrate numerical examples.
Keyword(in Japanese) (See Japanese page)
Keyword(in English)
Paper # RCC2014-25
Date of Issue

Conference Information
Committee RCC
Conference Date 2014/7/23(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Reliable Communication and Control (RCC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On Numerical Computation of Sparse Optimal Control
Sub Title (in English)
Keyword(1)
1st Author's Name Takuya IKEDA
1st Author's Affiliation Graduate School of Informatics, Kyoto University()
2nd Author's Name Masaaki NAGAHARA
2nd Author's Affiliation Graduate School of Informatics, Kyoto University
Date 2014-07-30
Paper # RCC2014-25
Volume (vol) vol.114
Number (no) 162
Page pp.pp.-
#Pages 4
Date of Issue