Sequential sample average majorization-minimization
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4141936 (Why is no real title available?)
- scientific article; zbMATH DE number 3940389 (Why is no real title available?)
- scientific article; zbMATH DE number 3723610 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 3449561 (Why is no real title available?)
- scientific article; zbMATH DE number 857931 (Why is no real title available?)
- scientific article; zbMATH DE number 7306878 (Why is no real title available?)
- scientific article; zbMATH DE number 6252408 (Why is no real title available?)
- A stochastic approximation type EM algorithm for the mixture problem
- A stochastic quasi-Newton method for large-scale optimization
- A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- Accelerated optimization for machine learning. First-order algorithms. With forewords by Michael I. Jordan, Zongben Xu and Zhi-Quan Luo
- Acceleration of Stochastic Approximation by Averaging
- Approximation Theorems of Mathematical Statistics
- Block Bregman majorization minimization with extrapolation
- Block delayed Majorize-Minimize subspace algorithm for large scale image restoration *
- Control systems and reinforcement learning
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Convergence of a stochastic approximation version of the EM algorithm
- Convergence of online mirror descent
- Convergence of stochastic proximal gradient algorithm
- Convergence of the Monte Carlo expectation maximization for curved exponential families.
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex and stochastic optimization
- Convex optimization: algorithms and complexity
- Derivative-free and blackbox optimization
- Fast incremental expectation maximization for finite-sum optimization: nonasymptotic convergence
- Finite mixture models
- First-order and stochastic optimization methods for machine learning
- Gradient-based algorithms with applications to signal-recovery problems
- High-Dimensional Nonconvex Stochastic Optimization by Doubly Stochastic Successive Convex Approximation
- Incremental majorization-minimization optimization with application to large-scale machine learning
- Introduction to continuous optimization
- Iteration complexity analysis of block coordinate descent methods
- Learning and generalisation. With applications to neural networks.
- Lectures on stochastic programming. Modeling and theory
- MM optimization algorithms
- Mathematical statistics. Basic ideas and selected topics. Volume I
- Maximum likelihood estimation via the ECM algorithm: A general framework
- Mini-batch learning of exponential family finite mixture models
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
- Minimization by incremental stochastic surrogate optimization for large scale nonconvex problems
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Monotonicity of quadratic-approximation algorithms
- On perturbed proximal gradient algorithms
- On stochastic subgradient mirror-descent algorithm with weighted averaging
- On-line expectation-maximization algorithm for latent data models
- Online Successive Convex Approximation for Two-Stage Stochastic Nonconvex Optimization
- Optimization
- Parameter convergence for EM and MM algorithms
- Quantile regression under memory constraint
- Regularized Rényi divergence minimization through Bregman proximal gradient algorithms
- Risk-Based Robust Statistical Learning by Stochastic Difference-of-Convex Value-Function Optimization
- Robust Stochastic Approximation Approach to Stochastic Programming
- SABRINA: a stochastic subspace majorization-minimization algorithm
- Signal Recovery by Proximal Forward-Backward Splitting
- Solving Nonsmooth and Nonconvex Compound Stochastic Programs with Applications to Risk Measure Minimization
- Sparse optimization theory and methods
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Stochastic Successive Convex Approximation for Non-Convex Constrained Stochastic Optimization
- Stochastic limit theory. An introduction for econometricians
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping
- Stochastic variable metric proximal gradient with variance reduction for non-convex composite optimization
- Strong laws of large numbers for arrays of row-wise independent random variables
- The Concave-Convex Procedure
- The EM Algorithm and Extensions, 2E
- Understanding machine learning. From theory to algorithms
- Uniform laws of large numbers for triangular arrays of function-indexed processes under random entropy conditions
- Validation analysis of mirror descent stochastic approximation method
- Weak convergence and empirical processes. With applications to statistics
This page was built for publication: Sequential sample average majorization-minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6879398)
