On Lagrange multipliers in convex entropy minimization
classification
🧮 math.OC
keywords
convexentropyfeasiblelagrangeminimizationmultiplierscharacterizationformally
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.