Adaptive alternating minimization algorithms
Name
Niesen-2007-Adaptive Alternating.pdf
Size
186.25 KB
Format
Adobe PDF
Checksum (MD5)
545b5788aca63f3f25e8e200df77c998
Author(s)
Niesen, Urs
Shah, Devavrat
Wornell, Gregory W.
Date Issued
February 2009
Journal
IEEE Transactions on Information Theory
Publisher
Institute of Electrical and Electronics Engineers
Citation
Niesen, U., D. Shah, and G.W. Wornell. “Adaptive Alternating Minimization Algorithms.” Information Theory, IEEE Transactions on 55.3 (2009): 1423-1429. © 2009 IEEE
Version
Final published version
Abstract
The classical alternating minimization (or projection) algorithm has been successful in the context of solving optimization problems over two variables. The iterative nature and simplicity of the algorithm has led to its application in many areas such as signal processing, information theory, control, and finance. A general set of sufficient conditions for the convergence and correctness of the algorithm are known when the underlying problem parameters are fixed. In many practical situations, however, the underlying problem parameters are changing over time, and the use of an adaptive algorithm is more appropriate. In this paper, we study such an adaptive version of the alternating minimization algorithm. More precisely, we consider the impact of having a slowly time-varying domain over which the minimization takes place. As a main result of this paper, we provide a general set of sufficient conditions for the convergence and correctness of the adaptive algorithm. Perhaps somewhat surprisingly, these conditions seem to be the minimal ones one would expect in such an adaptive setting. We present applications of our results to adaptive decomposition of mixtures, adaptive log-optimal portfolio selection, and adaptive filter design.
Subjects
optimization methods
algorithms
adaptive signal processing
Arimoto–Blahut algorithm
Adaptive filters
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
http://dx.doi.org/10.1109/TIT.2008.2011442
