A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property (Q1739040)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property |
scientific article |
Statements
A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property (English)
0 references
24 April 2019
0 references
convex composite minimization
0 references
sequential quadratic approximation (SQA)
0 references
proximal Newton method
0 references
error bound
0 references
superlinear convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7800090909004211
0 references
0.755793571472168
0 references
0.7509487867355347
0 references
0.7446041703224182
0 references
