Diminishing stepsize methods for nonconvex composite problems via ghost penalties: from the general to the convex regular constrained case (Q5058371)
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: Diminishing stepsize methods for nonconvex composite problems via ghost penalties: from the general to the convex regular constrained case |
scientific article; zbMATH DE number 7634880
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Diminishing stepsize methods for nonconvex composite problems via ghost penalties: from the general to the convex regular constrained case |
scientific article; zbMATH DE number 7634880 |
Statements
Diminishing stepsize methods for nonconvex composite problems via ghost penalties: from the general to the convex regular constrained case (English)
0 references
20 December 2022
0 references
constrained optimization
0 references
nonconvex optimization
0 references
composite optimization
0 references
diminishing stepsize
0 references
0 references
0 references
0 references
