On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method (Q4012417): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0801025 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2032330602 / rank | |||
Normal rank | |||
Latest revision as of 02:16, 20 March 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
