A superlinear space decomposition algorithm for constrained nonsmooth convex program (Q964944)
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 superlinear space decomposition algorithm for constrained nonsmooth convex program |
scientific article; zbMATH DE number 5696577
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A superlinear space decomposition algorithm for constrained nonsmooth convex program |
scientific article; zbMATH DE number 5696577 |
Statements
A superlinear space decomposition algorithm for constrained nonsmooth convex program (English)
0 references
21 April 2010
0 references
nonsmooth optimization
0 references
piecewise \(C^{2}\)
0 references
\(\mathcal {VU}\) decomposition
0 references
second-order expansion
0 references
numerical examples
0 references
local superlinear convergence
0 references
convex optimization
0 references
primal-dual gradient structure
0 references
0 references
0 references
0.8778408169746399
0 references
0.8297046422958374
0 references
0.8195386528968811
0 references
0.8073172569274902
0 references
0.7765836715698242
0 references
