Quadratically constrained minimum cross-entropy analysis (Q1119476)

From MaRDI portal
Revision as of 10:53, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Quadratically constrained minimum cross-entropy analysis
scientific article

    Statements

    Quadratically constrained minimum cross-entropy analysis (English)
    0 references
    0 references
    0 references
    1989
    0 references
    This paper deals with minimum cross-entropy problems with quadratic (convex) constraints. Using some geometric inequalities they derive a nonsmooth concave linearly constrained dual problem. Regularizing this dual problem they get a smooth dual problem whose solutions allow to compute an approximation of the primal solution.
    0 references
    duality
    0 references
    perturbation
    0 references
    minimum cross-entropy problems
    0 references
    quadratic (convex) constraints
    0 references
    geometric inequalities
    0 references
    nonsmooth concave linearly constrained dual problem
    0 references
    approximation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references