150,693 research outputs found
Stochastic Quasi-Fej\'er Block-Coordinate Fixed Point Iterations with Random Sweeping
This work proposes block-coordinate fixed point algorithms with applications
to nonlinear analysis and optimization in Hilbert spaces. The asymptotic
analysis relies on a notion of stochastic quasi-Fej\'er monotonicity, which is
thoroughly investigated. The iterative methods under consideration feature
random sweeping rules to select arbitrarily the blocks of variables that are
activated over the course of the iterations and they allow for stochastic
errors in the evaluation of the operators. Algorithms using quasinonexpansive
operators or compositions of averaged nonexpansive operators are constructed,
and weak and strong convergence results are established for the sequences they
generate. As a by-product, novel block-coordinate operator splitting methods
are obtained for solving structured monotone inclusion and convex minimization
problems. In particular, the proposed framework leads to random
block-coordinate versions of the Douglas-Rachford and forward-backward
algorithms and of some of their variants. In the standard case of block,
our results remain new as they incorporate stochastic perturbations
Maximum Likelihood Estimation in Gaussian Chain Graph Models under the Alternative Markov Property
The AMP Markov property is a recently proposed alternative Markov property
for chain graphs. In the case of continuous variables with a joint multivariate
Gaussian distribution, it is the AMP rather than the earlier introduced LWF
Markov property that is coherent with data-generation by natural
block-recursive regressions. In this paper, we show that maximum likelihood
estimates in Gaussian AMP chain graph models can be obtained by combining
generalized least squares and iterative proportional fitting to an iterative
algorithm. In an appendix, we give useful convergence results for iterative
partial maximization algorithms that apply in particular to the described
algorithm.Comment: 15 pages, article will appear in Scandinavian Journal of Statistic
Sparse Approximation Via Iterative Thresholding
The well-known shrinkage technique is still relevant for contemporary signal processing problems over redundant dictionaries. We present theoretical and empirical analyses for two iterative algorithms for sparse approximation that use shrinkage. The GENERAL IT algorithm amounts to a Landweber iteration with nonlinear shrinkage at each iteration step. The BLOCK IT algorithm arises in morphological components analysis. A sufficient condition for which General IT exactly recovers a sparse signal is presented, in which the cumulative coherence function naturally arises. This analysis extends previous results concerning the Orthogonal Matching Pursuit (OMP) and Basis Pursuit (BP) algorithms to IT algorithms
- …