Dual convergence of the proximal point method with Bregman distances for linear programming (Q5758227)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5186063
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dual convergence of the proximal point method with Bregman distances for linear programming |
scientific article; zbMATH DE number 5186063 |
Statements
Dual convergence of the proximal point method with Bregman distances for linear programming (English)
0 references
3 September 2007
0 references
linear programming problem
0 references
proximal point method
0 references
Bregman distance
0 references
0 references
0 references
0 references
0 references
0.8595443367958069
0 references
0.8595443367958069
0 references
0.8323373198509216
0 references
0.8243339657783508
0 references
