Penalty-proximal methods in convex programming (Q1091267)
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: Penalty-proximal methods in convex programming |
scientific article; zbMATH DE number 4010218
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Penalty-proximal methods in convex programming |
scientific article; zbMATH DE number 4010218 |
Statements
Penalty-proximal methods in convex programming (English)
0 references
1987
0 references
An implementable algorithm for constrained nonsmooth convex programs with the proximal method. In the case of a linear program, the convergence is finite.
0 references
convergence analysis
0 references
constrained nonsmooth convex programs
0 references
proximal method
0 references
0 references
0 references
0 references
