The following pages link to (Q5453887):
Displaying 20 items.
- Higher-order sensitivity analysis in nonconvex vector optimization (Q974726) (← links)
- Sensitivity analysis in a class of dynamic optimization models (Q1265248) (← links)
- Sensitivity analysis in convex vector optimization (Q1321327) (← links)
- Sensitivity analysis of the proximal-based parallel decomposition methods (Q1719313) (← links)
- Sufficient optimality and sensitivity analysis of a parameterized min-max programming (Q1760808) (← links)
- Sensitivity analysis for convex multiobjective programming in abstract spaces (Q1922950) (← links)
- A geometric characterization of sensitivity analysis in monomial models (Q2105563) (← links)
- Sequential approximate weak optimality conditions for multiobjective fractional programming problems via sequential calculus rules for the Brøndsted-Rockafellar approximate subdifferential (Q2154691) (← links)
- Sensitivity analysis of optimization problems under second order regular constraints (Q2757567) (← links)
- (Q2762538) (← links)
- (Q3383636) (← links)
- Efficient calculation of sensitivities for optimization problems (Q3527519) (← links)
- (Q3983876) (← links)
- Sensitivity Analysis of Parametrized Programs under Cone Constraints (Q4030365) (← links)
- (Q4036809) (← links)
- Sensitivity Analysis of Optimal Value Functions of Convex Parametric Programs with Possibly Empty Solution Sets (Q4308562) (← links)
- Smooth representation of a parametric polyhedral convex set with application to sensitivity in optimization (Q4332982) (← links)
- A Parametric Sensitivity Analysis for the Solution of Extrema Evaluation Problems via a Dimensionality Reducing Approximation Method (Q4653757) (← links)
- WORHP Zen: Parametric Sensitivity Analysis for the Nonlinear Programming Solver WORHP (Q4685836) (← links)
- Sensitivity operator and approximate algorithm for parameter estimation (Q4726113) (← links)
