A primal-dual proximal point algorithm for constrained convex programs (Q1763276)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A primal-dual proximal point algorithm for constrained convex programs |
scientific article; zbMATH DE number 2136171
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A primal-dual proximal point algorithm for constrained convex programs |
scientific article; zbMATH DE number 2136171 |
Statements
A primal-dual proximal point algorithm for constrained convex programs (English)
0 references
22 February 2005
0 references
The author proposes a mixed proximal multipliers method to solve convex constrained minimization problems. The proposed method resembles to the Bregman method of multipliers with a quadratic regularization of the augmented Lagrangian function.
0 references
proximal point method
0 references
Bregman functions
0 references
multipliers method
0 references
convex constrained minimization
0 references
quadratic regularization
0 references
0 references
0 references
0 references
0.8752015829086304
0 references
0.840107262134552
0 references
0.8047991394996643
0 references
0.7992882132530212
0 references
0.793826162815094
0 references
