A practical general approximation criterion for methods of multipliers based on Bregman distances (Q1396823): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10107-003-0374-x / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10107-003-0374-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2060627718 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10107-003-0374-X / rank | |||
Normal rank | |||
Latest revision as of 19:25, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A practical general approximation criterion for methods of multipliers based on Bregman distances |
scientific article |
Statements
A practical general approximation criterion for methods of multipliers based on Bregman distances (English)
0 references
13 July 2003
0 references
convex programming
0 references
augmented Lagrangian
0 references
conjugate duality framework
0 references
