Second-order sensitivity analysis in factorable programming: Theory and applications (Q1104867)
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: Second-order sensitivity analysis in factorable programming: Theory and applications |
scientific article; zbMATH DE number 4057313
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Second-order sensitivity analysis in factorable programming: Theory and applications |
scientific article; zbMATH DE number 4057313 |
Statements
Second-order sensitivity analysis in factorable programming: Theory and applications (English)
0 references
1988
0 references
The authors compute the second derivatives of a local solution of an optimization problem subject to perturbations using third-order tensors. When the problem functions are factorable, they show that the resulting tensors are polyadic.
0 references
sensitivity analysis
0 references
polyads
0 references
high-order methods
0 references
Nth-order derivatives
0 references
factorable functions
0 references
Lagrangian analysis
0 references
second derivatives of a local solution
0 references
perturbations
0 references
third-order tensors
0 references
0 references
0 references
0.9148574
0 references
0.9009973
0 references
0.8930379
0 references
0.8804977
0 references
0 references
0.8631967
0 references
0.8571721
0 references
