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 this page instead for the normal view: A hybrid descent method for solving a convex constrained optimization problem with applications |
scientific article; zbMATH DE number 7163605
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
