\(L^{p}\)-norms, log-barriers and Cramer transform in optimization (Q618872): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1001.1208 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Barrier Functions in Interior Point Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of the barrier parameter of homogeneous convex cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4296156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why the logarithmic barrier function in convex and linear programming? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear and Integer Programming vs Linear Integration and Counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mond–Weir duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Laplace method for probability measures in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A duality theorem for non-linear programming / rank
 
Normal rank

Latest revision as of 15:37, 3 July 2024

scientific article
Language Label Description Also known as
English
\(L^{p}\)-norms, log-barriers and Cramer transform in optimization
scientific article

    Statements

    \(L^{p}\)-norms, log-barriers and Cramer transform in optimization (English)
    0 references
    17 January 2011
    0 references
    logarithmic barrier function
    0 references
    Legendre-Fenchel and Cramer transforms
    0 references
    0 references
    0 references

    Identifiers