On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method (Q4012417): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q590420 |
Changed an Item |
||
| Property / author | |||
| Property / author: Alfredo Noel Iusem / rank | |||
Normal rank | |||
Revision as of 21:32, 19 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method |
scientific article |
Statements
On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method (English)
0 references
27 September 1992
0 references
Bregman's method
0 references
convex objective
0 references
linear inequality constraints
0 references
rate of convergence
0 references
