Second-Order Filtering Algorithm for Streaming Optimization Problems

We consider the minimization of the sum of convex objectives with overlapping decision variables. These types of objectives occur in streaming signal reconstruction applications, where the observations of the signal occur in frames, and the loss functions for each frame are connected through overlapping basis functions. We show that a Newton-type algorithm for solving this type of problem can be extremely efficient when the coupling between the terms is “weak,” which we characterize with a certain notion of block-diagonal dominance of the Hessian. We apply the algorithm to the streaming reconstruction of the intensity function of a nonhomogeneous Poisson process and show that almost nothing is lost if the updates are performed using a finite buffer.

[1]  Terrence J. Sejnowski,et al.  Coding Time-Varying Signals Using Sparse, Shift-Invariant Representations , 1998, NIPS.

[2]  Monson H. Hayes,et al.  Statistical Digital Signal Processing and Modeling , 1996 .

[3]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[4]  D. Brillinger Maximum likelihood analysis of spike trains of interacting nerve cells , 2004, Biological Cybernetics.

[5]  Elad Hazan,et al.  Introduction to Online Convex Optimization , 2016, Found. Trends Optim..

[6]  Andreas Griewank,et al.  On the existence of convex decompositions of partially separable functions , 1984, Math. Program..

[7]  Andrea Simonetto Time-Varying Convex Optimization via Time-Varying Averaged Operators , 2017, 1704.07338.

[8]  Aryan Mokhtari,et al.  Target tracking with dynamic convex optimization , 2015, 2015 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

[9]  J. Preisig,et al.  Estimation of Rapidly Time-Varying Sparse Channels , 2007, IEEE Journal of Oceanic Engineering.

[10]  Asuman E. Ozdaglar,et al.  A globally convergent incremental Newton method , 2014, Math. Program..

[11]  P. Carpentier,et al.  Stochastic optimization of unit commitment: a new decomposition framework , 1996 .

[12]  T. Başar,et al.  A New Approach to Linear Filtering and Prediction Problems , 2001 .

[13]  Justin K. Romberg,et al.  Dynamic updating for sparse time varying signals , 2009, 2009 43rd Annual Conference on Information Sciences and Systems.

[14]  Andreas Griewank,et al.  On the unconstrained optimization of partially separable functions , 1982 .

[15]  Alejandro Ribeiro,et al.  Prediction-Correction Interior-Point Method for Time-Varying Convex Optimization , 2016, IEEE Transactions on Automatic Control.

[16]  P. Gill,et al.  Sequential Quadratic Programming Methods , 2012 .

[17]  Arkadi Nemirovski,et al.  Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

[18]  Aryan Mokhtari,et al.  A Class of Prediction-Correction Methods for Time-Varying Convex Optimization , 2015, IEEE Transactions on Signal Processing.

[19]  M S Lewicki,et al.  A review of methods for spike sorting: the detection and classification of neural action potentials. , 1998, Network.