A hybrid descent method for solving a convex constrained optimization problem with applications (Q5214959): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/mma.5855 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/mma.5855 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2971514741 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/MMA.5855 / rank | |||
Normal rank | |||
Latest revision as of 16:21, 30 December 2024
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
