On Lagrange multipliers in convex entropy minimization

2017/08/28 by Constantin Zălinescu, Zalinescu, Constantin
Computer Science · Mathematics · #90C25 49K99 94A17 #Advanced Optimization Algorithms Research #FOS: Mathematics #Nonlinear Partial Differential Equations #Optimization and Control (math.OC) #Optimization and Variational Analysis

paper · pdf · doi:10.48550/arxiv.1708.08302

openalex publication_date 2017/08/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Based on a characterization of the optimality of a feasible solution of a convex entropy minimization problem, one shows that the feasible solutions obtained using formally the Lagrange multipliers method are optimal.

Related

• On the entropy minimization problem in Statistical Mechanics
• Geometry of maximum-entropy proofs: stationary points, convexity, Legendre transforms, exponential families
• Shannon-and von neumann-entropy regularizations of linear and semidefinite programs
• Optimizing entropy relative to a channel or a subalgebra
• Convex minimization problems with weak constraint qualifications