Dual Prediction-Correction Methods for Linearly Constrained Time-Varying Convex Programs

Devising efficient algorithms to solve continuously-varying strongly convex optimization programs is key in many applications, from control systems to signal processing and machine learning. In this context, solving means to find and track the optimizer trajectory of the continuously-varying convex...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on automatic control Jg. 64; H. 8; S. 3355 - 3361
1. Verfasser: Simonetto, Andrea
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.08.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Asymptotic methods
Asymptotic properties
Computational geometry
Convergence
Convex analysis
Convex functions
Convexity
Cost function
Dual ascent
Error correction
Iterative algorithms
Iterative methods
Machine learning
parametric programming
Prediction algorithms
prediction–correction methods
Signal processing
Signal processing algorithms
time-varying convex optimization
Tracking errors
Trajectory
Trajectory optimization
ISSN:0018-9286, 1558-2523
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Devising efficient algorithms to solve continuously-varying strongly convex optimization programs is key in many applications, from control systems to signal processing and machine learning. In this context, solving means to find and track the optimizer trajectory of the continuously-varying convex optimization program. Recently, a novel prediction-correction methodology has been put forward to set up iterative algorithms that sample the continuously-varying optimization program at discrete time steps and perform a limited amount of computations to correct their approximate optimizer with the new sampled problem and predict how the optimizer will change at the next time step. Prediction-correction algorithms have been shown to outperform more classical strategies, i.e., correction-only methods. Typically, prediction-correction methods have asymptotical tracking errors of the order of <inline-formula><tex-math notation="LaTeX">h^2</tex-math></inline-formula>, where <inline-formula><tex-math notation="LaTeX">h</tex-math></inline-formula> is the sampling period, whereas classical strategies have order of <inline-formula><tex-math notation="LaTeX">h</tex-math></inline-formula>. Up to now, prediction-correction algorithms have been developed in the primal space, both for unconstrained and simply constrained convex programs. In this paper, we show how to tackle linearly constrained continuously-varying problem by prediction-correction in the dual space and we prove similar asymptotical error bounds as their primal versions.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2018.2877682