Sensitivity Analysis of Parametrized Programs under Cone Constraints
From MaRDI portal
Recommendations
- Sensitivity Analysis for Cone-Constrained Optimization Problems Under the Relaxed Constraint Qualifications
- scientific article; zbMATH DE number 1182564
- scientific article; zbMATH DE number 5257352
- Sensitivity analysis in convex programming
- Publication:4735695
- Sensitivity analysis in parametrized convex vector optimization
- scientific article; zbMATH DE number 2208685
- Sensitivity analysis for parameterized variational inequality problems
- scientific article; zbMATH DE number 2073613
- Sensitivity Analysis of Parametrized Programs via Generalized Equations
Cited in
(11)- Sufficient optimality and sensitivity analysis of a parameterized min-max programming
- Stable local minimizers in semi-infinite optimization: Regularity and second-order conditions
- Stability and sensitivity of solutions to nonlinear optimal control problems
- Aubin property for solution set in multi-objective programming
- Complete Characterization of Openness, Metric Regularity, and Lipschitzian Properties of Multifunctions
- Sensitivity Analysis of Parametrized Programs via Generalized Equations
- scientific article; zbMATH DE number 2061924 (Why is no real title available?)
- Isolated efficiency in nonsmooth semi-infinite multi-objective programming
- WORHP Zen: Parametric Sensitivity Analysis for the Nonlinear Programming Solver WORHP
- Quantitative analysis for perturbed abstract inequality systems in Banach spaces
- scientific article; zbMATH DE number 6419199 (Why is no real title available?)
This page was built for publication: Sensitivity Analysis of Parametrized Programs under Cone Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4030365)