A hybrid descent method for solving a convex constrained optimization problem with applications (Q5214959)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7163605
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A hybrid descent method for solving a convex constrained optimization problem with applications |
scientific article; zbMATH DE number 7163605 |
Statements
A hybrid descent method for solving a convex constrained optimization problem with applications (English)
0 references
5 February 2020
0 references
bandwidth allocation problem
0 references
hybrid descent methods
0 references
quasi-nonexpansive mapping
0 references
strongly pseudo-monotone mapping
0 references
variational inequalities
0 references
0.8047145009040833
0 references
0.7993006706237793
0 references
0.7993006110191345
0 references
0.7894306182861328
0 references
0.7886154055595398
0 references
