On the problem of minimizing a difference of polyhedral convex functions under linear constraints (Q346824)
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 6657655
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the problem of minimizing a difference of polyhedral convex functions under linear constraints |
scientific article; zbMATH DE number 6657655 |
Statements
On the problem of minimizing a difference of polyhedral convex functions under linear constraints (English)
0 references
30 November 2016
0 references
d.p. programming
0 references
subdifferential
0 references
optimality conditions
0 references
stationary point
0 references
density
0 references
active index set
0 references
extreme point
0 references
0 references
0 references
0.8281658887863159
0 references
0.8162597417831421
0 references
0.7965214252471924
0 references
