An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints (Q255080): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C46 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65Y05 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6552290 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
convex optimization | |||
| Property / zbMATH Keywords: convex optimization / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
dual decomposition | |||
| Property / zbMATH Keywords: dual decomposition / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
inexact gradient method | |||
| Property / zbMATH Keywords: inexact gradient method / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
suboptimality and constraint violations | |||
| Property / zbMATH Keywords: suboptimality and constraint violations / rank | |||
Normal rank | |||
Revision as of 12:09, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints |
scientific article |
Statements
An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints (English)
0 references
9 March 2016
0 references
convex optimization
0 references
dual decomposition
0 references
inexact gradient method
0 references
suboptimality and constraint violations
0 references
