EM algorithms for optimization problems with polynomial objectives
From MaRDI portal
Cites work
- A geometric method in nonlinear programming
- A Survey of Some Model-Based Methods for Global Optimization
- A tutorial on the cross-entropy method
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- An adaptive barrier method for convex programming
- An Analysis of the EM Algorithm and Entropy-Like Proximal Point Methods
- An EM algorithm for wavelet-based image restoration
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
- Convergence of Proximal-Like Algorithms
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 739537 (Why is no real title available?)
- scientific article; zbMATH DE number 1390210 (Why is no real title available?)
- Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs
- Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
- MM optimization algorithms
- Monotonicity of quadratic-approximation algorithms
- Multiplicative iterative algorithms for convex programming
- Multivariate exponential families: a concise guide to statistical inference
- The cross-entropy method for combinatorial and continuous optimization
This page was built for publication: EM algorithms for optimization problems with polynomial objectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7267417)
