\(L^{p}\)-norms, log-barriers and Cramer transform in optimization

DOI10.1007/s11228-010-0146-8zbMath1229.90126arXiv1001.1208OpenAlexW2113535591MaRDI QIDQ618872

Jean-Bernard Lasserre, Eduardo S. Zeron

Publication date: 17 January 2011

Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1001.1208

zbMATH Keywords

logarithmic barrier functionLegendre-Fenchel and Cramer transforms

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26)

Cites Work

• Characterization of the barrier parameter of homogeneous convex cones
• Mond–Weir duality
• A duality theorem for non-linear programming
• Barrier Functions in Interior Point Methods
• The Laplace method for probability measures in Banach spaces
• Linear and Integer Programming vs Linear Integration and Counting
• Why the logarithmic barrier function in convex and linear programming?
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(L^{p}\)-norms, log-barriers and Cramer transform in optimization