Pages that link to "Item:Q979946"
From MaRDI portal
The following pages link to Sensitivity analysis in convex programming (Q979946):
Displaying 22 items.
- On higher-order adjacent derivative of perturbation map in parametric vector optimization (Q267712) (← links)
- On higher-order proto-differentiability and higher-order asymptotic proto-differentiability of weak perturbation maps in parametric vector optimization (Q830192) (← links)
- A natural extension of the classical envelope theorem in vector differential programming (Q897053) (← links)
- Higher-order sensitivity analysis in nonconvex vector optimization (Q974726) (← links)
- Sensitivity analysis in economics (Q1085787) (← links)
- Sensitivity analysis in posynomial geometric programming (Q1090245) (← links)
- Sensitivity analysis in convex vector optimization (Q1321327) (← links)
- Variational sets and asymptotic variational sets of proper perturbation map in parametric vector optimization (Q1683297) (← links)
- Sensitivity analysis in differential programming through the Clarke derivative (Q1758634) (← links)
- Sensitivity analysis for convex multiobjective programming in abstract spaces (Q1922950) (← links)
- On higher-order proto-differentiability of perturbation maps (Q2174938) (← links)
- Paratingent derivative applied to the measure of the sensitivity in multiobjective differential programming (Q2319132) (← links)
- Sensitivity analysis in convex optimization through the circatangent derivative (Q2346913) (← links)
- The envelope theorem for multiobjective convex programming via contingent derivatives (Q2637941) (← links)
- Sensitivity analysis in bilevel linear programming (Q2721844) (← links)
- Sensitivity Analysis of Parametrized Programs under Cone Constraints (Q4030365) (← links)
- (Q4036809) (← links)
- Generalized linear programming and sensitivity analysis techniques (Q4883160) (← links)
- On Second-Order Composed Proto-Differentiability of Proper Perturbation Maps in Parametric Vector Optimization Problems (Q5012888) (← links)
- (Q5453887) (← links)
- Sensitivity analysis in linear programming and semidefinite programming using interior-point methods (Q5935708) (← links)
- Sensitivity analysis of discrete preference functions using Koszul simplicial complexes (Q6060373) (← links)
