Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm (Q4785906): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s1052623401397242 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1969666805 / rank | |||
Normal rank | |||
Latest revision as of 08:55, 30 July 2024
scientific article; zbMATH DE number 1848721
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm |
scientific article; zbMATH DE number 1848721 |
Statements
Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm (English)
0 references
5 January 2003
0 references
subgradient inclusions
0 references
prox method
0 references
penalty schemes
0 references
convex programming
0 references
