An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization (Q2218879)

From MaRDI portal
Revision as of 06:19, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization
scientific article

    Statements

    An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization (English)
    0 references
    0 references
    18 January 2021
    0 references
    kernel function
    0 references
    linearly constrained convex optimization
    0 references
    interior point methods
    0 references
    large-update methods
    0 references
    complexity bounds
    0 references
    non-negative matrix factorization
    0 references

    Identifiers