A higher-order smoothing technique for polyhedral convex functions: geometric and probabilistic considerations (Q2718687)
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 higher-order smoothing technique for polyhedral convex functions: geometric and probabilistic considerations |
scientific article; zbMATH DE number 1596896
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A higher-order smoothing technique for polyhedral convex functions: geometric and probabilistic considerations |
scientific article; zbMATH DE number 1596896 |
Statements
4 June 2001
0 references
rational interpolation
0 references
well-posed property
0 references
degree of binding
0 references
A higher-order smoothing technique for polyhedral convex functions: geometric and probabilistic considerations (English)
0 references
The authors show how a family of convex functions yields first and second-order information on the behavior of a polyhedral convex function. The links to linear programming and Legendre-Fenchel duality theory are discussed.
0 references
