On non-differentiable time-varying optimization

Andrea Simonetto, Geert Leus

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We consider non-differentiable convex optimization problems that vary continuously in time and we propose algorithms that sample these problems at specific time instances and generate a sequence of converging near-optimal decision variables. This sequence converges up to a bounded error to the solution trajectory of the time-varying non-differentiable problems. We illustrate through analytical examples and a realistic numerical simulation the benefit of the algorithms in signal processing applications, e.g., for reconstructing time-varying sparse signals.

Original languageEnglish
Title of host publication2015 IEEE 6th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages505-508
Number of pages4
ISBN (Electronic)9781479919635
DOIs
Publication statusPublished - 1 Jan 2015
Externally publishedYes
Event6th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2015 - Cancun, Mexico
Duration: 13 Dec 201516 Dec 2015

Publication series

Name2015 IEEE 6th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2015

Conference

Conference6th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2015
Country/TerritoryMexico
CityCancun
Period13/12/1516/12/15

Fingerprint

Dive into the research topics of 'On non-differentiable time-varying optimization'. Together they form a unique fingerprint.

Cite this