PARTIAL PROXIMAL METHOD OF MULTIPLIERS FOR CONVEX PROGRAMMING PROBLEMS (Q5284943)
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: PARTIAL PROXIMAL METHOD OF MULTIPLIERS FOR CONVEX PROGRAMMING PROBLEMS |
scientific article; zbMATH DE number 969569
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | PARTIAL PROXIMAL METHOD OF MULTIPLIERS FOR CONVEX PROGRAMMING PROBLEMS |
scientific article; zbMATH DE number 969569 |
Statements
PARTIAL PROXIMAL METHOD OF MULTIPLIERS FOR CONVEX PROGRAMMING PROBLEMS (English)
0 references
22 January 1997
0 references
global convergence
0 references
partial proximal method of multipliers
0 references
linear constraints
0 references
sum of two convex functions
0 references
multiple set constraints
0 references
traffic assignment
0 references
0.9643692
0 references
0.93531275
0 references
0.9341755
0 references
0.9338168
0 references
0.9299946
0 references
0.9274299
0 references
0.92732376
0 references
0.9265761
0 references
0.9249467
0 references
