Convergence theorems for generalized alternating minimization procedures
From MaRDI portal
Recommendations
Cited in
(19)- A convergence theorem for graph shift-type algorithms
- An algorithm for generalized constrained multi-source Weber problem with demand substations
- Alternating minimization as sequential unconstrained minimization: a survey
- Fast incremental expectation maximization for finite-sum optimization: nonasymptotic convergence
- A convergence theorem for the fuzzy subspace clustering (FSC) algorithm
- Convergence of an alternating maximization procedure
- Alternating minimization algorithm with automatic relevance determination for transmission tomography under Poisson noise
- scientific article; zbMATH DE number 3930256 (Why is no real title available?)
- scientific article; zbMATH DE number 1222290 (Why is no real title available?)
- scientific article; zbMATH DE number 788229 (Why is no real title available?)
- Convergence properties of the EM algorithm in constrained parameter spaces
- A Scalable Empirical Bayes Approach to Variable Selection in Generalized Linear Models
- Statistical problem classes and their links to information theory
- Dependent relevance determination for smooth and structured sparse regression
- Statistical guarantees for the EM algorithm: from population to sample-based analysis
- On the Slow Convergence of EM and VBEM in Low-Noise Linear Models
- Alternating minimization algorithm with a probability generating function-based distance measure
- Mixed effect modelling and variable selection for quantile regression
- Clustering Time-Evolving Networks Using Temporal Exponential-Family Random Graph Models with Conditional Dyadic Independence and Dynamic Latent Blocks
This page was built for publication: Convergence theorems for generalized alternating minimization procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093330)
