On the problem of minimizing a difference of polyhedral convex functions under linear constraints (Q346824): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10957-015-0769-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2124024943 / rank | |||
Normal rank | |||
Revision as of 21:53, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the problem of minimizing a difference of polyhedral convex functions under linear constraints |
scientific article |
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
