A linear-time algorithm for the trust region subproblem based on hidden convexity (Q1686552): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GQTPAR / rank | |||
Normal rank | |||
Revision as of 20:47, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear-time algorithm for the trust region subproblem based on hidden convexity |
scientific article |
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
