Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming (Q4697091): 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.1287/moor.18.1.202 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2112980792 / rank | |||
Normal rank | |||
Revision as of 19:16, 19 March 2024
scientific article; zbMATH DE number 221612
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming |
scientific article; zbMATH DE number 221612 |
Statements
Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming (English)
0 references
29 June 1993
0 references
nonlinear version of the proximal point algorithm
0 references
Bregman function
0 references
strictly convex differentiable function
0 references
distance measure
0 references
\(D\)-function proximal minimization algorithm
0 references
multiplier methods
0 references
nonquadratic variations on the proximal method of multipliers
0 references
