Relaxed augmented Lagrangian-based proximal point algorithms for convex optimization with linear constraints (Q2438398): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: FTVd / rank | |||
Normal rank | |||
Revision as of 18:52, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relaxed augmented Lagrangian-based proximal point algorithms for convex optimization with linear constraints |
scientific article |
Statements
Relaxed augmented Lagrangian-based proximal point algorithms for convex optimization with linear constraints (English)
0 references
11 March 2014
0 references
convex optimization
0 references
proximal point algorithm
0 references
augmented Lagrangian method
0 references
relaxation
0 references
