On perturbed proximal gradient algorithms

From MaRDI portal
Publication:5361273

zbMath1433.90199arXiv1402.2365MaRDI QIDQ5361273

Yves F. Atchadé, Eric Moulines, Gersende Fort

Publication date: 27 September 2017

Full work available at URL: https://arxiv.org/abs/1402.2365




Related Items (39)

A fully stochastic primal-dual algorithmStochastic forward-backward splitting for monotone inclusionsStability of Over-Relaxations for the Forward-Backward Algorithm, Application to FISTAGradient flows and randomised thresholding: sparse inversion and classification*A SAEM algorithm for fused Lasso penalized nonlinear mixed effect models: application to group comparison in pharmacokineticsUnnamed ItemMinibatch Forward-Backward-Forward Methods for Solving Stochastic Variational InequalitiesThe Stochastic Auxiliary Problem Principle in Banach Spaces: Measurability and ConvergenceA dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problemsA random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regressionA strong law of large numbers for random monotone operatorsUnified analysis of stochastic gradient methods for composite convex and smooth optimizationOn the accept-reject mechanism for Metropolis-Hastings algorithmsStochastic variable metric proximal gradient with variance reduction for non-convex composite optimizationMaximum Likelihood Estimation of Regularization Parameters in High-Dimensional Inverse Problems: An Empirical Bayesian Approach Part I: Methodology and ExperimentsMaximum Likelihood Estimation of Regularization Parameters in High-Dimensional Inverse Problems: An Empirical Bayesian Approach. Part II: Theoretical AnalysisOn variance reduction for stochastic smooth convex optimization with multiplicative noiseStochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping. II: Mean-square and linear convergenceOptimization Methods for Large-Scale Machine LearningConvergence of contrastive divergence algorithm in exponential familyExploiting multi-core architectures for reduced-variance estimation with intractable likelihoodsNonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimizationConvergence of stochastic proximal gradient algorithmUnnamed ItemA unified convergence analysis of stochastic Bregman proximal gradient and extragradient methodsGeneral convergence analysis of stochastic first-order methods for composite optimizationDynamical behavior of a stochastic forward-backward algorithm using random monotone operatorsEfficient stochastic optimisation by unadjusted Langevin Monte Carlo. Application to maximum marginal likelihood and empirical Bayesian estimationConsistent online Gaussian process regression without the sample complexity bottleneckErgodic Convergence of a Stochastic Proximal Point AlgorithmStrong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorizationFast selection of nonlinear mixed effect models using penalized likelihoodUnnamed ItemStochastic proximal-gradient algorithms for penalized mixed modelsConvergence analysis of the stochastic reflected forward-backward splitting algorithmHigh-performance statistical computing in the computing environments of the 2020sSABRINA: a stochastic subspace majorization-minimization algorithmComputation for latent variable model estimation: a unified stochastic proximal frameworkProximal Gradient Methods for Machine Learning and Imaging




This page was built for publication: On perturbed proximal gradient algorithms