Optimization of “$\log x$” Entropy over Linear Equality Constraints

DOI10.1137/0325050zbMath0631.90050OpenAlexW2086855704MaRDI QIDQ3768680

Arnold Lent, Yair Censor

Publication date: 1987

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0325050

zbMATH Keywords

linear equality constraintsentropy functionalprojections onto hyperplanesrow-action algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Measures of information, entropy (94A17) Numerical methods of relaxation type (49M20)

Related Items

Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem ⋮ Dual coordinate ascent methods for non-strictly convex minimization ⋮ On some optimization techniques in image reconstruction from projections ⋮ How to deal with the unbounded in optimization: Theory and algorithms ⋮ Parallel application of block-iterative methods in medical imaging and radiation therapy ⋮ Well behaved asymptotical convex functions ⋮ On Block-Iterative Entropy Maximization ⋮ Re-examination of Bregman functions and new properties of their divergences ⋮ Duality for optimization problems with entropy-like objective functions ⋮ On computing the center of a convex quadratically constrained set ⋮ EM Algorithms ⋮ A block coordinate variable metric forward-backward algorithm ⋮ Optimization of Burg's entropy over linear constraints ⋮ About saddle values of a class of convex-concave functions ⋮ Theoretical efficiency of a shifted-barrier-function algorithm for linear programming ⋮ The primal-dual algorithm as a constraint-set-manipulation device ⋮ Descent methods for convex essentially smooth minimization ⋮ On the convergence of the coordinate descent method for convex differentiable minimization ⋮ Asymptotic properties of the Fenchel dual functional and applications to decomposition problems