Optimization of “\log x” Entropy over Linear Equality Constraints
From MaRDI portal
Publication:3768680
Recommendations
Cited in
(23)- Descent methods for convex essentially smooth minimization
- scientific article; zbMATH DE number 4184947 (Why is no real title available?)
- Duality for optimization problems with entropy-like objective functions
- scientific article; zbMATH DE number 4018254 (Why is no real title available?)
- Optimization of Burg's entropy over linear constraints
- EM Algorithms
- A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems
- About saddle values of a class of convex-concave functions
- Dual coordinate ascent methods for non-strictly convex minimization
- On the convergence of the coordinate descent method for convex differentiable minimization
- How to deal with the unbounded in optimization: Theory and algorithms
- On some optimization techniques in image reconstruction from projections
- scientific article; zbMATH DE number 773216 (Why is no real title available?)
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- A block coordinate variable metric forward-backward algorithm
- On computing the center of a convex quadratically constrained set
- Asymptotic properties of the Fenchel dual functional and applications to decomposition problems
- The primal-dual algorithm as a constraint-set-manipulation device
- Re-examination of Bregman functions and new properties of their divergences
- On Block-Iterative Entropy Maximization
- Theoretical efficiency of a shifted-barrier-function algorithm for linear programming
- Well behaved asymptotical convex functions
- Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem
This page was built for publication: Optimization of “$\log x$” Entropy over Linear Equality Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3768680)
