A linear-time algorithm for the trust region subproblem based on hidden convexity (Q1686552)
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 6819058
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear-time algorithm for the trust region subproblem based on hidden convexity |
scientific article; zbMATH DE number 6819058 |
Statements
A linear-time algorithm for the trust region subproblem based on hidden convexity (English)
0 references
15 December 2017
0 references
trust region subproblem
0 references
hidden convexity
0 references
proximal gradient algorithm
0 references
linear time complexity
0 references
0 references
0.89215087890625
0 references
0.8611464500427246
0 references
0.8278643488883972
0 references
0.8246525526046753
0 references
