An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization (Q2218879)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7297587
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization |
scientific article; zbMATH DE number 7297587 |
Statements
An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization (English)
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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8461737036705017
0 references
0.8326191306114197
0 references
0.8242400288581848
0 references
0.8228623867034912
0 references
