Penalty-proximal methods in convex programming (Q1091267): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Alfred Auslender / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Jean-Pierre Crouzeix / rank | |||
Normal rank | |||
Revision as of 17:15, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Penalty-proximal methods in convex programming |
scientific article |
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
